Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication

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

Volumn 3721 LNAI, Issue , 2005, Pages 133-145

  Leskovec, Jurij ^a   Chakrabarti, Deepayan ^a   Kleinberg, Jon ^b   Faloutsos, Christos ^a  

^a Carnegie Mellon University   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE DISTRIBUTION; GRAPH GENERATOR; KRONECKER MULTIPLICATION; MATRIX OPERATION; REAL GRAPHS;

EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; MATRIX ALGEBRA;

GRAPH THEORY;

EID: 33646414177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_17     Document Type: Conference Paper

References (28)

1. R. Albert and A.-L. Barabasi. Emergence of scaling in random networks. Science, pages 509512, 1999.
2. R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002.
3. P. Bak. How nature works: The science of self-organized criticality, Sept. 1996.
4. A.-L. Barabasi, E. Ravasz, and T. Vicsek. Deterministic scale-free networks. Physica A, 299:559-564, 2001.
5. Z. Bi, C. Faloutsos, and F. Korn. The DGX distribution for mining massive, skewed data. In KDD, pages 17-26, 2001.
6. B.M.Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9), December 1988.
7. A. Broder, R. Kumar, F. Maghoull, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In Proceedings of World Wide Web Conference, 2000.
8. J. M. Carlson and J. Doyle. Highly optimized tolerance: a mechanism for power laws in designed systems. Physics Review E, 60(2):1412-1427, 1999.
9. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In SIAM Data Mining, 2004.
10. T. Chow. The Q-spectrum and spanning trees of tensor products of bipartite graphs. Proc. Amer. Math. Soc., 125:3155-3161, 1997.
11. P. Erdos and A. Renyi. On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Acadamy of Science, 5:17-67, 1960.
12. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou. Heuristically optimized trade-offs: A new paradigm for power laws in the internet (extended abstract), 2002.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
14. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc. Natl. Acad. Sci. USA, volume 99, 2002.
15. J. M. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models and methods. In Proceedings of the International Conference on Combinatorics and Computing, 1999.
16. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. VLDB, pages 639-650, 1999.
17. A. N. Langville and W. J. Stewart. The Kronecker product and stochastic automata networks. Journal of Computation and Applied Mathematics, 167:429-447, 2004.
18. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD'05, Chicago, IL, USA, 2005.
19. C. F. V. Loan. The ubiquitous Kronecker product. Journal of Computation and Applied Mathematics, 123:85-100, 2000.
20. M. Mehta. Random Matrices. Academic Press, 2nd edition, 1991.
21. S. Milgram. The small-world problem. Psychology Today, 2:60-67, 1967.
22. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: A fast and scalable tool for data mining in massive graphs. In SIGKDD, Edmonton, AB, Canada, 2002.
23. D. M. Pennock, G.W. Flake, S. Lawrence, E. J. Glover, and C. L. Giles. Winners dont take all: Characterizing the competition for links on the web. Proceedings of the National Academy of Sciences, 99(8):5207-5211, 2002.
24. S. Redner. How popular is your paper? an empirical study of the citation distribution. European Physical Journal B, 4:131-134, 1998.
25. R. Sole and B. Goodwin. Signs of Life: How Complexity Pervades Biology. Perseus Books Group, New York, NY, 2000.
26. S. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the internet topology. In Global Internet, San Antonio, Texas, 2001.
27. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.
28. J. Winick and S. Jamin. Inet-3.0: Internet Topology Generator. Technical Report CSE-TR-456-02, University of Michigan, Ann Arbor, 2002.