Communities in networks

Notices of the American Mathematical Society

Volumn 56, Issue 9, 2009, Pages 1082-1097

  Porter, Mason A ^a   Onnela, Jukka Pekka ^a,b,c   Mucha, Peter J ^d  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b HARVARD UNIVERSITY   (United States)

^c AALTO UNIVERSITY   (Finland)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349607513     PISSN: 00029920     EISSN: 10889477     Source Type: Journal    
DOI: None     Document Type: Article

References (133)

1. G. Agarwal and D. Kempe, Modularitymaximizing network communities using mathematical programming, The European Physical Journal B, 66 (2008), 409-418.
2. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, Communities and hierarchical organization of links in complex networks. arXiv:0903.3178 (2009).
3. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, 74 (2002), 47-97.
4. J. M. Anthonisse, The rush in a graph. Technical Report BN 9/71, Stichting Mathematische Centrum, Amsterdam, 1971.
5. A. Arenas, A. Fernández, S. Fortunato, and S. Gómez, Motif-based communities in complex networks, Journal of Physics A: Mathematical and Theoretical, 41, 224001 (2008).
6. A. Arenas, A. Fernández, and S. Gómez, Analysis of the structure of complex networks at different resolution levels, New Journal of Physics, 10, 053039 (2008).
7. J. P. Bagrow, Evaluating local community methods in networks, Journal of Statistical Mechanics: Theory and Experiment, P05001 (2008).
8. J. P. Bagrow and E. M. Bollt, A local method for detecting communities, Physical Review E, 72, 046108 (2005).
9. S. Bansal, S. Khandelwal, and L. A. Meyers, Evolving clustered random networks. arXiv: 0808.0509 (2008).
10. M. J. Barber, Modularity and community detection in bipartite networks, Physical Review E, 76, 066102 (2007).
11. M. Blatt, S. Wiseman, and E. Domany, Superparamagnetic clustering of data, Physical Review Letters, 76 (1996), 3251-3254.
12. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large network, Journal of Statistical Mechanics: Theory and Experiment, P10008 (2008).
13. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: Structure and dynamics, Physics Reports, 424 (2006), 175-308.
14. S. P. Borgatti, M. G. Everett, and P. R. Shirey, LS Sets, Lambda Sets and other cohesive subsets, Social Networks, 12 (1990), 337-357.
15. J. M. Bower and H. Bolouri, eds., Computational modeling of genetic and biochemical networks, The MIT Press, Cambridge, Massachusetts, 2001.
16. D. M. Boyd and N. B. Ellison, Social network sites: Definition, history, and scholarship, Journal of Computer-Mediated Communication, 13, 11 (2007).
17. U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer, Z. Nikoloski, and D. Wagner, On modularity clustering, IEEE Transactions on Knowledge and Data Engineering, 20 (2008), 172-188.
18. M. Brzozowski, T. Hogg, and G. Szabo, Friends and foes: Ideological social networking, in Proceedings of the SIGCHI Conference on Human Factors in Computing, ACM Press, New York, NY, 2008.
19. C. T. Butts, Network inference, error, and informant (in)accuracy: a Bayesian approach, Social Networks, 25 (2003), 103-140.
20. G. Caldarelli, Scale-free networks: Complex webs in nature and technology, Oxford University Press, Oxford, 2007.
21. A. Capocci, V. D. P. Servedio, G. Caldarelli, and F. Colaiori, Detecting communities in large networks, Physica A, 352 (2004), 669-676.
22. A. Clauset, Finding local community structure in networks, Physical Review E, 72, 026132 (2005).
23. A. Clauset, C. Moore, and M. E. J. Newman, Hierarchical structure and the prediction of missing links in networks, Nature, 453 (2008), 98-101.
24. A. Clauset, M. E. J. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, 70, 066111 (2004).
25. J. S. Coleman, An introduction to mathematical sociology, Collier-Macmillan, London, 1964.
26. L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, P09008 (2005).
27. J.-C. Delvenne, S. N. Yaliraki, and M. Barahona, Stability of graph communities across time scales. arXiv:0812.1811 (2008).
28. I. Derényi, G. Palla, and T. Vicsek, Clique percolation in random networks, Physical Review Letters, 94, 160202 (2005).
29. L. Donetti and M. A. Muñoz, Detecting network communities: A new systematic and efficient algorithm, Journal of Statistical Mechanics: Theory and Experiment, P10012 (2004).
30. J. Duch and A. Arenas, Community detection in complex networks using extremal optimization, Physical Review E, 72, 027104 (2005).
31. J. Eisner, State-of-the-art algorithms for minimum spanning trees: A tutorial discussion. Manuscript available at http://cs.jhu.edu/~jason/papers/#ms97 (1997).
32. P. Elias, A. Feinstein, and C. E. Shannon, A note on the maximum flow through a network, IRE Transactions on Information Theory, 2, 4 (1956), 117-119.
33. T. S. Evans and R. Lambiotte, Line graphs, link partitions and overlapping communities, Physical Review E, 80, 016105 (2009).
34. D. J. Fenn, M. A. Porter, M. McDonald, S. Williams, N. F. Johnson, and N. S. Jones, Dynamic communities in multichannel data: An application to the foreign exchange market during the 2007-2008 credit crisis, Chaos, 19:3, 033119 (2009).
35. M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23 (1973), 289-305.
36. K. H. Fischer and J. A. Hertz, Spin glasses, Cambridge University Press, Cambridge, 1993.
37. L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Canadian Journal of Mathematics, 8 (1956), 399-404.
38. S. Fortunato and M. Barthélemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, 104 (2007), 36-41.
39. S. Fortunato, Community detection in graphs. arXiv:0906.0612 (2009).
40. J. H. Fowler, Legislative cosponsorship networks in the U.S. House and Senate, Social Networks, 28 (2006), 456-487.
41. J. H. Fowler and S. Jeon, The authority of Supreme Court precedent, Social Networks, 30 (2008), 16-30.
42. L. C. Freeman, A set of measures of centrality based upon betweenness, Sociometry, 40 (1977), 35-41.
43. L. C. Freeman, Segregation in social networks, Sociological Methods Research, 6 (1978), 411-429.
44. L. C. Freeman, The development of social network analysis: A study in the sociology of science, Empirical Press, Vancouver, Canada, 2004.
45. T. M. J. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Software-Practice and Experience, 21 (1991), 1129-1164.
46. G. Gan, C. Ma, and J. Wu, Data clustering: Theory, algorithms, and applications, Society for Industrial and Applied Mathematics, Philadelphia, 2007.
47. J. W. Gibbs, Elementary principles in statistical mechanics, Charles Scribner's Sons, New York, NY, 1902.
48. M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, 99 (2002), 7821-7826.
49. M. C. González, C. A. Hidalgo, and A.-L. Barabási, Understanding individual human mobility patterns, Nature, 453 (2008), 779-782.
50. J. C. Gower and G. J. S. Ross, Minimum spanning trees and single linkage cluster analysis, Applied Statistics, 18 (1969), 54-64.
51. M. Granovetter, The strength of weak ties, The American Journal of Sociology, 78 (1973), 1360-1380.
52. R. Guimerà and L. A. N. Amaral, Functional cartography of complex metabolic networks, Nature, 433 (2005), 895-900.
53. R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral, Module identification in bipartite and directed networks, Physical Review E, 76, 036102 (2007).
54. N. Gulbahce and S. Lehmann, The art of community detection, Bioessays, 30 (2008), 934-938.
55. M. S. Handcock, A. E. Rafter, and J. M. Tantrum, Model-based clustering for social networks, Journal of the Royal Statistical Society A, 170 (2007), 301-354.
56. M. B. Hastings, Community detection as an inference problem, Physical Review E, 74, 035102 (2006).
57. J. M. Hofman and C. H. Wiggins, Bayesian approach to network modularity, Physical Review Letters, 100, 258701 (2008).
58. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, Tracking evolving communities in large linked networks, Proceedings of the National Academy of Sciences, 101 (2004), 5249-5253.
59. T. Hogg, D. Wilkinson, G. Szabo, and M. Brzozowski, Multiple relationship types in online communities and social networks, in Proceedings of the AAAI Spring Symposium on Social Information Processing, AAAI Press (2008).
60. G. C. Homans, The human group, Harcourt, Brace, New York, 1950.
61. S. C. Johnson, Hierarchical clustering schemes, Psychometrica, 32 (1967), 241-254.
62. T. Kamada and S. Kawai, An algorithmfor drawing general undirected graphs, Information Processing Letters, 31 (1989), 7-15.
63. F. Képès, ed., Biological networks, Complex Systems and Interdisciplinary Science, Vol. 3, World Scientific, Hackensack, NJ, 2007.
64. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal, 49 (1970), 291-307.
65. T. G. Kolda and B. W. Bader, Tensor decompositions and applications, SIAM Review, 51:3 (2009), in press.
66. C. P. Kottak, Cultural anthropology, McGraw-Hill, New York, 5th ed., 1991.
67. R. Kumar, J. Novak, and A. Tomkins, Structure and evolution of online social networks. 12th International Conference on Knowledge Discovery and Data Mining (2006).
68. R. Lambiotte, J.-C. Delvenne, and M. Barahona, Dynamics and modular structure in networks. arXiv:0812.1770 (2008).
69. A. Lancichinetti, S. Fortunato, and J. Kertesz, Detecting the overlapping and hierarchical community structure of complex networks, New Journal of Physics, 11, 033015 (2009).
70. A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark graphs for testing community detection algorithms, Physical Review E, 93, 046110 (2008).
71. S. Lehmann, M. Schwartz, and L. K. Hansen, Biclique communities, Physical Review E, 78, 016108 (2008).
72. E. A. Leicht and M. E. J. Newman, Community structure in directed networks, Physical Review Letters, 100, 118703 (2008).
73. K. Lewis, J. Kaufman, M. Gonzalez, M. Wimmer, and N. A. Christakis, Tastes, ties, and time: A new (cultural,multiplex, and longitudinal) social network dataset using Facebook.com, Social Networks, 30 (2008), 330-342.
74. R. Luce and A. Perry, A method of matrix analysis of group structure, Psychometrika, 14 (1949), 95-116.
75. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network motifs: Simple building blocks of complex networks, Science, 298 (2002), 824-827.
76. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures and Algorithms, 6 (1995), 161-180.
77. J. Moody, Peer influence groups: Identifying dense clusters in large networks, Social Networks, 23 (2001), 261-283.
78. J. Moody and D. R. White, The cohesiveness of blocks in social networks, Sociological Methodology, 31 (2001), 305-359.
79. J. Moody and D. R. White, Structural cohesion and embeddedness: A hierarchical concept of social groups, American Sociological Review, 68 (2003), 103-127.
80. M. E. J. Newman, Scientific collaboration networks: I. Network construction and fundamental results, Physical Review E, 64, 016131 (2001).
81. M. E. J. Newman, Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality, Physical Review E, 64, 016132 (2001).
82. M. E. J. Newman, The structure of scientific collaborations, Proceedings of the National Academy of Sciences, 98 (2001), 404-409.
83. M. E. J. Newman, The structure and function of complex networks, SIAM Review, 45 (2003), 167-256.
84. M. E. J. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, 69, 066133 (2004).
85. M. E. J. Newman, A measure of betweeenness centrality based on random walks, Social Networks, 27 (2005), 39-54.
86. M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E, 74, 036104 (2006).
87. M. E. J. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences, 103 (2006), 8577-8582.
88. M. E. J. Newman, The physics of networks, Physics Today, 61:11 (2008), pp. 33-38.
89. M. E. J. Newman and M. Girvan, Mixing patterns and community structure in networks, in Statistical Mechanics of Complex Networks (R. Pastor-Satorras, J. Rubi, and A. Diaz-Guilera, eds.), Springer-Verlag, Berlin, 2003.
90. M. E. J. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, 69, 026113 (2004).
91. M. E. J. Newman and E. A. Leicht, Mixture models and exploratory analysis in networks, Proceedings of the National Academy of Sciences, 104 (2007), 9564-9569.
92. A. Noack, Modularity clustering is force-directed layout, Physical Review E, 79, 026102 (2009).
93. A. Noack and R. Rotta, Multi-level algorithms for modularity clustering, in Experimental Algorithms: 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings, Springer-Verlag, New York, 2009, pp. 257-268.
94. J.-P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, M. Argollo de Menezes, K. Kaski, A.-L. Barabási, and J. Kertész, Analysis of a large-scale weighted network of one-to-one human communication, New Journal of Physics, 9 (2007), 179.
95. J.-P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, D. Lazer, K. Kaski, J. Kertész, and A.-L. Barabási, Structure and tie strengths in mobile communication networks, Proceedings of the National Academy of Sciences, 104 (2007), 7332-7336.
96. G. Palla, A.-L. Barabási, and T. Vicsek, Quantifying social group evolution, Nature, 446 (2007), 664-667.
97. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, 435 (2005), 814-818.
98. P. Pons and M. Latapy, Computing communities in large networks using random walks, Journal of Graph Algorithms and Applications, 10 (2006), 191-218.
99. K. T. Poole and H. Rosenthal, Congress: A political-economic history of roll call voting, Oxford University Press, Oxford, 1997.
100. M. A. Porter, P. J. Mucha, M. E. J. Newman, and A. J. Friend, Community structure in the United States House of Representatives, Physica A, 386 (2007), 414-438.
101. M. A. Porter, P. J. Mucha, M. E. J. Newman, and C. M. Warmbrand, A network analysis of committees in the United States House of Representatives, Proceedings of the National Academy of Sciences, 102 (2005), 7057-7062.
102. A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications, 11 (1990), 430-452.
103. J. Reichardt and S. Bornholdt, Detecting fuzzy community structures in complex networks with a Potts model, Physical Review Letters, 93, 218701 (2004).
104. J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Physical Review E, 74, 016110 (2006).
105. J. Reichardt and D. R. White, Role models for complex networks, European Physical Journal B, 60 (2007), 217-224.
106. S. A. Rice, The identification of blocs in small political bodies, American Political Science Review, 21 (1927), 619-627.
107. T. Richardson, P. J. Mucha, and M. A. Porter, Spectral tripartitioning of networks, Physical Review Letters E, in press (2009), arXiv:0812.2852.
108. M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, 105 (2008), 1118-1123.
109. M. Sales-Pardo, R. Guimerà, A. A. Moreira, and L. A. N. Amaral, Extracting the hierarchical organization of complex systems, Proceedings of the National Academy of Sciences, 104, 39 (2007), 15224-15229.
110. S. E. Schaeffer, Graph clustering, Computer Science Review, 1 (2007), 27-64.
111. P. Schuetz and A. Caflisch, Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement, Physical Review E, 77, 046112 (2008).
112. F. Schwabl, Statistical mechanics, Springer-Verlag, New York, NY, 2002.
113. R. Scupin, Cultural anthropology-a global perspective, Prentice-Hall, Englewood Cliffs, NJ, 1992.
114. S. Seidman and B. Foster, A graph theoretic generalization of the clique concept, Journal of Mathematical Sociology, 6 (1978), 139-154.
115. T. M. Selee, T. G. Kolda, W. P. Kegelmeyer, and J. D. Griffin, Extracting clusters from large datasets withmultiple similaritymeasures using IMSCAND, in CSRI Summer Proceedings 2007, Technical Report SAND2007-7977, Sandia National Laboratories, Albuquerque, NM and Livermore, CA (M. L. Parks and S. S. Collis, eds.), 2007, pp. 87-103.
116. C. R. Shalizi, M. F. Camperi, and K. L. Klinkner, Discovering functional communities in dynamical networks, in Statistical Network Analysis: Models, Issues, and New Directions, Springer-Verlag, New York, NY (E. M. Airoldi, D. M. Blei, S. E. Feinberg, A. Goldenberg, E. P. Xing, and A. X. Zheng, eds.), 2007, pp. 140-157.
117. H. Simon, The architecture of complexity, Proceedings of the American Philosophical Society, 106 (1962), 467-482.
118. L. Sirovich, A pattern analysis of the second Renquist U.S. Supreme Court, Proceedings of the National Academy of Sciences, 100 (2003), 7432-7437.
119. P. B. Slater, Established clustering procedures for network analysis. arXiv:0806.4168 (2008).
120. S. H. Strogatz, Exploring complex networks, Nature, 410 (2001), 268-276.
121. V. A. Traag and J. Bruggeman, Community detection in networks with positive and negative links. arXiv:0811.2329 (2008).
122. A. L. Traud, E. D. Kelsic, P. J. Mucha, and M. A. Porter, Community structure in online collegiate social networks. arXiv:0809.0960 (2008).
123. G. Wang, Y. Shen, and M. Ouyang, A vector partitioning approach to detecting community structure in complex networks, Computers & Mathematics with Applications, 55 (2007), 2746-2752.
124. S. Wasserman and K. Faust, Social network analysis: Methods and applications, Structural Analysis in the Social Sciences, Cambridge University Press, Cambridge, 1994.
125. A. S. Waugh, L. Pei, J. H. Fowler, P. J. Mucha, and M. A. Porter, Party polarization in Congress: A social networks approach. arXiv:0907.3509 (2009).
126. R. S. Weiss and E. Jacobson, A method for the analysis of the structure of complex organizations, American Sociological Review, 20 (1955), 661-668.
127. H. C. White, S. A. Boorman, and R. L. Breiger, Social structure from multiple networks. I. Blockmodels of roles and positions, The American Journal of Sociology, 81, 4 (1976), 730-780.
128. Wikipedia, List of social networking websites. http://en.wikipedia.org/wiki/List_of_social_networking_websites, accessed 13 February 2009.
129. F. Wu and B. A. Huberman, Finding communities in linear time: A physics approach, The European Physical Journal B, 38 (2004), 331-338.
130. F. Y. Wu, The Potts model, Reviews of Modern Physics, 54 (1982), 235-268.
131. W. W. Zachary, An information flow model for conflict and fission in small groups, Journal of Anthropological Research, 33 (1977), 452-473.
132. L. V. Zhang, O. D. King, S. L. Wong, D. S. Goldberg, A. H. Y. Tong, G. Lesage, B. Andrews, H. Bussey, C. Boone, and F. P. Roth, Motifs, themes and thematicmaps of an integrated Saccharomyces cerevisiae interaction network, Journal of Biology, 4, 6 (2005).
133. Y. Zhang, A. J. Friend, A. L. Traud, M. A. Porter, J. H. Fowler, and P. J. Mucha, Community structure in Congressional cosponsorship networks, Physica A, 387 (2008), 1705-1712.