Comparing community structure identification -: art. no. P09008

被引:2002
作者
Danon, L
Díaz-Guilera, A
Duch, J
Arenas, A
机构
[1] Univ Barcelona, Dept Fis Fonamental, Barcelona 08086, Spain
[2] Univ Rovira & Virgili, Dept Engn Informat & Matemat, Tarragona 43007, Spain
关键词
analysis of algorithms; network dynamics;
D O I
10.1088/1742-5468/2005/09/P09008
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.
引用
收藏
页码:219 / 228
页数:10
相关论文
共 44 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]  
[Anonymous], 1970, BELL SYST TECH J, DOI [10.1002/j.1538-7305.1970.tb01770.x, DOI 10.1002/J.1538-7305.1970.TB01770.X]
[3]   Community analysis in social networks [J].
Arenas, A ;
Danon, L ;
Díaz-Guilera, A ;
Gleiser, PM ;
Guimerà, R .
EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) :373-380
[4]  
BAGROW JP, 2004, CONDMAT0412482
[5]   Extremal optimization for graph partitioning [J].
Boettcher, S ;
Percus, AG .
PHYSICAL REVIEW E, 2001, 64 (02) :13
[6]  
Bornholdt S., 2002, Handbook of Graphs and Networks: An Interdisciplinary Approach
[7]  
BOSS M, 2003, CONDMAT0309582
[8]  
Capocci A, 2004, LECT NOTES COMPUT SC, V3243, P181
[9]  
Clauset A, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.066111
[10]  
DANON L, 2005, IN PRESS COSIN BOOK