An in-depth analysis of stochastic Kronecker graphs

Journal of the ACM

Volumn 60, Issue 2, 2013, Pages

  Seshadhri, C ^a   Pinar, Ali ^a   Kolda, Tamara G ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Graph models; Graph500; R MAT; Stochastic Kronecker graphs (SKG)

Indexed keywords

GRAPH MODEL; GRAPH500; KRONECKER; LOG-NORMAL DISTRIBUTION; MATHEMATICAL ANALYSIS; POWER LAW DISTRIBUTION; R-MAT; REAL-WORLD GRAPHS;

GRAPHIC METHODS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; SUPERCOMPUTERS;

GRAPH THEORY;

EID: 84877889155     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2450142.2450149     Document Type: Conference Paper

References (32)

1. ALVAREZ-HAMELIN, J. I., DALL'ASTA, L., BARRAT, A., AND VESPIGNANI, A. 2008. K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Netw. Hetero. Media 3, 2, 371-393.
2. ANDERSEN, R. AND CHELLAPILLA, K. 2009. Finding dense subgraphs with size bounds. In Algorithms and Models for the Web-Graph, Springer, 25-37.
3. BERRY, A. 1941. The accuracy of the gaussian approximation to the sum of independent variates. Trans. AMS 49, 1, 122-136.
4. BI, Z., FALOUTSOS, C., AND KORN, F. 2001. The "DGX" distribution for mining massive, skewed data. In Proceedings of KDD '01. ACM, 17-26.
5. CARMI, S., HAVLIN, S., KIRKPATRICK, S., SHAVITT, Y., AND SHIR, E. 2007. A model of internet topology using k-shell decomposition. Proc. Nat. Acad. Sci. 104, 27, 11150-11154.
6. CHAKRABARTI, D. AND FALOUTSOS, C. 2006. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38, 1.
7. CHAKRABARTI, D., ZHAN, Y., AND FALOUTSOS, C. 2004. R-MAT: A recursive model for graph mining. In Proceedings of SDM '04. 442-446.
8. CLAUSET, A., SHALIZI, C. R., AND NEWMAN, M. E. J. 2009. Power-law distributions in empirical data. SIAM Rev. 51, 4, 661-703.
9. ESSEEN, C.-G. 1942. A moment inequality with an application to the central limit theorem. Skand. Aktuari-etidskr 39, 160-170.
10. FELLER, W. 1968. An Introduction to Probability Theory and Applications: Vol I. 3rd Ed. Wiley.
11. GIBSON, D., KLEINBERG, J., AND RAGHAVAN, P. 1998. Inferring web communities from link topology. In Proceedings of HYPERTEXT '98. ACM, 225-234.
12. GKANTSIDIS, C., MIHAIL, M., AND ZEGURA, E. W. 2003. Spectral analysis of internet topologies. In Proceedings of INFOCOM 2003. IEEE, 364-374.
13. GOLTSEV, A. V., DOROGOVTSEV, S. N., AND MENDES, J. F. F. 2006. k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects. Phys. Rev. E 73, 5, 056101.
14. GRAPH500 STEERING COMMITTEE. 2010. Graph 500 benchmark. http://www.graph500.org/specifications.
15. GROËR, C., SULLIVAN, B. D., AND POOLE, S. 2011. A mathematical analysis of the R-MAT random graph generator. Networks 58, 3, 159-170.
16. IBRAGIMOV, I. A. 1956. On the composition of unimodal distributions. Theory Probability its App. 1, 2, 255-260.
17. KIM, M. AND LESKOVEC, J. 2010. Multiplicative attribute graph model of real-world networks. arXiv:1009.3499v2.
18. KLEINBERG, J. M. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 5, 604-632.
19. KUMAR, R., NOVAK, J., AND TOMKINS, A. 2010. Structure and evolution of online social networks. In Link Mining: Models, Algorithms, and Applications, Springer, 337-357.
20. LESKOVEC, J., CHAKRABARTI, D., KLEINBERG, J., AND FALOUTSOS, C. 2005. Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In Proceedings of PKDD 2005. Springer, 133-145.
21. LESKOVEC, J., CHAKRABARTI, D., KLEINBERG, J., FALOUTSOS, C., AND GHAHRAMANI, Z. 2010. Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res. 11, 985-1042.
22. LESKOVEC, J. AND FALOUTSOS, C. 2007. Scalable modeling of real graphs using kronecker multiplication. In Proceedings of ICML '07. ACM, 497-504.
23. MAHDIAN, M. AND XU, Y. 2007. Stochastic kronecker graphs. In Algorithms and Models for the Web-Graph, Springer, 179-186.
24. MAHDIAN, M. AND XU, Y. 2011. Stochastic Kronecker graphs. Rand. Struct. Algor. 38, 4, 453-466.
25. MCDIARMID, C. 1989. On the method of bounded differences. Surv. Combinat. 141, 148-188.
26. MILLER, B., BLISS, N., AND WOLFE, P. 2010. Subgraph detection using eigenvector L1 norms. In Proceedings of NIPS 2010. 1633-1641.
27. MITZENMACHER, M. 2003. A brief history of generative models for power law and lognormal distributions. Internet Math. 1, 2, 226-251.
28. MITZENMACHER, M. 2006. The future of power law research. Internet Math. 2, 4, 525-534.
29. MORENO, S., KIRSHNER, S., NEVILLE, J., AND VISHWANATHAN, S. V. N. 2010. Tied Kronecker product graph models to capture variance in network populations. In Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing. 1137-1144.
30. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press.
31. PENNOCK, D., FLAKE, G., LAWRENCE, S., GLOVER, E., AND GILES, C. L. 2002. Winners don't take all: Characterizing the competition for links on the web. Proc. Nat. Acad. Sci. 99, 8, 5207-5211.
32. SALA, A., CAO, L., WILSON, C., ZABLIT, R., ZHENG, H., AND ZHAO, B. Y. 2010. Measurement-calibrated graph models for social network experiments. In Proceedings of WWW '10. ACM, 861-870.