|
Activity Number:
|
124
|
|
Type:
|
Invited
|
|
Date/Time:
|
Monday, August 7, 2006 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
IMS
|
| Abstract - #305303 |
|
Title:
|
Community Detection in Large Networks
|
|
Author(s):
|
Jörg Reichardt*+
|
|
Companies:
|
University of Bremen
|
|
Address:
|
Complex Systems Lab, Otto-Hahn-Allee, 28359,
|
|
Keywords:
|
|
|
Abstract:
|
The problem of community detection or graph clustering has received considerable attention in recent years for its wide range of applications in exploratory data analysis and hypothesis formation for relational data sets. By using an analogy with a statistical mechanics problem, the so called Potts model, the talk will shed some light onto the nature of the problem and provide insights into the structure of its solutions. A concise definition of community, hierarchical and overlapping community structures will be given and comparisons with alternative definitions and community detection methods are made. An application to a large real world network with close to one million nodes will be shown and the statistical significance of the findings will be discussed.
|
- The address information is for the authors that have a + after their name.
- Authors who are presenting talks have a * after their name.
Back to the full JSM 2006 program |
