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 superlinearly 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) orO(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 pro-
Citations
|
746
|
On power-law relationships of the internet topology
– Faloutsos, Faloutsos, et al.
- 1999
|
|
679
|
Emergence of Scaling in Random Networks
– Barabási, Albert
- 1999
|
|
641
|
Collective dynamics of small world networks
– Watts, Strogatz
- 1998
|
|
360
|
The structure and function of complex networks
– Newman
- 2003
|
|
355
|
The small world problem
– Milgram
- 1961
|
|
219
|
Trawling the web for emerging cyber-communities
– Kumar, Raghavan, et al.
- 1999
|
|
206
|
The web as a graph: Measurements, models and methods
– Kleinberg, Kumar, et al.
- 1999
|
|
136
|
Stochastic models for the web graph
– Kumar, Raghavan, et al.
- 2000
|
|
99
|
A brief history of generative models for power law and log normal distributions
– Mitzenmacher
- 2001
|
|
89
|
What’s new on the Web? the evolution of the Web from a search engine perspective
– Ntoulas, Cho, et al.
- 2004
|
|
85
|
Graph structure in the web: experiments and models
– Border, Kumar, et al.
|
|
79
|
A functional approach to external graph algorithms
– Abello, Buchsbaum, et al.
- 1998
|
|
70
|
The average distances in random graphs with given expected degrees
– Chung, Lu
- 2002
|
|
70
|
Small-world phenomena and the dynamics of information
– Kleinberg
- 2001
|
|
61
|
A general model of web graphs
– Cooper, Frieze
- 2001
|
|
56
|
ANF: a Fast and Scalable Tool for Data Mining in Massive Graphs
– Palmer, Gibbons, et al.
- 2002
|
|
55
|
The Diameter of a Scale-free Random Graph
– Bollobás, Riordan
|
|
50
|
Identity and search in social networks
– Watts, Dodds, et al.
|
|
43
|
Diameter of world-wide web
– Albert, Jeong, et al.
|
|
33
|
Laws: Minutes From an Infinite Paradise
– Fractals, Power
- 1991
|
|
30
|
RMAT: A recursive model for graph mining
– Chakrabarti, Zhan, et al.
- 2004
|
|
25
|
The DGX distribution for mining massive, skewed data
– Bi, Faloutsos, et al.
- 2001
|
|
23
|
Growth dynamics of the world-wide web
– Huberman, Adamic
- 1999
|
|
19
|
Growing and navigating the small world web by local content
– Menczer
|
|
12
|
The NBER patent citations data file: lessons, insights and methodological tools. NBER Working Paper 8498
– Hall, Jaffe, et al.
|
|
8
|
Citation statistics from more than a century of physical review
– Redner
- 2005
|
|
7
|
Overview of the 2003 kdd cup
– Gehrke, Ginsparg, et al.
- 2003
|
|
7
|
The self-similar science system
– Katz
- 1999
|
|
7
|
Scale independent bibliometric indicators
– Katz
- 2005
|
|
6
|
Handbook of massive data sets
– Abello, Pardalos, et al.
- 2002
|
|
5
|
of Oregon Route Views Project. Online data and reports. http://www.routeviews.org
– unknown authors
|
