Graph Evolution: Densification and Shrinking Diameters
Jure Leskovec, Jon Kleinberg, Christos Faloutsos

TL;DR
This paper investigates the evolution of real-world graphs, revealing densification and shrinking diameters over time, and introduces a simple forest fire model that replicates these phenomena and transitions.
Contribution
It provides the first comprehensive analysis of long-term graph evolution patterns and introduces a new forest fire model capturing these behaviors.
Findings
Most graphs densify over time with super-linear edge growth.
Average node distances often decrease, contrary to traditional expectations.
The forest fire model reproduces observed properties and transition behaviors.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Graph Theory and Algorithms · Data Visualization and Analytics
