Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters

Internet Mathematics

Volumn 6, Issue 1, 2009, Pages 29-123

  Leskovec, Jure ^a   Lang, Kevin J ^b   Dasgupta, Anirban ^b   Mahoney, Michael W ^a  

^a Stanford University   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924178998     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2009.10129177     Document Type: Article

References (181)

1. J. Abello. Hierarchical Graph Maps. Computers and Graphics 28:3 (2004), 345–359.
2. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link Communities Reveal Multi-scale Complexity in Networks. Preprint, arXiv:0903.3178, March 2009.
3. W. Aiello, F. R. K. Chung, and L. Lu. A Random Graph Model for Massive Graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171–180. New York: ACM Press, 2000.
4. W. Aiello, F. R. K. Chung, and L. Lu. A Random Graph Model for Power Law Graphs. Experimental Mathematics 10 (2001), 53–66.
5. R. Z. Albert and A.-L. Barabási. Emergence of Scaling in Random Networks. Science 286:5439 (1999), 509–512.
6. R. Z. Albert and A.-L. Barabási. Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74 (2002), 47–97.
7. R. Z. Albert, H. Jeong, and A.-L. Barabási. The Diameter of the World Wide Web. Nature 401 (1999), 130–131.
8. Christopher Allen. The Dunbar Number as a Limit to Group Sizes. Life with Alacrity. Availalbe at http://www.lifewithalacrity.com/2004/03/the dunbar numb.html, 2004.
9. R. Andersen and K. Lang. Communities from Seed Sets. In Proceedings of the 15th International Conference on World Wide Web, pp. 223–232. New York: ACM Press, 2006.
10. R. Andersen, F. R. K. Chung, and K. Lang. Local Graph Partitioning Using PageRank Vectors. In FOCS’06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486. Los Alamitos, CA: IEEE Press, 2006.
11. S. Arora and S. Kale. A Combinatorial, Primal–Dual Approach to Semidefinite Programs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 227–236. New York: ACM Press, 2007.
12. S. Arora, E. Hazan, and S. Kale. O(Formula Presented) Approximation to Sparsest Cut in Õ(n2) Time. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 238–247. Los Alamitos, CA: IEEE Press, 2004.
13. S. Arora, S. Rao, and U. Vazirani. Expander Flows, Geometric Embeddings and Graph Partitioning. In roceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 222–231. New York: ACM Press, 2004.
14. M. Babenko, J. Derryberry, A. Goldberg, R. Tarjan, and Y. Zhou. Experimental Evaluation of Parametric Max-Flow Algorithms. In Experimental Algorithms: 6th International Workshop, WEA 2007, Rome, Italy, June 6–8, 2007, Proceedings, Lecture Notes in Computer Science 4525, pp. 256–269. Berlin: Springer, 2007.
15. K. W. Back. Influence through Social Communication. Journal of Abnormal and Social Psychology 46 (1951), 9–23.
16. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group Formation in Large Social Networks: Membership, Growth, and Evolution. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM Press, pp. 44–54, 2006.
17. J. P. Bagrow and E. M. Bollt. Local Method for Detecting Communities. Physical Review E 72 (2005), 046108.
18. I. Benjamini, G. Kozma, and N. Wormald. The Mixing Time of the Giant Component of a Random Graph. Preprint, arXiv:math/0610459, October 2006.
19. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. U. Hwang. Complex Networks: Structure and Dynamics. Physics Reports 424:4–5 (2006), 175–308.
20. M. Boguñá, D. Krioukov, and K. C. Claffy. Navigability of Complex Networks. Nature Physics 5 (2009), 74–80.
21. B. Bollobás. Random Graphs. London: Academic Press, 1985.
22. B. Bollobás and O. M. Riordan. Mathematical Results on Scale-Free Random Graphs. In Handbook of Graphs and Networks, edited by S. Bornholdt and H. G. Schuster, pp. 1–34. New York: Wiley, 2004.
23. S. P. Borgattia and M. G. Everett. Models of Core/ Periphery Structures. Social Networks 21:4 (2000), 375–395.
24. U. Brandes, M. Gaertler, and D. Wagner. Engineering Graph Clustering: Models and Experimental Evaluation. Journal of Experimental Algorithmics 12:1 (2007), Article no. 1.1.
25. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph Structure in the Web. In 9th International World Wide Web Conference, pp. 309–320. Amsterdam: Elsevier, 2000.
26. S. Burer and R. D. C. Monteiro. A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-Rank Factorization. Mathematical Programming (Series B) 95:2 (2003), 329–357.
27. D. Chakrabarti and C. Faloutsos. Graph Mining: Laws, Generators, and Algorithms. ACM Computing Surveys 38:1 (2006), Article no. 2.
28. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A Recursive Model for Graph Mining. In SDM’04: Proceedings of the 4th SIAM International Conference on Data Mining, pp. 442–446. Philadelphia: SIAM, 2004.
29. D. Chakrabarti, C. Faloutsos, and Y. Zhan. Visualization of Large Networks with Min-Cut Plots, A-Plots and R-MAT. International Journal of Human-Computer Studies 65:5 (2007), 434–445.
30. J. Cheeger. A Lower Bound for the Smallest Eigenvalue of the Laplacian. In Problems in Analysis: A Symposium in Honor of Salomon Bochner, edited by Robert C. Gunning, pp. 195–199. Princeton: Princeton University Press, 1969.
31. B. V. Cherkassky and A. V. Goldberg. On Implementing Push–Relabel Method for the Maximum Flow Problem. In Integer Programming and Combinatorial Optimization: 4th International IPCO Conference Copenhagen, Denmark, May 29-31, 1995, Proceedings, Lecture Notes in Computer Science 920, pp. 157–171. Berlin: Springer, 1995.
32. F. R. K. Chung. Spectral Graph Theory, CBMS Regional Conference Series in Mathematics 92. Providence: American Mathematical Society, 1997.
33. F. R. K Chung. Four Proofs of Cheeger Inequality and Graph Partition Algorithms. Paper presented at the Fourth International Congress of Chinese Mathematicians (ICCM), Hangzhou, China, December 17–22, 2007.
34. F. R. K. Chung. The Heat Kernel as the Pagerank of a Graph. Proceedings of the National Academy of Sciences 104:50 (2007), 19735–19740.
35. F. R. K. Chung. Random Walks and Local Cuts in Graphs. Linear Algebra and Its Applications 423 (2007), 22–32.
36. F. R. K. Chung and L. Lu. The Diameter of Sparse Random Graphs. Advances in Applied Mathematics 26:4 (2002), 257–279.
37. F. R. K. Chung and L. Lu. The Average Distances in Random Graphs with Given Expected Degrees. Proceedings of the National Academy of Sciences 99:25 (2002), 15879–15882.
38. F. R. K. Chung and L. Lu. Connected Components in Random Graphs with Given Expected Degree Sequences. Annals of Combinatorics 6:2 (2002), 125–145.
39. F. R. K. Chung and L. Lu. The Average Distances in a Random Graph with Given Expected Degrees. Internet Mathematics 1 (2003), 91–113.
40. F. R. K. Chung and L. Lu. Complex Graphs and Networks, CBMS Regional Conference Series in Mathematics 107. Providence: American Mathematical Society, 2006.
41. F. R. K. Chung and L. Lu. The Volume of the Giant Component of a Random Graph with Given Expected Degrees. SIAM Journal on Discrete Mathematics 20 (2006), 395–411.
42. F. R. K. Chung, L. Lu, and V. Vu. Eigenvalues of Random Power Law Graphs. Annals of Combinatorics 7 (2003), 21–33.
43. F. R. K. Chung, L. Lu, and V. Vu. The Spectra of Random Graphs with Given Expected Degrees. Proceedings of the National Academy of Sciences 100:11 (2003), 6313–6318.
44. F. R. K. Chung, L. Lu, and V. Vu. The Spectra of Random Graphs with Given Expected Degrees. Internet Mathematics 1 (2004), 257–275.
45. A. Clauset. Finding Local Community Structure in Networks. Physical Review E 72 (2005), 026132.
46. A. Clauset, M. E. J. Newman, and C. Moore. Finding Community Structure in Very Large Networks. Preprint, arXiv:cond-mat/0408187, August 2004.
47. A. Clauset, C. Moore, and M. E. J. Newman. Structural Inference of Hierarchies in Networks. Preprint, arXiv:physics/0610051, October 2006.
48. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-Law Distributions in Empirical Data. Preprint, arXiv:0706.1062, June 2007.
49. V. Colizza, A. Flammini, M. A. Serrano, and A. Vespignani. Characterization and Modeling of Protein–Protein Interaction Networks. Physica A Statistical Mechanics and Its Applications 352 (2005), 1–27.
50. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. Villas Boas. Characterization of Complex Networks: A Survey of Measurements. Advances in Physics 56:1 (2007), 167–242.
51. M. R. da Silva, H. Ma, and A.-P. Zeng. Centrality, Network Capacity, and Modularity as Parameters to Analyze the Core-Periphery Structure in Metabolic Networks. Proceedings of the IEEE 96:8 (2008), 1411–1420.
52. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing Community Structure Identification. Journal of Statistical Mechanics: Theory and Experiment 29:09 (2005), P09008.
53. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted Graph Cuts without Eigenvectors: A Multilevel Approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 29:11 (2007), 1944–1957.
54. W. E. Donath and A. J. Hoffman. Algorithms for Partitioning Graphs and Computer Logic Based on Eigenvectors of Connection Matrices. IBM Technical Disclosure Bulletin 15:3 (1972), 938–944.
55. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of Networks. Advances in Physics 51 (2002), 1079–1187.
56. S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes. k-Core Organization of Complex Networks. Physical Review Letters 96:4 (2006), 040601.
57. J. Doyle and J. M. Carlson. Power Laws, Highly Optimized Tolerance, and Generalized Source Coding. Physical Review Letters 84:24 (2000), 5656–5659.
58. J. Doyle and J. M. Carlson. Complexity and Robustness. Proceedings of the National Academy of Sciences 99 (2002), 2538–2545.
59. R. Dunbar. Grooming, Gossip, and the Evolution of Language. Cambridge, MA: Harvard University Press, 1998.
60. E. Estrada. Spectral Scaling and Good Expansion Properties in Complex Networks. Europhysics Letters 73 (2006), 649–655.
61. E. Estrada. Topological Structural Classes of Complex Networks. Physical Review E 75 (2007), 016103.
62. E. Estrada and N. Hatano. Communicability Graph and Community Structures in Complex Networks. Preprint, arXiv:0905.4103, May 2009.
63. T. S. Evans and R. Lambiotte. Line Graphs, Link Partitions, and Overlapping Communities. Physical Review E 80 (2009), 016105.
64. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou. Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet. In Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8-13, 2002, Proceedings, Lecture Notes In Computer Science 2380, pp. 110–122. Berlin: Springer, 2002.
65. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law Relationships of the Internet Topology. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 251–262. New York: ACM Press, 1999.
66. U. Feige and E. Ofek. Spectral Techniques Applied to Sparse Random Graphs. Random Structures and Algorithms 27 (2005), 251–275.
67. D. Fernholz and V. Ramachandran. The Diameter of Sparse Random Graphs. Random Structures and Algorithms 31 (2007), 482–516.
68. C. M. Fiduccia and R. M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions. In Proceedings of the 19th Design Automation Conference, pp. 175–181. Piscataway, NJ: IEEE Press, 1982.
69. M. Fiedler. Algebraic Connectivity of Graphs. Czechoslovak Mathematical Journal 23:98 (1973), 298–305.
70. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient Identification of Web Communities. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160. New York: ACM Press, 2000.
71. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self- Organization and Identification of Web Communities. Computer 35:3 (2002), 66–71.
72. G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis. Graph Clustering and Minimum Cut Trees. Internet Mathematics 1:4 (2003), 385–408.
73. A. D. Flaxman, A. M. Frieze, and J. Vera. A Geometric Preferential Attachment Model of Networks. In Algorithms and Models for the Web- Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings, Lecture Notes in Computer Science 3243, pp. 44–55. Berlin: Springer, 2004.
74. A. Flaxman, A. Frieze, and T. Fenner. High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics 2:1 20050, 1–19.
75. A. D. Flaxman, A. M. Frieze, and J. Vera. A Geometric Preferential Attachment Model of Networks II. In Algorithms and Models for the Web-Graph: 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11–12, 2007, Proceeedings, Lecture Notes in Computer Science 4863, pp. 41–55. Berlin: Springer, 2007.
76. S. Fortunato. Community Detection in Graphs. Physics Reports 486 (2010), 75–174.
77. S. Fortunato and M. Barthélemy. Resolution Limit in Community Detection. Proceedings of the National Academy of Sciences 104:1 (2007), 36–41.
78. N. Fountoulakis and B. Reed. The Evolution of the Mixing Rate. Preprint, arXiv:math/0701474, January 2007.
79. N. Fountoulakis and B.A. Reed. Faster Mixing and Small Bottlenecks. Probability Theory and Related Fields 137:3–4 (2007), 475–486.
80. M. Gaertler. Clustering. In Network Analysis: Methodological Foundations, edited by U. Brandes and T. Erlebach, pp. 178–215. New York: Springer, 2005.
81. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A Fast Parametric Maximum Flow Algorithm and Applications. SIAM Journal on Computing 18:1 (1989), 30–55.
82. J. Gehrke, P. Ginsparg, and J. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD Explorations 5:2 (2003), 149–151.
83. D. Gibson, J. Kleinberg, and P. Raghavan. Inferring Web Communities from Link Topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia, pp. 225–234. New York: ACM Press, 1998.
84. M. Girvan and M. E. J. Newman. Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences 99:12 (2002), 7821–7826.
85. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and Congestion in Power Law Graphs. In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 148–159. New York: ACM Press, 2003.
86. University of Glasgow. TREC Web Corpus: WT10g. Available at http://ir.dcs.gla.ac.uk/testcollections/wt10g.html, 2000.
87. A. V. Goldberg and S. Rao. Beyond the Flow Decomposition Barrier. Journal of the ACM 45 (1998), 783–797.
88. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum-Flow Problem. Journal of the ACM 35 (1988), 921–940.
89. Google, Inc. Google Programming Contest. Available at http://www.google.com/programming-contest/, 2002.
90. S. Guattery and G. L. Miller. On the Quality of Spectral Separators. SIAM Journal on Matrix Analysis and Applications 19 (1998), 701–719.
91. R. Guimerà, M. Sales-Pardo, and L. A. N. Amaral. Modularity from Fluctuations in Random Graphs and Complex Networks. Physical Review E 70 (2004), 025101.
92. N. Gulbahce and S. Lehmann. The Art of Community Detection. BioEssays 30:10 (2008), 934–938.
93. M. B. Hastings. Community Detection as an Inference Problem. Physical Review E 74 (2006), 035102.
94. B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. In Proceedings of the 1995 ACM/IEEE Conference on Supercomputing (CDROM), Article no. 28. New York: ACM Press, 1995.
95. P. Holme. Core–Periphery Organization of Complex Networks. Physical Review E 72 (2005), 046111.
96. S. Hoory, N. Linial, and A. Wigderson. Expander Graphs and Their Applications. Bulletin of the American Mathematical Society 43 (2006), 439–561.
97. J. Hopcroft, O. Khan, B. Kulis, and B. Selman. Natural Communities in Large Linked Networks. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 541–546. New York: ACM Press, 2003.
98. 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.
99. A. K. Jain, M. N. Murty, and P. J. Flynn. Data Clustering: A Review. ACM Computing Surveys 31 (1999), 264–323.
100. H. Jeong, S. P. Mason, A.-L. Barabási, and Z. N. Oltvai. Lethality and Centrality in Protein Networks. Nature 411 (2001), 41–42.
101. R. Kannan, S. Vempala, and A. Vetta. On Clusterings: Good, Bad and Spectral. Journal of the ACM 51:3 (2004), 497–515.
102. B. Karrer, E. Levina, and M. E. J. Newman. Robustness of Community Structure in Networks. Preprint, arXiv:0709.2108, September 2007.
103. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20 (1998), 359–392.
104. G. Karypis and V. Kumar. Multilevel k-Way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing 48 (1998), 96–129.
105. B. Kernighan and S. Lin. An Effective Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal 49 (1970), 291–308.
106. A. Khalil and Y. Liu. Experiments with PageRank Computation. Technical Report 603, Indiana University Department of Computer Science, December 2004.
107. R. Khandekar, S. Rao, and U. Vazirani. Graph Partitioning Using Single Commodity Flows. In Proceedings of the 38th annual ACM Symposium on Theory of Computing, pp. 385–390. New York: ACM Press, 2006.
108. B. Klimt and Y. Yang. Introducing the Enron Corpus, First Conference on Email and Anti-Spam (CEAS) 2004 Proceedings. Available at http://ceas.cc/2004/168.pdf, 2004.
109. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for Emerging Cyber-communities. Computer Networks 31:11 (1999), 1481–1493.
110. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic Models for the Web Graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57–65. Washington, DC: IEEE Computer Society, 2000.
111. R. Kumar, J. Novak, and A. Tomkins. Structure and Evolution of Online Social Networks. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 611–617. New York: ACM Press, 2006.
112. A. Lancichinetti and S. Fortunato. Community Detection Algorithms: A Comparative Analysis. Physical Review E 80 (2009), 056117.
113. K. Lang. Finding Good Nearly Balanced Cuts in Power Law Graphs. Technical Report YRL-2004-036, Yahoo! Research Labs, Pasadena, CA, November 2004.
114. K. Lang and S. Rao. Finding Near-Optimal Cuts: An Empirical Evaluation. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 212–221. Philadelphia: SIAM, 1993.
115. K. Lang and S. Rao. A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. In Integer Programming and Combinatorial Optimization: 10th International IPCO Conference, New York, NY, USA, June 7–11, 2004. Proceedings, Lecture Notes in Computer Science 3064, pp. 325–337. Berlin: Springer, 2004.
116. T. Leighton and S. Rao. An Approximate Max-Flow Min- Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pp. 422–431. Washington, DC: IEEE Computer Society, 1988.
117. T. Leighton and S. Rao. Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms. Journal of the ACM 46:6 (1999), 787–832.
118. J. Leskovec and C. Faloutsos. Scalable Modeling of Real Graphs Using Kronecker Multiplication. In Proceedings of the 24th International Conference on Machine Learning, pp. 497–504. New York: ACM Press, 2007.
119. J. Leskovec, D. Chakrabarti, J. Kleinberg, and C. Faloutsos. Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. In Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3–7, 2005, Proceedings, Lecture Notes in Computer Science 3721, pp. 133–145. Berlin: Springer, 2005.
120. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In Proceeding of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187. New York: ACM Press, 2005.
121. J. Leskovec, L. A. Adamic, and B. A. Huberman. The Dynamics of Viral Marketing. ACM Transactions on the Web 1:1 (2007), Article no. 5.
122. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data 1:1 (2007), Article no. 2.
123. J. Leskovec, M. McGlohon, C. Faloutsos, N. S. Glance, and M. Hurst. Patterns of Cascading Behavior in Large Blog Graphs. In Proceedings of the 2007 SIAM International Conference on Data Mining, pp. 551-556. Philadelphia: SIAM, 2007.
124. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Preprint, arXiv:0810.1355, October 2008.
125. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical Properties of Community Structure in Large Social and Information Networks. In Proceedings of the 17th International Conference on World Wide Web, pp. 695–704. New York: ACM Press, 2008.
126. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker Graphs: An Approach to Modeling Networks. Journal of Machine Learning Research 11 (2010), 985–1042.
127. J. Leskovec, K. J. Lang, and M. W. Mahoney. Empirical Comparison of Algorithms for Network Community Detection. In Proceedings of the 19th International Conference on World Wide Web, pp. 631–640. New York: ACM Press, 2010.
128. L. Li, J. C. Doyle, and W. Willinger. Towards a Theory of Scale- Free Graphs: Definition, Properties, and Implications. Internet Mathematics 2:4 (2006), 431–523.
129. L. Lu. The Diameter of Random Massive Graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 912–921. Philadelphia: SIAM, 2001.
130. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson. The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations. Behavioral Ecology and Sociobiology 54 (2003), 396–405.
131. M. Mihail and C. H. Papadimitriou. On the Eigenvalue Power Law. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, pp. 254–262. Berlin: Springer, 2002.
132. M. Mihail, C. H. Papadimitriou, and A. Saberi. On Certain Connectivity Properties of the Internet Topology. Journal of Computer and System Sciences 72:2 (2006), 239–251.
133. R. Milo, N. Kashtan, S. Itzkovitz, M. E. J. Newman, and U. Alon. On the Uniform Generation of Random Graphs with Prescribed Degree Sequences. Preprint, arXiv:cond-mat/0312028v2, May 2004.
134. B. Mohar. The Laplacian Spectrum of Graphs. In Graph Theory, Combinatorics, and Applications, Vol. 2, edited by Y. Alavi, G. Chartrand, O. R. Oellermann, and A.J. Schwenk, pp. 871–898. New York: Wiley, 1991.
135. M. Molloy and B. Reed. A Critical Point for Random Graphs with a Given Degree Sequence. Random Structures and Algorithms 6 (1995), 161–180.
136. M. Molloy and B. Reed. The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Combinatorics, Probability and Computing 7 (1998), 295–305.
137. A.L. Montgomery and C. Faloutsos. Identifying Web Browsing Trends and Patterns. Computer 34:7 (2001), 94–95.
138. Netflix, Inc. Netflix Prize. Available at http://www.netflixprize.com/, 2009.
139. M. E. J. Newman. The Structure and Function of Complex Networks. SIAM Review 45 (2003), 167–256.
140. M. E. J. Newman. Detecting Community Structure in Networks. The European Physical Journal B 38 (2004), 321–330.
141. M. E. J. Newman. Power Laws, Pareto Distributions and Zipf’s Law. Contemporary Physics 46 (2005), 323–351.
142. M. E. J. Newman. Finding Community Structure in Networks Uusing the Eigenvectors of Matrices. Physical Review E 74 (2006), 036104.
143. M. E. J. Newman. Modularity and Community Structure in Networks. Proceedings of the National Academy of Sciences 103:23 (2006), 8577–8582.
144. Mark Newman. Network Data. Available at http://www-personal.umich.edu/∼mejn/netdata/, 2009.
145. M. E. J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E 69 (2004), 026113.
146. M. E. J. Newman and E. A. Leicht. Mixture Models and Exploratory Analysis in Networks. Proceedings of the National Academy of Sciences 104:23 (2007), 9564–9569.
147. University of Oregon Advanced Network Technology Center. University of Oregon Route Views Project: Online Data and Reports. Available at http://www.routeviews.org, 1997.
148. G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society. Nature 435:7043 (2005), 814–818.
149. Y. Qi, J. K. Seetharaman, and Z. B. Joseph. Random Forest Similarity for Protein–Protein Interaction Prediction from Multiple Sources. In Pacific Symposium on Biocomputing, pp. 531–542. Ridge Edge, NJ:World Scientific, 2005.
150. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and Identifying Communities in Networks. Proceedings of the National Academy of Sciences 101:9 (2004), 2658–2663.
151. U. Nandini Raghavan, R. Z. Albert, and S. Kumara. Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks. Physical Review E 76 (2007), 036106.
152. E. Ravasz and A.-L. Barabási. Hierarchical Organization in Complex Networks. Physical Review E 67 (2003), 026112.
153. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási. Hierarchical Organization of Modularity in Metabolic Networks. Science 297:5586 (2002), 1551–1555.
154. J. Reichardt and S. Bornholdt. Partitioning and Modularity of Graphs with Arbitrary Degree Distribution. Physical Review E 76 (2007), 015102.
155. Y. Ren, R. Kraut, and S. Kiesler. Applying Common Identity and Bond Theory to Design of Online Communities. Organization Studies 28:3 (2007), 377–408.
156. M. Richardson, R. Agrawal, and P. Domingos. Trust Management for the Semantic Web. In The SemanticWeb—ISWC 2003, Lecture Notes in Computer Science 2870, pp. 351–368. Berlin: Springer, 2003.
157. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing 6:1 (2002), 50–57.
158. M. Rosvall and C. T. Bergstrom. An Information- Theoretic Framework for Resolving Community Structure in Complex Networks. Proceedings of the National Academy of Sciences 104:18 (2007), 7327–7331.
159. M. Rosvall and C. T. Bergstrom. Maps of Random Walks on Complex Networks Reveal Community Structure. Proceedings of the National Academy of Sciences 105:4 (2008), 1118–1123.
160. S. F. Sampson. A Novitiate in a Period of Change: An Experimental and Case Study of Social Relationships. PhD thesis, Cornell University Deptartment of Sociology, 1968.
161. S. E. Schaeffer. Graph Clustering. Computer Science Review 1:1 (2007), 27–64.
162. J. Shi and J. Malik. Normalized Cuts and Image Segmentation. IEEE Transcations of Pattern Analysis and Machine Intelligence 22:8 (2000), 888–905.
163. G. Siganos, S. L. Tauro, and M. Faloutsos. Jellyfish: A Conceptual Model for the Internet Topology. Journal of Communications and Networks 8 (2006), 339–350.
164. D. A. Spielman and S.-H. Teng. Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 96–107. Los Alamitos, CA: IEEE Press, 1996.
165. D. A. Spielman and S.-H. Teng. Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems. In Proceedings of the 36th annual ACM Symposium on Theory of Computing pp. 81–90. New York: ACM Press, 2004.
166. D. A. Spielman and S.-H. Teng. Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems. Preprint, arXiv:cs/0310051v9, March 2004.
167. S. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A Simple Conceptual Model for the Internet Topology. In GLOBECOM’01: IEEE Global Telecommunications Conference, pp. 1667–1671. Los Alamitos, Ca: IEEE Press, 2001.
168. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290:5500 (2000), 2319–2323.
169. U. von Luxburg. A Tutorial on Spectral Clustering. Technical Report 149, Max Plank Institute for Biological Cybernetics, August 2006.
170. P. Wang, M. C. González, C. A. Hidalgo, and A.-L. Barabási. Understanding the Spreading Patterns of Mobile Phone Viruses. Science 324:5930 (2009), 1071–1076.
171. S. Wasserman and K. Faust. Social Network Analysis. Cambridge, UK: Cambridge University Press, 1994.
172. D. J. Watts and S. H. Strogatz. Collective Dynamics of Small-World Networks. Nature 393 (1998), 440–442.
173. S. White and P. Smyth. A Spectral Clustering Approach to Finding Communities in Graphs. In SDM’05: Proceedings of the 5th SIAM International Conference on Data Mining, pp. 76–84. Philadelphia: SIAM, 2005.
174. F. Wu and B. A. Huberman. Finding Communities in Linear Time: A Physics Approach. The European Physical Journal B 38:2 (2004), 331–338.
175. Q. Xuan, Y. Li, and T.-J. Wu. Growth Model for Complex Networks with Hierarchical and Modular Structures. Physical Review E 73 (2006), 036105.
176. T. Yang, R. Jin, Y. Chi, and S. Zhu. Combining Link and Content for Community Detection: A Discriminative Approach. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 927–936. New York: ACM Press, 2009.
177. W. W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research 33 (1977), 452–473.
178. C. T. Zahn. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters. IEEE Transactions on Computers C-20:1 (1971), 68–86.
179. Y. Zhao and G. Karypis. Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Machine Learning 55 (2004), 311–331.
180. D. Zinoviev. Topology and Geometry of Online Social Networks. Preprint, arXiv:0807.3996, July 2008.
181. D. Zinoviev and V. Duong. Toward Understanding Friendship in Online Social Networks. Preprint, arXiv:0902.4658, February 2009.