Site Search
Computer Science

Photos

Subir Bandyopadhyay, Ph.D.Dr. Subir Bandyopadhyay
Dr. Subir Bandyopadhyay
Christie Ezeife, Ph.D.Dr. Christie Ezeife
Dr. Christie Ezeife
Windsor WaterfrontWindsor Waterfront Park
Windsor Waterfront Park
Lambton TowerLambton Tower
Lambton Tower
Joan Morrissey, Ph.D.Dr. Joan Morrissey
Dr. Joan Morrissey
Arunita Jaekel, Ph.D.Dr. Arunita Jaekel
Dr. Arunita Jaekel
Imran Ahmad, Ph.D.Dr. Imran Ahmad
Dr. Imran Ahmad
Dr. Scott GoodwinDr. Scott Goodwin
Dr. Scott Goodwin
Xiaobu Yuan, Ph.D.Dr. Xiaobu Yuan
Dr. Xiaobu Yuan
Dr. Robert KentDr. Robert Kent
Dr. Robert Kent
Dr. Ziad Kobti lecturingDr. Ziad Kobti
Dr. Ziad Kobti
Alioune Ngom, Ph.D.Dr. Alioune Ngom
Dr. Alioune Ngom
Dr. Luis RuedaDr. Luis Rueda
Dr. Luis Rueda
Robin Gras, Ph.D.Dr. Robin Gras
Dr. Robin Gras
Jessica Chen, Ph.D.Dr. Jessica Chen
Dr. Jessica Chen
Richard A. Frost, Ph.D.Dr. Richard A. Frost
Dr. Richard A. Frost

Scalable Algorithms on Large Graphs Based on Sampling

Add this event into your calendar using the iCAL format
  • Fri, 05/19/2017 - 12:00pm - 2:00pm




Scalable Algorithms on Large Graphs Based on Sampling

 

PhD. Comprehensive Exam by:

Roohollah Etemadi

Date:   Friday, May 19th, 2017
Time: 12:00 pm
Location: Lambton Tower, 3105

Abstract:Graphs are used to model the interaction among entities in many real networks in computer science, the Internet, biology, chemistry, economic, and many other fields. Metrics such as the number of triangles (∆), clustering coefficient (C), average shortest path length (ASPL), and community structure have been used to understand the complex structure of such graphs. Recently, however, two challenges have arisen. First, computing such properties using traditional methods is expensive in term of time and memory usage on large graphs. Second, direct computing is impossible when the entire data is inaccessible. For instance, user networks in Twitter and Facebook are not available for third parties to explore their properties directly. Therefore, sampling based methods are indispensable.  This presentation will cover basic information on sampling methods and recent progress to estimate ∆, C, and ASPL, and to detect community structure on large graphs using sampling techniques.

Thesis Committee:     
Internal Reader: Dr. Mehdi Kargar and Dr. Dan Wu  
External Reader: Dr. Majid Ahmadi
Advisors: Dr. Jianguo Lu and Dr. Yung H. Tsin             



csgradinfo@uwindsor.ca
(519)253-3000


See More: