Community detection in graphs

Physics Reports

Volumn 486, Issue 3-5, 2010, Pages 75-174

  Fortunato, Santo ^a  

^a ISI FOUNDATION   (Italy)

Author keywords

Clusters; Graphs; Statistical physics

Indexed keywords

EID: 74049087026     PISSN: 03701573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physrep.2009.11.002     Document Type: Review

References (457)

1. Euler L. Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Petropolitanae 1736, 8:128-140.
2. Bollobas B. Modern Graph Theory 1998, Springer Verlag, New York, USA.
3. Wasserman S, Faust K. Social Network Analysis 1994, Cambridge University Press, Cambridge, UK.
4. Scott J. Social Network Analysis: A Handbook 2000, SAGE Publications, London, UK.
5. Albert R, Barabási A-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 2002, 74(1):47-97.
6. Mendes JFF, Dorogovtsev SN. Evolution of Networks: From Biological Nets to the Internet and WWW 2003, Oxford University Press, Oxford, UK.
7. Newman MEJ. The structure and function of complex networks. SIAM Rev. 2003, 45(2):167-256.
8. Pastor-Satorras R, Vespignani A. Evolution and Structure of the Internet: A Statistical Physics Approach 2004, Cambridge University Press, New York, NY, USA.
9. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU. Complex networks: Structure and dynamics. Phys. Rep. 2006, 424(4-5):175-308.
10. Barrat A, Barthélemy M, Vespignani A. Dynamical Processes on Complex Networks 2008, Cambridge University Press, Cambridge, UK.
11. Erdös P, Rényi A. On random graphs. I. Publ. Math. Debrecen 1959, 6:290-297.
12. Girvan M, Newman MEJ. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 2002, 99(12):7821-7826.
13. Newman MEJ. Detecting community structure in networks. Eur. Phys. J. B 2004, 38:321-330.
14. Danon L, Duch J, Arenas A, Díaz-Guilera A. Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science 2007, 93-114. World Scientific, Singapore. C. G., V. A. (Eds.).
15. Schaeffer SE. Graph clustering. Comput. Sci. Rev. 2007, 1(1):27-64.
16. Fortunato S, Castellano C. Community structure in graphs. Encyclopedia of Complexity and Systems Science, vol. 1 2009, Springer, Berlin, Germany, eprint arXiv:0712.2716. R.A. Meyers (Ed.).
17. Porter MA, Onnela J-P, Mucha PJ. Communities in networks. Notices of the American Mathematical Society 2009, 56:1082-1166.
18. Coleman JS. An Introduction to Mathematical Sociology 1964, Collier-Macmillan, London, UK.
19. Freeman LC. The Development of Social Network Analysis: A Study in the Sociology of Science 2004, BookSurge Publishing.
20. Kottak CP. Cultural Anthropology 2004, McGraw-Hill, New York, USA.
21. Moody J, White DR. Structural cohesion and embeddedness: A hierarchical concept of social groups. Am. Sociol. Rev. 2003, 68(1):103-127.
22. Rives AW, Galitski T. Modular organization of cellular networks. Proc. Natl. Acad. Sci. USA 2003, 100(3):1128-1133.
23. Spirin V, Mirny LA. Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. USA 2003, 100(21):12123-12128.
24. Chen J, Yuan B. Detecting functional modules in the yeast protein-protein interaction network. Bioinformatics 2006, 22(18):2283-2290.
25. Flake GW, Lawrence S, Lee Giles C, Coetzee FM. Self-organization and identification of web communities. IEEE Computer 2002, 35:66-71.
26. Dourisboure Y, Geraci F, Pellegrini M. Extraction and classification of dense communities in the web. WWW '07: Proceedings of the 16th International Conference on the World Wide Web 2007, 461-470. ACM, New York, NY, USA.
27. Guimerà R, Amaral LAN. Functional cartography of complex metabolic networks. Nature 2005, 433:895-900.
28. Palla G, Derényi I, Farkas I, Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature 2005, 435:814-818.
29. Pimm SL. The structure of food webs. Theoret. Popul. Biol. 1979, 16:144-158.
30. Krause AE, Frank KA, Mason DM, Ulanowicz RE, Taylor WW. Compartments revealed in food-web structure. Nature 2003, 426:282-285.
31. Krishnamurthy B, Wang J. On network-aware clustering of web clients. SIGCOMM Comput. Commun. Rev. 2000, 30(4):97-110.
32. Reddy KP, Kitsuregawa M, Sreekanth P, Rao SS. A graph based approach to extract a neighborhood customer community for collaborative filtering. DNIS '02: Proceedings of the Second International Workshop on Databases in Networked Information Systems 2002, 188-200. Springer-Verlag, London, UK.
33. Agrawal R, Jagadish HV. Algorithms for searching massive graphs. Knowl. Data Eng. 1994, 6(2):225-238.
34. Wu AY, Garland M, Han J. Mining scale-free networks using geodesic clustering. KDD '04: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2004, 719-724. ACM Press, New York, NY, USA.
35. Perkins CE. Ad Hoc Networking 2001, Addison-Wesley, Reading, USA. 1st edition.
36. Steenstrup M. Cluster-Based Networks 2001, Addison Wesley, Reading, USA, (Chapter 4).
37. Csermely P. Creative elements: Network-based predictions of active centres in proteins and cellular and social networks. Trends Biochem. Sci. 2008, 33(12):569-576.
38. Granovetter M. The strength of weak ties. Am. J. Sociol. 1973, 78:1360-1380.
39. Burt RS. Positions in networks. Soc. Forces 1976, 55:93-122.
40. Freeman LC. A set of measures of centrality based on betweenness. Sociometry 1977, 40:35-41.
41. Gfeller D, De Los Rios P. Spectral coarse graining of complex networks. Phys. Rev. Lett. 2007, 99(3):038701.
42. Gfeller D, De Los Rios P. Spectral coarse graining and synchronization in oscillator networks. Phys. Rev. Lett. 2008, 100(17):174104.
43. Pollner P, Palla G, Vicsek T. Preferential attachment of communities: The same principle, but a higher level. Europhys. Lett. 2006, 73:478-484.
44. Simon H. The architecture of complexity. Proc. Am. Phil. Soc. 1962, 106(6):467-482.
45. Weiss RS, Jacobson E. A method for the analysis of the structure of complex organizations. Am. Sociol. Rev. 1955, 20:661-668.
46. Rice SA. The identification of blocs in small political bodies. Am. Polit. Sci. Rev. 1927, 21:619-627.
47. Homans GC. The Human Groups 1950, Harcourt, Brace & Co, New York.
48. Donetti L, Muñoz MA. Detecting network communities: a new systematic and efficient algorithm. J. Stat. Mech. 2004, P10012.
49. Arenas A, Fernández A, Gómez S. Analysis of the structure of complex networks at different resolution levels. New J. Phys. 2008, 10(5):053039.
50. Zachary WW. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 1977, 33:452-473.
51. Lusseau D. The emergent properties of a dolphin social network. Proc. R. Soc. London B 2003, 270:S186-S188.
52. Zhang A. Protein Interaction Networks 2009, Cambridge University Press, Cambridge, UK.
53. Jonsson PF, Cavanna T, Zicha D, Bates PA. Cluster analysis of networks generated through homology: Automatic identification of important protein communities involved in cancer metastasis. BMC Bioinf. 2006, 7:2.
54. Newman MEJ, Girvan M. Finding and evaluating community structure in networks. Phys. Rev. E 2004, 69(2):026113.
55. Albert R, Jeong H, Barabási A-L. Internet: Diameter of the world-wide web. Nature 1999, 401:130-131.
56. Brin S, Page LE. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN 1998, 30:107-117.
57. Leicht EA, Newman MEJ. Community structure in directed networks. Phys. Rev. Lett. 2008, 100(11):118703.
58. Rosvall M, Bergstrom CT. Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. USA 2008, 105:1118-1123.
59. D.L. Nelson, C.L. McEvoy, T.A. Schreiber, The university of south florida word association, rhyme, and word fragment norms (1998).
60. Barber MJ. Modularity and community detection in bipartite networks. Phys. Rev. E 2007, 76(6):066102.
61. Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 2005, 17(6):734-749.
62. Davis A, Gardner BB, Gardner MR. Deep South 1941, University of Chicago Press, Chicago, USA.
63. Gan G, Ma C, Wu J. Data Clustering: Theory, Algorithms, and Applications (ASA-SIAM Series on Statistics and Applied Probability) 2007, Society for Industrial and Applied Mathematics, Philadelphia, USA.
64. Garey MR, Johnson DS. Computers and Intractability : A Guide to the Theory of NP-Completeness 1990, W. H. Freeman & Co., New York, USA.
65. Papadimitriou CM. Computational Complexity 1994, Addison-Wesley, Reading, USA.
66. Mancoridis S, Mitchell BS, Rorres C, Chen Y, Gansner ER. Using automatic clustering to produce high-level system organizations of source code. IWPC '98: Proceedings of the 6th International Workshop on Program Comprehension 1998, IEEE Computer Society, Washington, DC, USA.
67. Luce RD, Perry AD. A method of matrix analysis of group structure. Psychometrika 1949, 14(2):95-116.
68. Bomze IM, Budinich M, Pardalos PM, Pelillo M. The maximum clique problem. Handbook of Combinatorial Optimization 1999, 1-74. Kluwer Academic Publishers, Norwell, USA. D.-Z. Du, P. Pardalos (Eds.).
69. Bron C, Kerbosch J. Finding all cliques on an undirected graph. Commun. ACM 1973, 16:575-577.
70. Luce RD. Connectivity and generalized cliques in sociometric group structure. Psychometrika 1950, 15(2):169-190.
71. Alba RD. A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 1973, 3:113-126.
72. Mokken RJ. Cliques, clubs and clans. Qual. Quant. 1979, 13(2):161-173.
73. Seidman SB, Foster BL. A graph theoretic generalization of the clique concept. J. Math. Sociol. 1978, 6:139-154.
74. Seidman SB. Network structure and minimum degree. Soc. Netw. 1983, 5:269-287.
75. V. Batagelj, M. Zaversnik, An o(m) algorithm for cores decomposition of networks. arxiv:cs.DS/0310049.
76. Matsuda H, Ishihara T, Hashimoto A. Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoret. Comput. Sci. 1999, 210:305-325.
77. Luccio F, Sami M. IEEE Trans. Circuit Th. CT 1969, 16:184-188.
78. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D. Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA 2004, 101:2658-2663.
79. Hu Y, Chen H, Zhang P, Li M, Di Z, Fan Y. Comparative definition of community and corresponding identifying algorithm. Phys. Rev. E 2008, 78(2):026121.
80. Borgatti S, Everett M, Shirey P. LS sets, lambda sets, and other cohesive subsets. Soc. Netw. 1990, 12:337-358.
81. Feige U, Peleg D, Kortsarz G. The dense k-subgraph problem. Algorithmica 2001, 29(3):410-421.
82. Asahiro Y, Hassin R, Iwama K. Complexity of finding dense subgraphs. Discrete Appl. Math. 2002, 121(1-3):15-26.
83. Holzapfel K, Kosub S, Maa MG, Täubig H. The complexity of detecting fixed-density clusters. CIAC 2003, vol. 2653:201-212. Springer. R. Petreschi, G. Persiano, R. Silvestri (Eds.).
84. Šíma J, Schaeffer SE. On the NP-completeness of some graph cluster measures. Proceedings of the Thirty-second International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 06) 2006, vol. 3831:530-537. Springer-Verlag, Berlin, Heidelberg, Germany. J. Wiedermann, G. Tel, J. Pokorný, M. Bieliková, J. Štuller (Eds.).
85. Reichardt J, Bornholdt S. Statistical mechanics of community detection. Phys. Rev. E 2006, 74(1):016110.
86. Lorrain F, White H. Structural equivalence of individuals in social networks. J. Math. Sociol. 1971, 1:49-80.
87. Elias P, Feinstein A, Shannon CE. Note on maximum flow through a network. IRE Trans. Inf. Theory IT- 1956, 2:117-119.
88. Ahuja RK, Magnanti TL, Orlin JB. Network Flows: Theory, Algorithms, and Applications 1993, Prentice Hall, Englewood Cliffs, USA.
89. Estrada E, Hatano N. Communicability in complex networks. Phys. Rev. E 2008, 77(3):036111.
90. Estrada E, Hatano N. Communicability graph and community structures in complex networks. Appl. Math. Comput. 2009, 214:500-511.
91. M. Saerens, F. Fouss, L. Yen, P. Dupont, The principal component analysis of a graph and its relationships to spectral clustering, in: Proc. Eur. Conf. on Machine Learning, 2004. URL http://citeseer.ist.psu.edu/saerens04principal.html.
92. Fouss F, Renders J-M. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 2007, 19(3):355-369. member-Pirotte, Alain and Member-Saerens, Marco.
93. Yen L, Fouss F, Decaestecker C, Francq P, Saerens M. Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. Data Knowl. Eng. 2009, 68(3):338-361.
94. L. Yen, F. Fouss, C. Decaestecker, P. Francq, M. Saerens, Graph nodes clustering based on the commute-time kernel, in: PAKDD, 2007, pp. 1037-1045.
95. Chandra AK, Raghavan P, Ruzzo WL, Smolensky R. The electrical resistance of a graph captures its commute and cover times. STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing 1989, 574-586. ACM, New York, NY, USA.
96. Klein DJ, Randic M. Resistance distance. J. Math. Chem. 1993, 12:81-95.
97. White S, Smyth P. Algorithms for estimating relative importance in networks. KDD '03: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2003, 266-275. ACM, New York, NY, USA.
98. Zhou H. Distance, dissimilarity index, and network community structure. Phys. Rev. E 2003, 67(6):061901.
99. Harel D, Koren Y. On clustering using random walks. FST TCS '01: Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science 2001, 18-41. Springer-Verlag, London, UK.
100. Latapy M, Pons P. Lect. Notes Comput. Sci. 2005, 3733:284-293.
101. Nadler B, Lafon S, Coifman RR, Kevrekidis IG. Diffusion maps, spectral clustering and reaction coordinates of dynamical systems. Appl. Comput. Harmon. Anal. 2006, 21(1):113-127.
102. C.R. Palmer, C. Faloutsos, Electricity based external similarity of categorical attributes, in: Proceedings of PAKDD 2003, 2003, pp. 486-500.
103. Tong H, Faloutsos C, Pan J-Y. Random walk with restart: Fast solutions and applications. Knowl. Inf. Syst. 2008, 14(3):327-346.
104. Gori M, Pucci A. Itemrank: A random-walk based scoring algorithm for recommender engines. IJCAI'07: Proceedings of the 20th International Joint Conference on Artifical Intelligence 2007, 2766-2771. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
105. Andrews GE. The Theory of Partitions 1976, Addison-Wesley, Boston, USA.
106. Lovász L. Combinatorial Problems and Exercises 1993, North-Holland, Amsterdam, The Netherlands.
107. Pólya G, Szegö G. Problems and Theorems in Analysis I 1998, Springer-Verlag, Berlin, Germany.
108. Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási A-L. Hierarchical organization of modularity in metabolic networks. Science 2002, 297(5586):1551-1555.
109. Ravasz E, Barabási A-L. Hierarchical organization in complex networks. Phys. Rev. E 2003, 67(2):026112.
110. Lancichinetti A, Fortunato S, Kertész J. Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 2009, 11(3):033015.
111. Kleinberg J. An impossibility theorem for clustering. Advances in NIPS 15 2002, 446-453. MIT Press, Boston, USA.
112. M. Tumminello, F. Lillo, R.N. Mantegna, Correlation, hierarchies, and networks in financial markets, eprint arxiv:0809.4615.
113. Dorogovtsev SN, Mendes JFF. Evolution of networks. Adv. Phys. 2002, 51:1079-1187.
114. Łuczak T. Sparse random graphs with a given degree sequence. Proceedings of the Symposium on Random Graphs, Poznań 1989 1992, 165-182. John Wiley & Sons, New York, USA.
115. Molloy M, Reed B. A critical point for random graphs with a given degree sequence. Random Struct. Algor. 1995, 6:161-179.
116. Djidjev H. A scalable multilevel algorithm for graph clustering and community structure detection. WAW 2007, vol. 4936:117-128. Springer-Verlag, Berlin, Germany. W. Aiello, A.Z. Broder, J.C.M. Janssen, E.E. Milios (Eds.).
117. B.H. Good, Y. de Montjoye, A. Clauset, The performance of modularity maximization in practical contexts, eprint arxiv:0910.0165.
118. Newman MEJ. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 2006, 74(3):036104.
119. Holmström E, Bock N, Brännlund J. Modularity density of network community divisions. Physica D 2009, 238:1161-1167.
120. C.P. Massen, J.P.K. Doye, Thermodynamics of Community Structure, eprint arxiv:cond-mat/0610077.
121. Noack A. Modularity clustering is force-directed layout. Phys. Rev. E 2009, 79(2):026102.
122. Arenas A, Duch J, Fernández A, Gómez S. Size reduction of complex networks preserving modularity. New J. Phys. 2007, 9:176.
123. A. Pothen, Graph partitioning algorithms with applications to scientific computing, Tech. rep., Norfolk, VA, USA, 1997.
124. Kernighan BW, Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 1970, 49:291-307.
125. Suaris PR, Kedem G. An algorithm for quadrisection and its application to standard cellplacement. IEEE Trans. Circuits Syst. 1988, 35:294-303.
126. Barnes ER. An algorithm for partitioning the nodes of a graph. SIAM J. Algebr. Discrete Methods 1982, 3:541-550.
127. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J. 1973, 23(98):298-305.
128. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 1950, 45:255-282.
129. Golub GH, Loan CFV. Matrix Computations 1989, John Hopkins University Press, Baltimore, USA.
130. Ford LR, Fulkerson DR. Maximal flow through a network. Canad. J. Math. 1956, 8:399-404.
131. Goldberg AV, Tarjan RE. A new approach to the maximum flow problem. J. ACM 1988, 35:921-940.
132. Flake GW, Lawrence S, Giles CL. Efficient identification of web communities. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2000, 150-160. ACM Press, Boston, USA.
133. Wei Y-C, Cheng C-K. Towards efficient hierarchical designs by ratio cut partitioning. Proceedings of IEEE International Conference on Computer Aided Design 1989, 298-301. Institute of Electrical and Electronics Engineers, New York.
134. Shi J, Malik J. Normalized cuts and image segmentation. CVPR '97: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition 1997, 731. IEEE Computer Society, Washington, DC, USA.
135. Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 2000, 22(8):888-905.
136. Matula DW, Shahrokhi F. Sparsest cuts and bottlenecks in graphs. Discrete Appl. Math. 1990, 27(1-2):113-123.
137. Blake A, Zisserman A. Visual Reconstruction 1987, MIT Press, Cambridge, USA.
138. Hagen L, Kahng AB. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 1992, 11(9):1074-1085.
139. Chan PK, Schlag MDF, Zien JY. Spectral k-way ratio-cut partitioning and clustering. Proceedings of the 30th International Conference on Design Automation 1993, 749-754. ACM Press, New York, USA.
140. Hastie T, Tibshirani R, Friedman JH. The Elements of Statistical Learning 2001, Springer, Berlin, Germany.
141. MacQueen JB. Some methods for classification and analysis of multivariate observations. Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1 1967, 281-297. University of California Press, Berkeley, USA. L.M.L. Cam, J. Neyman (Eds.).
142. Lloyd S. Least squares quantization in PCM. IEEE Trans. Inform. Theory 1982, 28(2):129-137.
143. Schenker A, Last M, Bunke H, Kandel A. Graph representations for web document clustering. IbPRIA'03: Proceedings of the 1st Iberian Conference on Pattern Recognition and Image Analysis 2003, vol. 2652:935-942. Springer. F.J.P. López, A.C. Campilho, N.P. de la Blanca, A. Sanfeliu (Eds.).
144. Hlaoui A, Wang S. A direct approach to graph clustering. Neural Networks Computational Intelligence 2004, 158-163.
145. Rattigan MJ, Maier M, Jensen D. Graph clustering with network structure indices. ICML '07: Proceedings of the 24th International Conference on Machine Learning 2007, 783-790. ACM, New York, NY, USA.
146. Dunn JC. A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. J. Cybernet. 1974, 3:32-57.
147. Bezdek JC. Pattern Recognition with Fuzzy Objective Function Algorithms 1981, Kluwer Academic Publishers, Norwell, USA.
148. Donath W, Hoffman A. Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 1973, 17(5):420-425.
149. D.A. Spielman, S.-H. Teng, Spectral partitioning works: Planar graphs and finite element meshes, in: IEEE Symposium on Foundations of Computer Science, 1996, pp. 96-105.
150. U. von Luxburg, A tutorial on spectral clustering, Tech. Rep. 149, Max Planck Institute for Biological Cybernetics, August 2006.
151. Stewart GW, Sun J-G. Matrix Perturbation Theory 1990, Academic Press, New York, USA.
152. Bhatia R. Matrix Analysis 1997, Springer-Verlag, New York, USA.
153. Ng AY, Jordan MI, Weiss Y. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems, vol. 14 2001, MIT Press, Cambridge, USA. T.G. Dietterich, S. Becker, Z. Ghahramani (Eds.).
154. M. Meilǎ, J. Shi, A random walks view of spectral segmentation, in: AI and STATISTICS (AISTATS) 2001.
155. J.M. Anthonisse, The rush in a directed graph, Tech. rep., Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam, The Netherlands, 1971.
156. Brandes U. A faster algorithm for betweenness centrality. J. Math. Sociol. 2001, 25:163-177.
157. Zhou T, Liu J-G, Wang B-H. Notes on the calculation of node betweenness. Chin. Phys. Lett. 2006, 23:2327-2329.
158. Newman MEJ. A measure of betweenness centrality based on random walks. Soc. Netw. 2005, 27:39-54.
159. Newman MEJ. Analysis of weighted networks. Phys. Rev. E 2004, 70(5):056131.
160. Tyler JR, Wilkinson DM, Huberman BA. Email as spectroscopy: Automated discovery of community structure within organizations. Communities and Technologies 2003, 81-96. Kluwer, B.V., Deventer, The Netherlands.
161. Wilkinson DM, Huberman BA. A method for finding communities of related genes. Proc. Natl. Acad. Sci. U.S.A. 2004, 101:5241-5248.
162. Rattigan MJ, Maier M, Jensen D. Using structure indices for efficient approximation of network properties. SIGKDD'06: Proceedings of the 12th international conference on Knowledge Discovery and Data Mining 2006, 357-366. ACM. T. Eliassi-Rad, L.H. Ungar, M. Craven, D. Gunopulos (Eds.).
163. Brandes U, Gaertler M, Wagner D. Experiments on graph clustering algorithms. Proceedings of ESA 2003, 568-579. Springer-Verlag, Berlin, Germany.
164. Holme P, Huss M, Jeong H. Subnetwork hierarchies of biochemical pathways. Bioinformatics 2003, 19(4):532-538.
165. Pinney JW, Westhead DR. Betweenness-based decomposition methods for social and biological networks. Interdisciplinary Statistics and Bioinformatics 2006, 87-90. Leeds University Press, Leeds, UK.
166. Gregory S. An algorithm to find overlapping community structure in networks. Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases 2007, 91-102. Springer-Verlag, Berlin, Germany.
167. Watts D, Strogatz S. Collective dynamics of 'small-world' networks. Nature 1998, 393:440-442.
168. Castellano C, Cecconi F, Loreto V, Parisi D, Radicchi F. Self-contained algorithms to detect communities in networks. Eur. Phys. J. B 2004, 38(2):311-319.
169. P. Zhang, J. Wang, X. Li, Z. Di, Y. Fan, The clustering coefficient and community structure of bipartite networks, eprint arxiv:0710.0117.
170. Latora V, Marchiori M. Efficient behavior of small-world networks. Phys. Rev. Lett. 2001, 87(19):198701.
171. Fortunato S, Latora V, Marchiori M. Method to find community structures based on information centrality. Phys. Rev. E 2004, 70(5):056104.
172. Vragović I, Louis E. Network community structure and loop coefficient method. Phys. Rev. E 2006, 74(1):016105.
173. Newman MEJ. Fast algorithm for detecting community structure in networks. Phys. Rev. E 2004, 69(6):066133.
174. Clauset A, Newman MEJ, Moore C. Finding community structure in very large networks. Phys. Rev. E 2004, 70(6):066111.
175. Danon L, Díaz-Guilera A, Arenas A. The effect of size heterogeneity on community identification in complex networks. J. Stat. Mech. 2006, 11:10.
176. Pujol JM, Béjar J, Delgado J. Clustering algorithm for determining community structure in large networks. Phys. Rev. E 2006, 74(1):016107.
177. Du H, Feldman MW, Li S, Jin X. An algorithm for detecting community structure of social networks based on prior knowledge and modularity. Complexity 2007, 12(3):53-60.
178. K. Wakita, T. Tsurumi, Finding community structure in mega-scale social networks, eprint arxiv:cs/0702048.
179. Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J. Stat. Mech. 2008, P10008.
180. Schuetz P, Caflisch A. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 2008, 77(4):046112.
181. Schuetz P, Caflisch A. Multistep greedy algorithm identifies community structure in real-world and computer-generated networks. Phys. Rev. E 2008, 78(2):026112.
182. Noack A, Rotta R. Multi-level algorithms for modularity clustering. SEA '09: Proceedings of the 8th International Symposium on Experimental Algorithms 2009, 257-268. Springer-Verlag, Berlin, Heidelberg.
183. Xiang B, Chen E-H, Zhou T. Finding community structure based on subgraph similarity. Complex Networks 2009, vol. 207:73-81. Springer Verlag, Berlin/Heidelberg, Germany. S. Fortunato, R. Menezes, G. Mangioni, V. Nicosia (Eds.).
184. Mei J, He S, Shi G, Wang Z, Li W. Revealing network communities through modularity maximization by a contraction-dilation method. New J. Phys. 2009, 11(4):043025.
185. Guimerà R, Sales-Pardo M, Amaral LAN. Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E 2004, 70(2):025101 (R).
186. Massen CP, Doye JPK. Identifying communities within energy landscapes. Phys. Rev. E 2005, 71(4):046101.
187. Medus A, Acuña G, Dorso CO. Detection of community structures in networks via global optimization. Physica A 2005, 358:593-604.
188. Duch J, Arenas A. Community detection in complex networks using extremal optimization. Phys. Rev. E 2005, 72(2):027104.
189. S. White, P. Smyth, A spectral clustering approach to finding communities in graphs, in: Proceedings of SIAM International Conference on Data Mining, 2005, pp. 76-84.
190. Newman MEJ. From the cover: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 2006, 103:8577-8582.
191. Lehmann S, Hansen LK. Deterministic modularity optimization. Eur. Phys. J. B 2007, 60:83-88.
192. Ruan J, Zhang W. An efficient spectral algorithm for network community discovery and its applications to biological and social networks. ICDM '07: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining 2007, 643-648. IEEE Computer Society, Washington, DC, USA.
193. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikolski, D. Wagner, On modularity - np-completeness and beyond. URL http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3255.
194. Ye Z, Hu S, Yu J. Adaptive clustering algorithm for community detection in complex networks. Phys. Rev. E 2008, 78(4):046115.
195. Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science 1983, 220:671-680.
196. Boettcher S, Percus AG. Optimization with extremal dynamics. Phys. Rev. Lett. 2001, 86:5211-5214.
197. Richardson T, Mucha PJ, Porter MA. Spectral tripartitioning of networks. Phys. Rev. E 2009, 80(3):036111.
198. Sun Y, Danila B, Josic K, Bassler KE. Improved community structure detection using a modified fine-tuning strategy. Europhys. Lett. 2009, 86(2):28004.
199. Wang G, Shen Y, Ouyang M. A vector partitioning approach to detecting community structure in complex networks. Comput. Math. Appl. 2008, 55(12):2746-2752.
200. Demmel J, Dongarra J, Ruhe A, van der Vorst H. Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide 2000, Society for Industrial and Applied Mathematics, Philadelphia, USA.
201. Gleiser P, Danon L. Community structure in jazz. Adv. Complex Syst. 2003, 6:565.
202. Newman MEJ. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 2001, 98(2):404-409.
203. Agarwal G, Kempe D. Modularity-maximizing network communities via mathematical programming. Eur. Phys. J. B 2008, 66:409-418.
204. Karloff H. Linear Programming 1991, Birkhäuser Verlag, Basel, Switzerland.
205. Xu G, Tsoka S, Papageorgiou LG. Finding community structures in complex networks using mixed integer optimisation. Eur. Phys. J. B 2007, 60(2):231-239.
206. Chen WYC, Dress AWM, Yu WQ. Community structures of networks. Math. Comput. Sci. 2008, 1(3):441-457.
207. Hillier FS, Lieberman GJ. Introduction to Operations Research 2004, McGraw-Hill, New York, USA.
208. J.W. Berry, B. Hendrickson, R.A. LaViolette, V.J. Leung, C.A. Phillips, Community detection via facility location, eprint arxiv:0710.3800.
209. Peterson C, Anderson JR. A mean field theory learning algorithm for neural networks. Complex Systems 1987, 1:995-1019.
210. Holland JH. Adaptation in Natural and Artificial Systems 1992, MIT Press, Cambridge, USA.
211. M. Tasgin, A. Herdagdelen, H. Bingol, Community detection in complex networks using genetic algorithms, eprint arxiv:0711.0491.
212. Liu X, Li D, Wang S, Tao Z. Effective algorithm for detecting community structure in complex networks based on GA and clustering. ICCS '07: Proceedings of the 7th International Conference on Computational Science, Part II 2007, 657-664. Springer-Verlag, Berlin, Heidelberg.
213. Feng Z, Xu X, Yuruk N, Schweiger T. A novel similarity-based modularity function for graph partitioning. Lect. Notes Comp. Sci. 2007, 4654:385-396.
214. R. Ghosh, K. Lerman, Community detection using a measure of global influence, eprint arxiv:0805.4606.
215. Y. Kim, S.-W. Son, H. Jeong, Link rank: Finding communities in directed networks, eprint arxiv:0902.3728.
216. Shen H, Cheng X, Cai K, Hu M-B. Detect overlapping and hierarchical community structure in networks. Physica A 2009, 388:1706-1712.
217. Nicosia V, Mangioni G, Carchiolo V, Malgeri M. Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech. 2009, P03024.
218. Shen H-W, Cheng X-Q, Guo J-F. Quantifying and identifying the overlapping community structure in networks. J. Stat. Mech. 2009, P07042.
219. Gaertler M, Görke R, Wagner D. Significance-driven graph clustering. AAIM 2007, vol. 4508:11-26. Springer, Berlin, Germany. M.-Y. Kao, X.-Y. Li (Eds.).
220. Muff S, Rao F, Caflisch A. Local modularity measure for network clusterizations. Phys. Rev. E 2005, 72(5):056107.
221. Mezard M, Parisi G, Virasoro M. Spin Glass Theory and Beyond 1987, World Scientific Publishing Company, Singapore.
222. Arenas A, Fernández A, Fortunato S, Gómez S. Motif-based communities in complex networks. J. Phys. A 2008, 41(22):224001.
223. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U. Network motifs: Simple building blocks of complex networks. Science 2002, 298(5594):824-827.
224. Mantegna RN, Stanley HE. An Introduction to Econophysics: Correlations and Complexity in Finance 2000, Cambridge University Press, New York, USA.
225. Bansal N, Blum A, Chawla S. Correlation clustering. Mach. Learn. 2004, 56(1-3):89-113.
226. Gómez S, Jensen P, Arenas A. Analysis of community structure in networks of correlated data. Phys. Rev. E 2009, 80(1):016114.
227. T.D. Kaplan, S. Forrest, A dual assortative measure of community structure, eprint arxiv:0801.3290.
228. Traag VA, Bruggeman J. Community detection in networks with positive and negative links. Phys. Rev. E 2009, 80(3):036115.
229. Williams RJ, Martinez ND. Simple rules yield complex food webs. Nature 2000, 404:180-183.
230. Guimerà R, Sales-Pardo M, Amaral LAN. Module identification in bipartite and directed networks. Phys. Rev. E 2007, 76(3):036102.
231. Barber MJ, Faria M, Streit L, Strogan O. Searching for communities in bipartite networks. Stochastic and Quantum Dynamics of Biomolecular Systems 2008, vol. 1021:171-182. American Institute of Physics, Melville, USA. C.C. Bernido, M.V. Carpio-Bernido (Eds.).
232. Reichardt J, Bornholdt S. When are networks truly modular?. Physica D 2006, 224:20-26.
233. Reichardt J, Bornholdt S. Partitioning and modularity of graphs with arbitrary degree distribution. Phys. Rev. E 2007, 76(1):015102 (R).
234. Fu Y, Anderson P. Application of statistical mechanics to NP-complete problems in combinatorial optimisation. J. Phys. A 1986, 19:1605-1620.
235. Sherrington D, Kirkpatrick S. Solvable model of a spin-glass. Phys. Rev. Lett. 1975, 35:1792-1796.
236. Fortunato S, Barthélemy M. Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 2007, 104:36-41.
237. Guimerà R, Danon L, Díaz-Guilera A, Giralt F, Arenas A. Self-similar community structure in a network of human interactions. Phys. Rev. E 2003, 68(6):065103 (R).
238. Danon L, Díaz-Guilera A, Duch J, Arenas A. Comparing community structure identification. J. Stat. Mech. 2005, P09008.
239. Fortunato S. Quality functions in community detection. Noise and Stochastics in Complex Systems and Finance 2007, vol. 6601:660108.
240. Li Z, Zhang S, Wang R-S, Zhang X-S, Chen L. Quantitative function for community detection. Phys. Rev. E 2008, 77(3):036109.
241. Ruan J, Zhang W. Identifying network communities with a high resolution. Phys. Rev. E 2008, 77(1):016104.
242. Kumpula JM, Saramäki J, Kaski K, Kertész J. Limited resolution in complex network community detection with Potts model approach. Eur. Phys. J. B 2007, 56:41-45.
243. J.W. Berry, B. Hendrickson, R.A. LaViolette, C.A. Phillips, Tolerating the community detection resolution limit with edge weighting, eprint arxiv:0903.1072.
244. Eriksen KA, Simonsen I, Maslov S, Sneppen K. Modularity and extreme edges of the internet. Phys. Rev. Lett. 2003, 90(14):148701.
245. Simonsen I, Eriksen KA, Maslov S, Sneppen K. Diffusion on complex networks: A way to probe their large-scale topological structures. Physica A 2004, 336:163-173.
246. Slanina F, Zhang Y-C. Referee networks and their spectral properties. Acta Phys. Polon. B 2005, 36:2797-2804.
247. Mitrović M, Tadić B. Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities. Phys. Rev. E 2009, 80(2):026123.
248. Simonsen I. Diffusion and networks: A powerful combination!. Physica A 2005, 357(2):317-330.
249. Alves NA. Unveiling community structures in weighted networks. Phys. Rev. E 2007, 76(3):036101.
250. Capocci A, Servedio VDP, Caldarelli G, Colaiori F. Detecting communities in large networks. Physica A 2005, 352:669-676.
251. Yang B, Liu J. Discovering global network communities based on local centralities. ACM Trans. Web 2008, 2(1):1-32.
252. Bonacich P. Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 1972, 2(1):113-120.
253. Bonacich P. Power and centrality: A family of measures. Amer. J. Sociol. 1987, 92(5):1170-1182.
254. Wu FY. The Potts model. Rev. Mod. Phys. 1982, 54(1):235-268.
255. Blatt M, Wiseman S, Domany E. Superparamagnetic clustering of data. Phys. Rev. Lett. 1996, 76:3251-3254.
256. Reichardt J, Bornholdt S. Detecting Fuzzy community structures in complex networks with a Potts model. Phys. Rev. Lett. 2004, 93(21):218701.
257. Ispolatov I, Mazo I, Yuryev A. Finding mesoscopic communities in sparse networks. J. Stat. Mech. 2006, P09014.
258. Son S-W, Jeong H, Noh JD. Random field Ising model and community structure in complex networks. Eur. Phys. J. B 2006, 50(3):431-437.
259. Middleton AA, Fisher DS. Three-dimensional random-field Ising magnet: Interfaces, scaling, and the nature of states. Phys. Rev. B 2002, 65(13):134411.
260. Noh JD, Rieger H. Disorder-driven critical behavior of periodic elastic media in a crystal potential. Phys. Rev. Lett. 2001, 87(17):176102.
261. Noh JD, Rieger H. Numerical study of the disorder-driven roughening transition in an elastic manifold in a periodic potential. Phys. Rev. E 2002, 66(3):036117.
262. Hughes BD. Random Walks and Random Environments: Random Walks, vol. 1 1995, Clarendon Press, Oxford, UK.
263. Zhou H. Network landscape from a brownian particle's perspective. Phys. Rev. E 2003, 67(4):041908.
264. Zhou H, Lipowsky R. Network brownian motion: A new method to measure vertex-vertex proximity and to identify communities and subcommunities. Lect. Notes Comput. Sci. 2004, 3038:1062-1069.
265. Ward JH. Hierarchical grouping to optimize an objective function. J. Am. Assoc. 1963, 58(301):236-244.
266. Hu Y, Li M, Zhang P, Fan Y, Di Z. Community detection by signaling on complex networks. Phys. Rev. E 2008, 78(1):016115.
267. J.C. Delvenne, S.N. Yaliraki, M. Barahona, Stability of graph communities across time scales, eprint arxiv:0812.1811.
268. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 1975, 25:619-633.
269. R. Lambiotte, J. Delvenne, M. Barahona, Laplacian dynamics and multiscale modular structure in networks, eprint arxiv:0812.1770.
270. Weinan E, Li T, Vanden-Eijnden E. Optimal partition and effective dynamics of complex networks. Proc. Natl. Acad. Sci. USA 2008, 105:7907-7912.
271. S. van Dongen, Graph clustering by flow simulation, Ph.D. Thesis, Dutch National Research Institute for Mathematics and Computer Science, University of Utrecht, Netherlands, 2000.
272. Pikovsky A, Rosenblum MG, Kurths J. Synchronization : A Universal Concept in Nonlinear Sciences 2001, Cambridge University Press, Cambridge, UK.
273. Arenas A, Díaz-Guilera A, Pérez-Vicente CJ. Synchronization reveals topological scales in complex networks. Phys. Rev. Lett. 2006, 96(11):114102.
274. Kuramoto Y. Chemical Oscillations, Waves and Turbulence 1984, Springer-Verlag, Berlin, Germany.
275. Arenas A, Díaz-Guilera A. Synchronization and modularity in complex networks. Eur. Phys. J. Special Topics 2007, 143:19-25.
276. Boccaletti S, Ivanchenko M, Latora V, Pluchino A, Rapisarda A. Detecting complex network modularity by dynamical clustering. Phys. Rev. E 2007, 75(4):045102.
277. Pluchino A, Latora V, Rapisarda A. Changing opinions in a changing world. Int. J. Mod. Phys. C 2005, 16:515-531.
278. Li D, Leyva I, Almendral JA, Sendiña-Nadal I, Buldú JM, Havlin S, Boccaletti S. Synchronization interfaces and overlapping communities in complex networks. Phys. Rev. Lett. 2008, 101(16):168701.
279. Mackay DJC. Information Theory, Inference, and Learning Algorithms 2003, Cambridge University Press, Cambridge, UK.
280. Winkler RL. Introduction to Bayesian Inference and Decision 2003, Probabilistic Publishing, Gainesville, USA.
281. Doreian P, Batagelj V, Ferligoj A. Generalized Blockmodeling 2005, Cambridge University Press, New York, USA.
282. Burnham KP, Anderson DR. Model Selection and Multimodel Inference: A Practical Information-Theoretic Approach 2002, Springer, New York, USA.
283. Handcock MS, Raftery AE, Tantrum JM. Model based clustering for social networks. J. Roy. Statist. Soc. A 2007, 170:1-22. Working Paper no. 46.
284. Koskinen JH, Snijders TAB. Bayesian inference for dynamic social network data. J. Stat. Plan. Infer. 2007, 137(12):3930-3938.
285. Rhodes CJ, Keefe EMJ. Social network topology: A bayesian approach. J. Oper. Res. Soc. 2007, 58(12):1605-1611.
286. Rowicka M, Kudlicki A. Bayesian modeling of protein interaction networks. Bayesian Inference and Maximum Entropy Methods in Science and Engineering: 24th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, vol. 735 2004, 283-288. American Institute of Physics, Melville, USA. R. Fischer, R. Preuss, U. von Toussaint (Eds.).
287. Berg J, Lässig M. Cross-species analysis of biological networks by bayesian alignment. Proc. Natl. Acad. Sci. USA 2006, 103(29):10967-10972.
288. Hastings MB. Community detection as an inference problem. Phys. Rev. E 2006, 74(3):035102.
289. Gallager RG. Low Density Parity Check Codes 1963, MIT Press, Cambridge, USA.
290. Newman MEJ, Leicht EA. Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. USA 2007, 104:9564-9569.
291. Dempster AP, Laird NM, Rubin DB. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B 1977, 39:1-38.
292. Snijders TAB, Nowicki K. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 1997, 14:75-100.
293. K. Nowicki, T.A.B. Snijders, Estimation and prediction for stochastic blockstructures, J. Am. Assoc. 96 (455).
294. M. Mungan, J.J. Ramasco, Who is keeping you in that community? eprint arxiv:0809.1398.
295. Vazquez A. Population stratification using a statistical model on hypergraphs. Phys. Rev. E 2008, 77(6):066106.
296. A. Vazquez, Bayesian approach to clustering real value, categorical and network data: Solution via variational methods, eprint arxiv:0805.2689.
297. Jordan MI, Ghahramani Z, Jaakkola TS, Saul LK. An introduction to variational methods for graphical models. Mach. Learn. 1999, 37(2):183-233.
298. M.J. Beal, Variational algorithms for approximate bayesian inference, Ph.D. Thesis, Gatsby Computational Neuroscience Unit, University College London, 2003.
299. Ramasco JJ, Mungan M. Inversion method for content-based networks. Phys. Rev. E 2008, 77(3):036122.
300. Ren W, Yan G, Liao X, Xiao L. Simple probabilistic algorithm for detecting community structure. Phys. Rev. E 2009, 79(3):036111.
301. J. Čopič, M.O. Jackson, A. Kirman, Identifying community structures from network data. URL http://www.hss.caltech.edu/~jernej/netcommunity.pdf.
302. Zanghi H, Ambroise C, Miele V. Fast online graph clustering via Erdös-Rényi mixture. Pattern Recognit. 2008, 41(12):3592-3599.
303. Biernacki C, Celeux G, Govaert G. Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans. Pattern Anal. Mach. Intell. 2000, 22(7):719-725.
304. Hofman JM, Wiggins CH. Bayesian Approach to Network Modularity. Phys. Rev. Lett. 2008, 100(25):258701.
305. White DR, Reitz KP. Graph and semigroup homomorphisms on networks and relations. Soc. Netw. 1983, 5:193-234.
306. Everett MG, Borgatti SP. Regular equivalence: General theory. J. Math. Soc. 1994, 19(1):29-52.
307. Fienberg SE, Wasserman S. Categorical data analysis of single sociometric relations. Sociol. Methodol. 1981, 12:156-192.
308. Holland P, Laskey KB, Leinhardt S. Stochastic blockmodels: Some first steps. Soc. Netw. 1983, 5:109-137.
309. Reichardt J, White DR. Role models for complex networks. Eur. Phys. J. B 2007, 60:217-224.
310. Akaike H. A new look at the statistical model identification. IEEE Trans. Automat. Control 1974, 19(6):716-723.
311. Schwarz G. Estimating the dimension of a model. Ann. Stat. 1978, 6(2):461-464.
312. Rissanen J. Modelling by shortest data descriptions. Automatica 1978, 14:465-471.
313. Grünwald PD, Myung IJ, Pitt MA. Advances in Minimum Description Length: Theory and Applications 2005, MIT Press, Cambridge, USA.
314. Wallace CS, Boulton DM. An information measure for classification. Comput. J. 1968, 11(2):185-194.
315. Rosvall M, Bergstrom CT. An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. USA 2007, 104:7327-7331.
316. Sun J, Faloutsos C, Papadimitriou S, Yu PS. Graphscope: Parameter-free mining of large time-evolving graphs. KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007, 687-696. ACM, New York, USA.
317. Huffman DA. A method for the construction of minimum-redundancy codes. Proc. IRE 1952, 40(9):1098-1101.
318. M. Rosvall, D. Axelsson, C.T. Bergstrom, The map equation, eprint arxiv:0906.1405.
319. Chakrabarti D. Autopart: Parameter-free graph partitioning and outlier detection. PKDD 2004, vol. 3202:112-124. Springer. J.-F. Boulicaut, F. Esposito, F. Giannotti, D. Pedreschi (Eds.).
320. Ziv E, Middendorf M, Wiggins CH. Information-theoretic approach to network modularity. Phys. Rev. E 2005, 71(4):046117.
321. N. Tishby, F. Pereira, W. Bialek, The information bottleneck method, in: Proceedings of the 37-th Annual Allerton Conference on Communication, Control and Computing, 1999, pp. 368-377.
322. Raghavan UN, Albert R, Kumara S. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 2007, 76(3):036106.
323. Tibély G, Kertész J. On the equivalence of the label propagation method of community detection and a Potts model approach. Physica A 2008, 387:4982-4984.
324. Barber MJ, Clark JW. Detecting network communities by propagating labels under constraints. Phys. Rev. E 2009, 80(2):026129.
325. Leung IXY, Hui P, Liò P, Crowcroft J. Towards real-time community detection in large networks. Phys. Rev. E 2009, 79(6):066107.
326. Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Phys. Rev. E 2008, 78(4):046110.
327. Bagrow JP, Bollt EM. Local method for detecting communities. Phys. Rev. E 2005, 72(4):046108.
328. L. da Fontoura Costa, Hub-based community finding, eprint arxiv:cond-mat/0405022.
329. Porter MA, Mucha PJ, Newman MEJ, Friend AJ. Community structure in the United States House of Representatives. Physica A 2007, 386:414-438.
330. Rodrigues FA, Travieso G, da FCosta L. Fast community identification by hierarchical growth. Int. J. Mod. Phys. C 2007, 18:937-947.
331. S. Papadopoulos, A. Skusa, A. Vakali, Y. Kompatsiaris, N. Wagner, Bridge bounding: A local approach for efficient community discovery in complex networks, eprint arxiv:0902.0871.
332. Clauset A. Finding local community structure in networks. Phys. Rev. E 2005, 72(2):026132.
333. P. Hui, E. Yoneki, S.-Y. Chan, J. Crowcroft, Distributed community detection in delay tolerant networks, in: Proc. MobiArch, 2007.
334. Eckmann J-P, Moses E. Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Proc. Natl. Acad. Sci. USA 2002, 99:5825-5829.
335. Long B, Xu X, Zhang Z, Yu PS. Community learning by graph approximation. ICDM '07: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining 2007, 232-241. IEEE Computer Society, Washington, DC, USA.
336. Wu F, Huberman BA. Finding communities in linear time: A physics approach. Eur. Phys. J. B 2004, 38:331-338.
337. Orponen P, Schaeffer SE. Local clustering of large graphs by approximate Fiedler vectors. Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms 2005, vol. 3503:524-533. Springer-Verlag, Berlin-Heidelberg. S. Nikoletseas (Ed.).
338. Ohkubo J, Tanaka K. Nonadditive volume and community detection problem in complex networks. J. Phys. Soc. Japan 2006, 75(11):115001-1-115001-2.
339. Zarei M, Samani KA. Eigenvectors of network complement reveal community structure more accurately. Physica A 2009, 388:1721-1730.
340. Condon A, Karp RM. Algorithms for graph partitioning on the planted partition model. Random Struct. Algor. 2001, 18:116-140.
341. Gudkov V, Montealegre V, Nussinov S, Nussinov Z. Community detection in complex networks by dynamical simplex evolution. Phys. Rev. E 2008, 78(1):016113.
342. M.J. Krawczyk, K. Kulakowski, Communities in networks - A continuous approach, eprint arxiv:0709.0923.
343. Krawczyk MJ. Differential equations as a tool for community identification. Phys. Rev. E 2008, 77(6):065701.
344. A. Narasimhamurthy, D. Greene, N. Hurley, P. Cunningham, Community finding in large social networks through problem decomposition, in: Proc. 19th Irish Conference on Artificial Intelligence and Cognitive Science, AICS'08, 2008.
345. Dhillon IS, Guan Y, Kulis B. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell. 2007, 29(11):1944-1957.
346. Everett MG, Borgatti SP. Analyzing clique overlap. Connections 1998, 21(1):49-61.
347. Derényi I, Palla G, Vicsek T. Clique percolation in random networks. Phys. Rev. Lett. 2005, 94(16):160202.
348. Adamcsek B, Palla G, Farkas IJ, Derényi I, Vicsek T. Cfinder: Locating cliques and overlapping modules in biological networks. Bioinformatics 2006, 22(8):1021-1023.
349. Farkas I, Ábel D, Palla G, Vicsek T. Weighted network modules. New J. Phys. 2007, 9:180.
350. Lehmann S, Schwartz M, Hansen LK. Biclique communities. Phys. Rev. E 2008, 78(1):016108.
351. Peeters R. The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 2003, 131:651-654.
352. Du N, Wang B, Wu B, Wang Y. Overlapping community detection in bipartite networks. IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology 2008, 176-179. IEEE Computer Society, Los Alamitos, CA, USA.
353. Kumpula JM, Kivelä M, Kaski K, Saramäki J. Sequential algorithm for fast clique percolation. Phys. Rev. E 2008, 78(2):026109.
354. Baumes J, Goldberg MK, Krishnamoorthy MS, Ismail MM, Preston N. Finding communities by clustering a graph into overlapping subgraphs. IADIS AC, IADIS 2005, 97-104. N. Guimaraes, P.T. Isaias (Eds.).
355. J. Baumes, M. Goldberg, M. Magdon-Ismail, Efficient identification of overlapping communities, in: IEEE International Conference on Intelligence and Security Informatics, ISI, 2005, pp. 27-36.
356. Zhang S, Wang R-S, Zhang X-S. Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A 2007, 374:483-490.
357. Nepusz T, Petróczi A, Négyessy L, Bazsó F. Fuzzy communities and the concept of bridgeness in complex networks. Phys. Rev. E 2008, 77(1):016107.
358. Evans TS, Lambiotte R. Line graphs, link partitions, and overlapping communities. Phys. Rev. E 2009, 80(1):016105.
359. Y.-Y. Ahn, J.P. Bagrow, S. Lehmann, Communities and hierarchical organization of links in complex networks, eprint arxiv:0903.3178.
360. Balakrishnan VK. Schaum's Outline of Graph Theory 1997, McGraw-Hill, New York, USA.
361. Gregory S. Finding overlapping communities using disjoint community detection algorithms. Complex Networks 2009, vol. 207:47-62. Springer, Berlin, Germany. S. Fortunato, R. Menezes, G. Mangioni, V. Nicosia (Eds.).
362. Heimo T, Kumpula JM, Kaski K, Saramäki J. Detecting modules in dense weighted networks with the Potts method. J. Stat. Mech. 2008, P08007.
363. P. Pons, Post-processing hierarchical community structures: Quality improvements and multi-scale view, eprint arxiv:cs/0608050.
364. Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 1986, 13(5):533-549.
365. Kumpula JM, Saramäki J, Kaski K, Kertész J. Limited resolution and multiresolution methods in complex network community detection. Noise and Stochastics in Complex Systems and Finance 2007, vol. 6601:660116.
366. P. Ronhovde, Z. Nussinov, A highly accurate and resolution-limit-free Potts model for community detection, eprint arxiv:0803.2548.
367. Ronhovde P, Nussinov Z. Multiresolution community detection for megascale networks by information-based replica correlations. Phys. Rev. E 2009, 80(1):016109.
368. Sales-Pardo M, Guimerà R, Moreira AA, Amaral LAN. Extracting the hierarchical organization of complex systems. Proc. Natl. Acad. Sci. USA 2007, 104:15224-15229.
369. Barrat A, Barthélemy M, Pastor-Satorras R, Vespignani A. The architecture of complex weighted networks. Proc. Natl. Acad. Sci. USA 2004, 101(11):3747-3752.
370. Itzkovitz S, Levitt R, Kashtan N, Milo R, Itzkovitz M, Alon U. Coarse-graining and self-dissimilarity of complex networks. Phys. Rev. E 2005, 71(1):016127.
371. Guimerà R, Sales-Pardo M, Amaral LAN. A network-based method for target selection in metabolic networks. Bioinformatics 2007, 23(13):1616-1622.
372. Clauset A, Moore C, Newman MEJ. Structural inference of hierarchies in networks. Statistical Network Analysis: Models, Issues, and New Directions 2007, vol. 4503:1-13. Springer, Berlin, Germany. E.M. Airoldi, D.M. Blei, S.E. Fienberg, A. Goldenberg, E.P. Xing, A.X. Zheng (Eds.).
373. Clauset A, Moore C, Newman MEJ. Hierarchical structure and the prediction of missing links in networks. Nature 2008, 453(7191):98-101.
374. Newman MEJ, Barkema T. Monte Carlo Methods in Statistical Physics 1999, Oxford University Press, Oxford, UK.
375. Liben-Nowell D, Kleinberg J. The link prediction problem for social networks. CIKM '03: Proceedings of the Twelfth International Conference on Information and Knowledge Management 2003, 556-559. ACM, New York, NY, USA.
376. Kumar R, Novak J, Raghavan P, Tomkins A. On the bursty evolution of blogspace. WWW '03: Proceedings of the Twelfth International Conference on the World Wide Web 2003, 568-576. ACM Press.
377. Kumar R, Novak J, Tomkins A. Structure and evolution of online social networks. KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2006, 611-617. ACM, New York, NY, USA.
378. Leskovec J, Kleinberg J, Faloutsos C. Graphs over time: Densification laws, shrinking diameters and possible explanations. KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining 2005, 177-187. ACM, New York, NY, USA.
379. Leskovec J, Backstrom L, Kumar R, Tomkins A. Microscopic evolution of social networks. KDD '08: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2008, 462-470. ACM, New York, NY, USA.
380. Palla G, Barabási A-L, Vicsek T. Quantifying social group evolution. Nature 2007, 446:664-667.
381. Hopcroft J, Khan O, Kulis B, Selman B. Tracking evolving communities in large linked networks. Proc. Natl. Acad. Sci. USA 2004, 101:5249-5253.
382. Giles CL, Bollacker K, Lawrence S. CiteSeer: An automatic citation indexing system. Digital Libraries 98 - The Third ACM Conference on Digital Libraries 1998, 89-98. ACM Press, Pittsburgh, PA. I. Witten, R. Akscyn, F.M. Shipman III (Eds.).
383. Baeza-Yates R, Ribeiro-Neto B. Modern Information Retrieval 1999, Addison-Wesley, Boston, USA.
384. Asur S, Parthasarathy S, Ucar D. An event-based framework for characterizing the evolutionary behavior of interaction graphs. KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007, 913-921. ACM, New York, NY, USA.
385. Fenn DJ, Porter MA, McDonald M, Williams S, Johnson NF, Jones NS. Dynamic communities in multichannel data: An application to the foreign exchange market during the 2007-2008 credit crisis. Chaos 2009, 19(3):033119.
386. Chakrabarti D, Kumar R, Tomkins A. Evolutionary clustering. KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2006, 554-560. ACM, New York, NY, USA.
387. Chi Y, Song X, Zhou D, Hino K, Tseng BL. Evolutionary spectral clustering by incorporating temporal smoothness. KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007, 153-162. ACM, New York, NY, USA.
388. Lin Y-R, Chi Y, Zhu S, Sundaram H, Tseng BL. Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. WWW '08: Proceedings of the 17th International Conference on the World Wide Web 2008, 685-694. ACM, New York, NY, USA.
389. Kullback S, Leibler RA. On information and sufficiency. Ann. Math. Statist. 1951, 22:49-86.
390. M.-S. Kim, J. Han, A particle-and-density based evolutionary clustering method for dynamic networks, in: Proceedings of 2009 Int. Conf. on Very Large Data Bases, Lyon, France, 2009.
391. Backstrom L, Huttenlocher D, Kleinberg J, Lan X. Group formation in large social networks: membership, growth, and evolution. KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2006, 44-54. ACM, New York, NY, USA.
392. Gfeller D, Chappelier J-C, De Los Rios P. Finding instabilities in the community structure of complex networks. Phys. Rev. E 2005, 72(5):056135.
393. Karrer B, Levina E, Newman MEJ. Robustness of community structure in networks. Phys. Rev. E 2008, 77(4):046119.
394. M. Rosvall, C.T. Bergstrom, Mapping change in large networks, eprint arxiv:0812.1242.
395. Efron B, Tibshirani RJ. An Introduction to the Bootstrap 1993, Chapman & Hall, New York, USA.
396. Earl DJ, Deem MW. Parallel tempering: Theory, applications, and new perspectives. Phys. Chem. Chem. Phys. 2005, 7:3910-3916.
397. Bianconi G, Pin P, Marsili M. Assessing the relevance of node features for network structure. Proc. Natl. Acad. Sci. USA 2009, 106(28):11433-11438.
398. Bianconi G. The entropy of randomized network ensembles. Europhys. Lett. 2008, 81:28005.
399. Bianconi G, Coolen ACC, Perez Vicente CJ. Entropies of complex networks with hierarchically constrained topologies. Phys. Rev. E 2008, 78(1):016114.
400. A. Lancichinetti, F. Radicchi, J.J. Ramasco, Statistical significance of communities in networks, eprint arxiv:0907.3708.
401. David HA, Nagaraja HN. Order Statistics 2003, Wiley-Interscience, Hoboken, USA.
402. Beirlant J, Goegebeur Y, Segers J, Teugels J. Statistics of Extremes: Theory and Applications 2004, Wiley & Sons, Chichester, UK. 1st edition.
403. Lancichinetti A, Fortunato S. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 2009, 80(1):016118.
404. Reichardt J, Leone M. (Un)detectable cluster structure in sparse networks. Phys. Rev. Lett. 2008, 101(7):078701.
405. Mézard M, Parisi G. The cavity method at zero temperature. J. Stat. Phys. 2003, 111:1-34.
406. Fan Y, Li M, Zhang P, Wu J, Di Z. Accuracy and precision of methods for community identification in weighted networks. Physica A 2007, 377:363-372.
407. J.P. Bagrow, Evaluating local community methods in networks, J. Stat. Mech. P05001.
408. Barabási A-L, Albert R. Emergence of scaling in random networks. Science 1999, 286:509-512.
409. Watts DJ. Small Worlds : The Dynamics of Networks between Order and Randomness 2003, Princeton University Press, Princeton, USA.
410. Sawardecker EN, Sales-Pardo M, Amaral LAN. Detection of node group membership in networks with group overlap. Eur. Phys. J. B 2009, 67:277-284.
411. Meilǎ M. Comparing clusterings - An information based distance. J. Multivariate Anal. 2007, 98(5):873-895.
412. Wallace DL. A method for comparing two hierarchical clusterings: Comment. J. Am. Assoc. 1983, 78:569-576.
413. Fowlkes EB, Mallows CL. A method for comparing two hierarchical clusterings. J. Am. Assoc. 1983, 78:553-569.
414. Rand WM. Objective criteria for the evaluation of clustering methods. J. Am. Assoc. 1971, 66(336):846-850.
415. Mirkin B. Mathematical Classification and Clustering 1996, Kluwer Academic Press, Norwell, USA.
416. Meilǎ M, Heckerman D. An experimental comparison of model-based clustering methods. Mach. Learn. 2001, 42(1):9-29.
417. S. van Dongen, Performance criteria for graph clustering and Markov cluster experiments, Tech. rep., National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, The Netherlands, 2000.
418. Gustafsson M, Hörnquist M, Lombardi A. Comparison and validation of community structures in complex networks. Physica A 2006, 367:559-576.
419. Gusfield D. Partition-distance: A problem and class of perfect graphs arising in clustering. Inform. Process. Lett. 2002, 82(3):159-164.
420. Stanley RP. Enumerative Combinatorics, vol. I 1997, Cambridge University Press, Cambridge, UK.
421. Zhang P, Li M, Wu J, Di Z, Fan Y. The analysis and dissimilarity comparison of community structure. Physica A 2006, 367:577-585.
422. A.L. Traud, E.D. Kelsic, P.J. Mucha, M.A. Porter, Community structure in online collegiate social networks, eprint arxiv:0809.0690.
423. Donetti L, Muñoz MA. Improved spectral algorithm for the detection of network communities. Modeling Cooperative Behavior in the Social Sciences 2005, vol. 779:104-107. P. Garrido, J. Maroo, M.A. Muñoz (Eds.).
424. A. Lancichinetti, S. Fortunato, Community detection algorithms: A comparative analysis, eprint arxiv:0908.1062.
425. D. Delling, M. Gaertler, R. Görke, Z. Nikoloski, D. Wagner, How to evaluate clustering techniques., Tech. rep., Universität Karlsruhe, Germany, 2007.
426. J. Leskovec, K.J. Lang, A. Dasgupta, M.W. Mahoney, Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters, eprint arxiv:0810.1355.
427. Dunbar R. Grooming, Gossip, and the Evolution of Language 1998, Harvard Univ Press, Cambridge, USA.
428. Guimerà R, Amaral LAN. Cartography of complex networks: Modules and universal roles. J. Stat. Mech. 2005, P02001.
429. Junker BH, Schreiber F. Analysis of Biological Networks 2008, Wiley-Interscience, New York, USA.
430. Dunn R, Dudbridge F, Sanderson CM. The use of edge-betweenness clustering to investigate biological function in protein interaction networks. BMC Bioinf. 2005, 6:39.
431. Farutin V, Robison K, Lightcap E, Dancik V, Ruttenberg A, Letovsky S, Pradines J. Edge-count probabilities for the identification of local protein communities and their organization. Proteins 2006, 62(3):800-818.
432. Sen TZ, Kloczkowski A, Jernigan RL. Functional clustering of yeast proteins from the protein-protein interaction network. BMC Bioinf. 2006, 7(1):355.
433. A.C.F. Lewis, N.S. Jones, M.A. Porter, C.M. Deane, The function of communities in protein interaction networks, eprint arxiv:0904.0989.
434. Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, Davis AP, Dolinski K, Dwight SS, Eppig JT, Harris MA, Hill DP, Issel-Tarver L, Kasarskis A, Lewis S, Matese JC, Richardson JE, Ringwald M, Rubin GM, Sherlock G. Gene ontology: Tool for the unification of biology. Nature Genetics 2000, 25(1):25-29.
435. K. Yuta, N. Ono, Y. Fujiwara, A gap in the community-size distribution of a large-scale social networking site, eprint arxiv:physics/0701168.
436. de Solla Price DJ. Networks of scientific papers. Science 1965, 169:510-515.
437. Reichardt J, Bornholdt S. Clustering of sparse data via network communities-a prototype study of a large online market. J. Stat. Mech. 2007, 2007(06):P06016.
438. R.K.-X. Jin, D.C. Parkes, P.J. Wolfe, Analysis of bidding networks in ebay: Aggregate preference identification through community detection, in: Proc. AAAI Workshop on Plan, Activity and Intent Recognition, PAIR, 2007, pp. 66-73.
439. Porter MA, Mucha PJ, Newman MEJ, Warmbrand CM. A network analysis of committees in the US House of Representatives. Proc. Natl. Acad. Sci. USA 2005, 102:7057-7062.
440. Zhang Y, Friend AJ, Traud AL, Porter MA, Fowler JH, Mucha PJ. Community structure in congressional cosponsorship networks. Physica A 2008, 387(7):1705-1712.
441. Mantegna RN. Hierarchical structure in financial markets. Eur. Phys. J. B 1999, 11:193-197.
442. Bonanno G, Vandewalle N, Mantegna RN. Taxonomy of stock market indices. Phys. Rev. E 2000, 62(6):R7615-R7618.
443. Bonanno G, Caldarelli G, Lillo F, Mantegna RN. Topology of correlation-based minimal spanning trees in real and model markets. Phys. Rev. E 2003, 68(4):046130.
444. Onnela J-P, Chakraborti A, Kaski K, Kertész J. Dynamic asset trees and portfolio analysis. Eur. Phys. J. B 2002, 30(3):285-288.
445. Onnela J-P, Chakraborti A, Kaski K, Kertész J, Kanto A. Dynamics of market correlations: Taxonomy and portfolio analysis. Phys. Rev. E 2003, 68(5):056110.
446. A.E. Allahverdyan, A. Galstyan, Community detection with and without prior information, eprint arxiv:0907.4803.
447. Chung F. Spectral Graph Theory, Number 92 in CBMS Regional Conference Series in Mathematics 1997, American Mathematical Society, Providence, USA.
448. Barahona M, Pecora LM. Synchronization in small-world systems. Phys. Rev. Lett. 2002, 89(5):054101.
449. Nishikawa T, Motter AE, Lai Y-C, Hoppensteadt FC. Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?. Phys. Rev. Lett. 2003, 91(1):014101.
450. Solomonoff R, Rapoport A. Connectivity of random nets. Bull. Math. Biophys. 1951, 13:107-117.
451. Milgram S. The small world problem. Psychol. Today 1967, 2:60-67.
452. Travers J, Milgram S. An experimental study of the small world problem. Sociometry 1969, 32:425-443.
453. Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks. Nature 2000, 406:378-382.
454. Cohen R, Erez K, ben Avraham D, Havlin S. Resilience of the internet to random breakdowns. Phys. Rev. Lett. 2000, 85(21):4626-4628.
455. Pastor-Satorras R, Vespignani A. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 2001, 86(14):3200-3203.
456. de Solla Price DJ. A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inform. Sci. 1976, 27(5):292-306.
457. Simon HA. On a class of skew distribution functions. Biometrika 1955, 42:425-440.