Statistical properties of community structure in large social and information networks

Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08

Volumn , Issue , 2008, Pages 695-704

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

Community structure; Conductance; Graph partitioning; Random walks; Social networks

Indexed keywords

COMMUNITY STRUCTURE; CONDUCTANCE; GRAPH PARTITIONING; RANDOM WALKS; SOCIAL NETWORKS;

DEFORESTATION; INFORMATION SERVICES; INTERNET; NUMERICAL ANALYSIS;

WORLD WIDE WEB;

CONDUCTIVITY; DEFORESTATION; INFORMATION RETRIEVAL; INTERNET; RANDOM PROCESSES; SERVICES;

EID: 52949106331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1367497.1367591     Document Type: Conference Paper

References (37)

1. R. Z. Albert and A-L. Barabási. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
2. Christopher Allen. Life with alacrity: The Dunbar number as a limit to group sizes, http://www.lifewithalacrity. com/2004/03/the-dunbar-numb.html, 2004.
3. 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, pages 475-486, 2006.
4. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proceedings of the 36th annual ACM Symposium on Theory of Computing, pages 222 231, 2004.
5. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 44-54, 2006.
6. F.R.K. Chung. Spectral graph theory, volume 92 of CBMS Regional Conference Series in Mathematics. AMS, 1997.
7. F.R.K. Chung and L. Lu. Complex Graphs and Networks, volume 107 of CBMS Regional Conference Series in Mathematics. AMS, 2006.
8. A. Clauset, M.E.J. Newman, and C. Moore. Finding community structure in very large networks. arXiv:cond-mat/0408187, August 2004.
9. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment, 29(09) :P09008, 2005.
10. 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): 1944-1957, 2007.
11. Robin Dunbar. Grooming, Gossip, and the Evolution of Language. Harvard Univ Press, October 1998.
12. A.D. Flaxman, A.M. Frieze, and J. Vera. A geometric preferential attachment model of networks. In WAW '04: Proceedings of the 3rd Workshop On Algorithms And Models For The Web-Graph, pages 44-55, 2004.
13. M. Gaertler. Clustering. In U. Brandes and T. Erlebach, editors, Network Analysis: Methodological Foundations, pages 178-215. Springer, 2005.
14. J. Gehrke, P. Ginsparg, and J. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD Explorations, 5(2), 2003.
15. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43:439-561, 2006.
16. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. Jour, of the ACM, 51(3), 2004.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20:359 392, 1998.
18. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000.
19. K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. In IPCO '04: Proceedings of the 10th International Conf. on Integer Programming and Combinatorial Optimization, 2004.
20. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
21. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05: Proceeding of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pages 177-187, 2005.
22. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Transact, on Knowledge Discovery from Data, 1(1), 2007.
23. J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney. Statistical properties of community structure in large social and information networks. Manuscript.
24. M.E.J. Newman. Detecting community structure in networks. The European Physical J. B, 38:321-330, 2004.
25. M.E.J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74, 2006.
26. M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 103(23):8577-8582, 2006.
27. E. Ravasz and A.-L. Barabási. Hierarchical organization in complex networks. Physical Review E, 67:026112, 2003.
28. M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In ISWC '03: Proceedings of the 2nd International Semantic Web Conference, pages 351-368, 2003.
29. 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):50-57, 2002.
30. S.E. Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, 2007.
31. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transcations of Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
32. D.A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In FOCS '96: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 96-107, 1996.
33. S.L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the internet topology. In GLOBECOM '01: Global Telecommunications Conference, pages 1667-1671, 2001.
34. D.J. Watts and S.H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440 442, 1998.
35. W.W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.
36. C.T. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20(1):68-86, 1971.
37. Y. Zhao and G. Karypis. Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning, 55:311-331, 2004.