Jure Leskovec
Jon Kleinberg
Christos Faloutsos
ABSTRACT
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include heavy tails for in- and out-degree distributions, communities, small-world phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time.Here we study a wide range of real graphs, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing super-linearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should increase slowly as a function of the number of nodes (like O(log n) or O(log(log n)).Existing graph generation models do not exhibit these types of behavior, even at a qualitative level. We provide a new graph generator, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
- J. Abello, A. L. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. In Proceedings of the 6th Annual European Symposium on Algorithms, pages 332--343. Springer-Verlag, 1998.]] Google Scholar
Digital Library
- J. Abello, P. M. Pardalos, and M. G. C. Resende. Handbook of massive data sets. Kluwer, 2002.]] Google ScholarDigital Library
- R. Albert and A.-L. Barabasi. Emergence of scaling in random networks. Science, pages 509--512, 1999.]]Google Scholar
- R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world-wide web. Nature, 401:130--131, September 1999.]]Google ScholarCross Ref
- Z. Bi, C. Faloutsos, and F. Korn. The dgx distribution for mining massive, skewed data. In KDD, pages 17--26, 2001.]] Google ScholarDigital Library
- B. Bollobas and O. Riordan. The diameter of a scale-free random graph. Combinatorica, 24(1):5--34, 2004.]] Google ScholarDigital Library
- A. Broder, R. Kumar, F. Maghoul, 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.]] Google ScholarDigital Library
- D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.]]Google ScholarCross Ref
- F. Chung and L. Lu. The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences, 99(25):15879--15882, 2002.]]Google ScholarCross Ref
- C. Cooper and A. Frieze. A general model of web graphs. Random Struct. Algorithms, 22(3):311--335, 2003.]] Google ScholarDigital Library
- M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251--262, 1999.]] Google ScholarDigital Library
- J. Gehrke, P. Ginsparg, and J. M. Kleinberg. Overview of the 2003 kdd cup. SIGKDD Explorations, 5(2):149--151, 2003.]] Google ScholarDigital Library
- B. H. Hall, A. B. Jaffe, and M. Trajtenberg. The nber patent citation data file: Lessons, insights and methodological tools. NBER Working Papers 8498, National Bureau of Economic Research, Inc, Oct. 2001.]]Google Scholar
- B. A. Huberman and L. A. Adamic. Growth dynamics of the world-wide web. Nature, 399:131, 1999.]]Google ScholarCross Ref
- J. S. Katz. The self-similar science system. Research Policy, 28:501--517, 1999.]]Google ScholarCross Ref
- J. S. Katz. Scale independent bibliometric indicators. Measurement: Interdisciplinary Research and Perspectives, 3:24--28, 2005.]]Google ScholarCross Ref
- J. M. Kleinberg. Small-world phenomena and the dynamics of information. In Advances in Neural Information Processing Systems 14, 2002.]]Google Scholar
- J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models, and methods. In Proc. International Conference on Combinatorics and Computing, pages 1--17, 1999.]]Google ScholarCross Ref
- R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.]] Google ScholarDigital Library
- R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. In Proceedings of 8th International World Wide Web Conference, 1999.]] Google ScholarDigital Library
- F. Menczer. Growing and navigating the small world web by local content. Proceedings of the National Academy of Sciences, 99(22):14014--14019, 2002.]]Google ScholarCross Ref
- S. Milgram. The small-world problem. Psychology Today, 2:60--67, 1967.]]Google Scholar
- M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions, 2004.]]Google Scholar
- M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167--256, 2003.]]Google ScholarDigital Library
- A. Ntoulas, J. Cho, and C. Olston. What's new on the web? the evolution of the web from a search engine perspective. In WWW Conference, pages 1--12, New York, New York, May 2004.]] Google ScholarDigital Library
- U. of Oregon Route Views Project. Online data and reports. http://www.routeviews.org.]]Google Scholar
- 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.]] Google ScholarDigital Library
- S. Redner. Citation statistics from more than a century of physical review. Technical Report physics/0407137, arXiv, 2004.]]Google Scholar
- M. Schroeder. Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W.H. Freeman and Company, New York, 1991.]]Google Scholar
- D. J. Watts, P. S. Dodds, and M. E. J. Newman. Collective dynamics of 'small-world' networks. Nature, 393:440--442, 1998.]]Google ScholarCross Ref
- D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Science, 296:1302--1305, 2002.]]Google ScholarCross Ref
Index Terms
- Graphs over time: densification laws, shrinking diameters and possible explanations
Recommendations
Graph evolution: Densification and shrinking diameters
How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network or in a very ...
Agwan: a generative model for labelled, weighted graphs
NFMCP'13: Proceedings of the 2nd International Conference on New Frontiers in Mining Complex PatternsReal-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs,...
Same Stats, Different Graphs: (Graph Statistics and Why We Need Graph Drawings)
Graph Drawing and Network VisualizationAbstractData analysts commonly utilize statistics to summarize large datasets. While it is often sufficient to explore only the summary statistics of a dataset (e.g., min/mean/max), Anscombe’s Quartet demonstrates how such statistics can be misleading. We ...
Comments