Stochastic kronecker graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4863 LNCS, Issue , 2007, Pages 179-186

  Mahdian, Mohammad ^a   Xu, Ying ^b  

^a YAHOO RESEARCH   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; RANDOM PROCESSES; WEB SERVICES;

DEGREE DISTRIBUTION; POWER LAW; PROBABILITY MATRICES;

GRAPH THEORY;

EID: 38149139509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77004-6_14     Document Type: Conference Paper

References (13)

1. Arcaute, E., Chen, N., Kumar, R., Liben-Nowell, D., Mahdian, M., Nazerzadeh, H., Xu, Y.: Searchability in random graphs. In: Proceedings of the 5th Workshop on Algorithms and Models for the Web-Graph (2007)
2. Bollobás, B.: The diameter of random graphs. IEEE Trans. Inform. Theory 36(2), 285-288 (1990)
3. Chung, F., Lu, L.: The diameter of random sparse graphs. Advances in Applied Math. 26, 257-279 (2001)
4. Erdös, P., Rényi, A.: On random graphs I. Publications Mathematics, Debrecen 6, 290-297 (1959)
5. Karger, D., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43(4) (1996)
6. Klee, V., Larmann, D.: Diameters of random graphs. Canad. J. Math. 33, 618-640 (1981)
7. Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)
8. Kleinberg, J.: Small-world phenomena and the dynamics of information. In: NIPS 2001. Advances in Neural Information Processing Systems (2001)
9. Kleinberg, J.: Complex networks and decentralized search algorithms. In: ICM 2006. Proc. the International Congress of Mathematicians (2006)
10. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, Springer, Heidelberg (2005)
11. Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using kronecker multiplication. In: ICML 2007. International Conference on Machine Learning (2007)
12. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)
13. Mahdian, M., Xu, Y.: Stochastic kronecker graphs. Technical Report (2007)