Finding and testing network communities by lumped Markov chains

PLoS ONE

Volumn 6, Issue 11, 2011, Pages

  Piccardi, Carlo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; COMPUTER NETWORK; CONTROLLED STUDY; LUMPED MARKOV CHAIN; PARTITION; PROBABILITY; SOCIAL NETWORK; STATISTICAL ANALYSIS;

CLUSTER ANALYSIS; MARKOV CHAINS; PROBABILITY;

EID: 80455174307     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0027028     Document Type: Article

References (55)

1. Strogatz SH, (2001) Exploring complex networks. Nature 410: 268-276.
2. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DH, (2006) Complex networks: Structure and dynamics. Phys Rep 424: 175-308.
3. Barrat A, Barthlemy M, Vespignani A, (2008) Dynamical Processes on Complex Networks. Cambridge University Press.
4. Newman MEJ, (2010) Networks: An Introduction. Oxford University Press.
5. Newman MEJ, (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103: 8577-8582.
6. Guimera R, Sales-Pardo M, Amaral LAN, (2007) Module identification in bipartite and directed networks. Phys Rev E 76: 036102.
7. Jonsson P, Cavanna T, Zicha D, Bates P, (2006) Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis. BMC Bioinformatics 7.
8. Krause AE, Frank KA, Mason DM, Ulanowicz RE, Taylor WW, (2003) Compartments revealed in food-web structure. Nature 426: 282-285.
9. Piccardi C, Calatroni L, Bertoni F, (2010) Communities in italian corporate networks. Physica A 389: 5247-5258.
10. Flake G, Lawrence S, Giles C, Coetzee F, (2002) Self-organization and identification of web communities. Computer 35: 66-71.
11. Šubelj L, Bajec M, (2011) Community structure of complex software systems: Analysis and applications. Physica A 390: 2968-2975.
12. Fortunato S, (2010) Community detection in graphs. Phys Rep 486: 75-174.
13. Wasserman S, Faust K, (1994) Social Network Analysis. Cambridge, UK Cambridge University Press.
14. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D, (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101: 2658-2663.
15. Reichardt J, Bornholdt S, (2006) When are networks truly modular? Physica D 224: 20-26.
16. Hu Y, Chen H, Zhang P, Li M, Di Z, et al. (2008) Comparative definition of community and corresponding identifying algorithm. Phys Rev E 78: 026121.
17. Newman MEJ, Girvan M, (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 026113.
18. Newman MEJ, (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74: 036104.
19. Fortunato S, Barthelemy M, (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104: 36-41.
20. Hu Y, Nie Y, Yang H, Cheng J, Fan Y, et al. (2010) Measuring the significance of community structure in complex networks. Phys Rev E 82: 066106.
21. Kovacs IA, Palotai R, Szalay MS, Csermely P, (2010) Community landscapes: An integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics. PLoS One 5: e12528.
22. Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S, (2011) Finding statistically significant communities in networks. PLoS One 6: e18961.
23. Meyer C, (2000) Matrix Analysis and Applied Linear Algebra. SIAM.
24. Kemeny JG, Snell JL, (1976) Finite Markov Chains. Springer-Verlag.
25. Buchholz P, (1994) Exact and ordinary lumpability in finite Markov-chains. J Appl Probab 31: 59-75.
26. Hoffmann KH, Salamon P, (2009) Bounding the lumping error in Markov chain dynamics. Appl Math Lett 22: 1471-1475.
27. Fortunato S, Castellano C, (2009) Community structure in graphs. Meyers, RA, editor, Encyclopedia of Complexity and System Science, Springer-Verlag Berlin pp.1141-1163.
28. Kim Y, Son SW, Jeong H, (2010) Finding communities in directed networks. Phys Rev E 81: 016103.
29. Reichardt J, Bornholdt S, (2007) Partitioning and modularity of graphs with arbitrary degree distribution. Phys Rev E 76: 015102.
30. Sima J, Schaeffer S, (2006) On the NP-completeness of some graph cluster measures. In: Wiedermann J, Tel G, Pokorny J, Bielikova M, Stuller J, editors. SOFSEM 2006: Theory and Practice of Computer Science, Proceedings. volume 3831 pp.of Lecture Notes in Computer Science: 530-537.
31. Zhou H, (2003) Distance, dissimilarity index, and network community structure. Phys Rev E 67.
32. Pons P, Latapy M, Computing communities in large networks using random walks. In: Yolum P, Gungor T, Gurgen F, Ozturan C, editors. Computer and Information Sciences- ISCIS 2005, Proceedings Yolum, P and Gungor, T and Gurgen, F and Ozturan, C, editor, Springer-Verlag Berlin, date volume 3733 of Lecture Notes In Computer Science pp.284-293.
33. Fouss F, Pirotte A, Renders JM, Saerens M, (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19: 355-369.
34. Rosvall M, Bergstrom CT, (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105: 1118-1123.
35. Steinhaeuser K, Chawla NV, (2010) Identifying and evaluating community structure in complex networks. Pattern Recognit Lett 31: 413-421.
36. Everitt BS, Landau S, Leese M, Stahl D, (2011) Cluster Analysis, 5th ed. John Wiley & Sons.
37. Holgersson M, (1978) The limited value of cophenetic correlation as a clustering criterion. Pattern Recognit 10: 287-295.
38. Lancichinetti A, Fortunato S, Radicchi F, (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78.
39. Lancichinetti A, Fortunato S, (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80.
40. Danon L, Diaz-Guilera A, Duch J, Arenas A, (2005) Comparing community structure identification. J Stat Mech-Theory Exp.
41. Reichardt J, Bornholdt S, (2004) Detecting fuzzy community structures in complex networks with a Potts model. Phys Rev Lett 93: 218701.
42. Delvenne JC, Yaliraki SN, Barahona M, (2010) Stability of graph communities across time scales. Proc Natl Acad Sci USA 107: 12755-12760.
43. Narayanam R, Narahari Y, (2011) A Shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8: 130-147.
44. Cafieri S, Hansen P, Liberti L, (2011) Locally optimal heuristic for modularity maximization of networks. Phys Rev E 83: 056105.
45. Kannan R, Vempala S, Vetta A, (2004) On clusterings: Good, bad and spectral. J ACM 51: 497-515.
46. Serrano MA, Boguñá M, (2003) Topology of the world trade web. Phys Rev E 68: 015101.
47. Garlaschelli D, Loffredo MI, (2005) Structure and evolution of the world trade network. Physica A 335: 138-144.
48. Fagiolo G, Reyez J, Schiavo S, (2008) On the topological properties of the world trade web: a weighted network analysis. Physica A 387: 3868-3873.
49. He J, Deem MW, (2010) Structure and response in the world trade network. Phys Rev Lett 105: 198701.
50. Barigozzi M, Fagiolo G, Mangioni G, (2011) Identifying the community structure of the international-trade multi-network. Physica A 390: 2051-2066.
51. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E, (2008) Fast unfolding of communities in large networks. J Stat Mech-Theory Exp.
52. Weinan E, Li T, Vanden-Eijnden E, (2008) Optimal partition and effective dynamics of complex networks. Proc Natl Acad Sci USA 105: 7907-7912.
53. Palla G, Derenyi I, Farkas I, Vicsek T, (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435: 814-818.
54. Lancichinetti A, Fortunato S, Kertesz J, (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11: 033015.
55. Fenn DJ, Porter MA, McDonald M, Williams S, Johnson NF, et al. (2009) Dynamic communities in multichannel data: An application to the foreign exchange market during the 2007-2008 credit crisis. Chaos 19: 033119.