Abstract
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This model simultaneously captures several well-known properties of real-world networks; in particular, it gives rise to a heavy-tailed degree distribution, has a low diameter, and obeys the densification power law. Most properties of Kronecker products of graphs (such as connectivity and diameter) are only rigorously analyzed in the deterministic case. In this paper, we study the basic properties of stochastic Kronecker products based on an initiator matrix of size two (which is the case that is shown to provide the best fit to many real-world networks). We will show a phase transition for the emergence of the giant component and another phase transition for connectivity, and prove that such graphs have constant diameters beyond the connectivity threshold, but are not searchable using a decentralized algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bollobás, B.: The diameter of random graphs. IEEE Trans. Inform. Theory 36(2), 285–288 (1990)
Chung, F., Lu, L.: The diameter of random sparse graphs. Advances in Applied Math. 26, 257–279 (2001)
Erdös, P., Rényi, A.: On random graphs I. Publications Mathematics, Debrecen 6, 290–297 (1959)
Karger, D., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43(4) (1996)
Klee, V., Larmann, D.: Diameters of random graphs. Canad. J. Math. 33, 618–640 (1981)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)
Kleinberg, J.: Small-world phenomena and the dynamics of information. In: NIPS 2001. Advances in Neural Information Processing Systems (2001)
Kleinberg, J.: Complex networks and decentralized search algorithms. In: ICM 2006. Proc. the International Congress of Mathematicians (2006)
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)
Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using kronecker multiplication. In: ICML 2007. International Conference on Machine Learning (2007)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)
Mahdian, M., Xu, Y.: Stochastic kronecker graphs. Technical Report (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahdian, M., Xu, Y. (2007). Stochastic Kronecker Graphs. In: Bonato, A., Chung, F.R.K. (eds) Algorithms and Models for the Web-Graph. WAW 2007. Lecture Notes in Computer Science, vol 4863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77004-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77004-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77003-9
Online ISBN: 978-3-540-77004-6
eBook Packages: Computer ScienceComputer Science (R0)