Microscopic evolution of social networks

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 462-470

  Leskovec, Jure ^a   Backstrom, Lars ^b   Kumar, Ravi ^c   Tomkins, Andrew ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

Graph generators; Maximum likelihood; Network evolution; Social networks; Transitivity; Triadic closure

Indexed keywords

GRAPH GENERATORS; NETWORK EVOLUTION; SOCIAL NETWORKS; TRANSITIVITY; TRIADIC CLOSURE;

BLOCK CODES; INFORMATION MANAGEMENT; MINING;

MAXIMUM LIKELIHOOD ESTIMATION;

EID: 65449171667     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401948     Document Type: Conference Paper

References (23)

1. R. Albert and A.-L. Barabasi. Emergence of scaling in random networks. Science, 286:509-512, 1999.
2. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47, 2002.
3. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: Membership, growth, and evolution. In 12th KDD, pages 44-54, 2006.
4. I. Bezáková, A. Kalai, and R. Santhanam. Graph model selection using maximum likelihood. In 23rd ICML, pages 105-112, 2006.
5. A. Blum, H. Chan, and M. Rwebangira. A random-surfer web-graph model. In ANALCO, 2006.
6. B. Bollobas and O. Riordan. Mathematical results on scale-free random graphs. In S. Bornholdt and H. Schuster, editors, Handbook of Graphs and Networks, pages 1-37. Wiley-WCH, 2002.
7. A. Broder, S. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener. Graph structure in the web. Computer Networks/WWW, 33(1-6):309-320, 2000.
8. S. Dorogovtsev and J. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford Univ. Press, 2003.
9. P. Erdos and A. Rényi. On the evolution of random graphs. Mathematical Institute of the Hungarian Academy of Science, 1960.
10. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
11. D. Fetterly, M. Manasse, M. Najork, and J. Wiener. A large-scale study of the evolution of web pages. Software Practice and Experience, 34(2):213-237, 2004.
12. D. Krackhardt and M. Handcock. Heider vs. Simmel: Emergent features in dynamic structure. In Statistical Network Analysis: Models, Issues, and New Directions, pages 14-27, 2007.
13. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In 12th KDD, pages 611-617, 2006.
14. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In 41st FOCS, pages 57-65, 2000.
15. J. Leskovec and C. Faloutsos. Scalable modeling of real graphs using Kronecker multiplication. In 24th ICML, pages 497-504, 2007.
16. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM TKDD, 1(1):2, 2007.
17. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In 12th CIKM, pages 556-559, 2003.
18. M. Newman. The structure and function of complex networks. SIAM Review, 45, 2:167-256, 2003.
19. A. Ntoulas, J. Cho, and C. Olston. What's new on the web? The evolution of the web from a search engine perspective. In 13th WWW, pages 1-12, 2004.
20. X. Shi, L. A. Adamic, and M. J. Strauss. Networks of strong ties. Physica A, 378(1):3347, 2007.
21. S. Strogatz. Exploring complex networks. Nature, 410, 2001.
22. S. Wasserman and P. Pattison. Logit models and logistic regressions for social networks. Psychometrika, 60:401-425, 1996.
23. C. Wiuf, M. Brameier, O. Hagberg, and M. P. Stumpf. A likelihood approach to analysis of network data. PNAS, 103(20), 2006.