Stochastic kronecker graphs

Random Structures and Algorithms

Volumn 38, Issue 4, 2011, Pages 453-466

  Mahdian, Mohammad ^a   Xu, Ying ^b  

^a YAHOO RESEARCH   (United States)

^b Stanford University   (United States)

Author keywords

Connectivity; Kronecker graphs; Random graphs; Small world networks; Web graphs

Indexed keywords

EID: 79956074520     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20335     Document Type: Article

References (14)

1. E. Arcaute, N. Chen, R. Kumar, D. Liben-Nowell, M. Mahdian, H. Nazerzadeh, and Y. Xu, Deterministic decentralized search in random graphs, Internet Math WAW 2007 5 ( 2009), 141-154.
2. B. Bollobás, The diameter of random graphs, IEEE Trans Inf Theory 36 ( 1990), 285-288.
3. F. Chung, and L. Lu, The diameter of random sparse graphs, Adv Appl Math 26 ( 2001), 257-279.
4. F. Chung, and L. Lu, Complex graphs and networks, American Mathematical Society, Boston, MA, 2004.
5. P. ErdOs, and A. Rényi, On random graphs i, Publicationes Mathematicae, Debrecen, 1959, pp. 290e-297e.
6. D. Karger, and C. Stein, A new approach to the minimum cut problem, J ACM 43 ( 1996), 601-640.
7. V. Klee, and D. Larmann, Diameters of random graphs, Can J Math 33 ( 1981), 618-640.
8. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, In Proceedings of 32nd ACM Symposium on Theory of Computing, Portland, OR, 2000.
9. J. Kleinberg, Small-world phenomena and the dynamics of information, In Advances in neural information processing systems (NIPS), MIT Press, Cambridge, MA, 2001.
10. J. Kleinberg, Complex networks and decentralized search algorithms, In Proceedings of the International Congress of Mathematicians (ICM), 2006.
11. J. Leskovec, D. Chakrabarti, J. Kleinberg, and C. Faloutsos, Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication, PKDD Springer ( 2005), 133-145.
12. J. Leskovec, and C. Faloutsos, Scalable modeling of real graphs using kronecker multiplication, Presented at the International Conference on Machine Learning (ICML), Corvalis, OR, 2007.
13. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans Knowledge Discov Data 1 ( 2007).
14. M. Molloy, and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct Algorithms 6 ( 1995), 161-180.