The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Graph evolution: Densification and shrinking diameters
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) 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. We also notice that the forest fire model exhibits a sharp transition between sparse graphs and graphs that are densifying. Graphs with decreasing distance between the nodes are generated around this transition point. Last, we analyze the connection between the temporal evolution of the degree distribution and densification of a graph. We find that the two are fundamentally related. We also observe that real networks exhibit this type of relation between densification and the degree distribution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 4×
“wing diameter assumption: The diameter is a slowly growing function of the network size, as in “small world” graphs [6, 11, 38, 50]. For example, the intensively-studied preferential attachment model [5, 40] posits a network in which each new node, when it arrives, attaches to the existing network by a constant number…”
BackgroundInfluentialThe Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Self-citationThe NBER Patent Citation Data File: Lessons, Insights and Methodological Tools
Hall, B., Jaffe, A., & Trajtenberg, M. (2001) · National Bureau of Economic Research · doi:10.3386/w8498 · Cited by 3,507
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 2×
“The motivation for their work comes from the fact that authors [10, 20] reported the increase of the average degree over time on the Web and the Internet.”
BackgroundOn power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Self-citationGraphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Self-citationEmpirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
Self-citationA Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Leskovec, J., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150479 · Cited by 1,170
Self-citationThe NBER Patent Citations Data File: Lessons, Insights and Methodological Tools
Hall, B. H., Jaffe, A. B., & Trajtenberg, M. (2001) · Cited by 1,164
Identity and Search in Social Networks
Watts, D. J., Dodds, P. S., & Newman, M. E. J. (2002) · Science · doi:10.1126/science.1070120 · Cited by 1,052
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
Self-citationTrawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Fractals, chaos, power laws: minutes from an infinite paradise
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2770 · Cited by 811
Stochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Self-citationThe Diameter of a Scale-Free Random Graph
Bollob�s*, B., & Riordan, O. (2004) · Combinatorica · doi:10.1007/s00493-004-0002-2 · Cited by 594
Vázquez, A. (2003) · Physical Review E · doi:10.1103/physreve.67.056104 · Cited by 563
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 519
What's new on the web?: the evolution of the web from a search engine perspective
Ntoulas, A., Cho, J., & Olston, C. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988674 · Cited by 452
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2006) · Proceedings of the 7th ACM conference on Electronic commerce · doi:10.1145/1134707.1134732 · Cited by 391
Self-citationSmall-World Phenomena and the Dynamics of Information
Kleinberg, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0060 · Cited by 382
Self-citationRealistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Leskovec, J., Chakrabarti, D., Kleinberg, J., & Faloutsos, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564126_17 · Cited by 356
Self-citationCooper, C., & Frieze, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10084 · Cited by 344
Evolution of Networks: From Biological Nets to the Internet and WWWPreprint
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · RePEc: Research Papers in Economics · Cited by 330
(2002) · Massive Computing · doi:10.1007/978-1-4615-0005-6 · Cited by 286
Gehrke, J., Ginsparg, P., & Kleinberg, J. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/980972.980992 · Cited by 281
Self-citationLanguage as an evolving word web
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2001.1824 · Cited by 280
Zipf, Power-laws, and Pareto-a ranking tutorial
Adamic, L. A. (2000) · Cited by 277
ANF: a fast and scalable tool for data mining in massive graphs
Palmer, C. R., Gibbons, P. B., & Faloutsos, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775059 · Cited by 266
Self-citationEffect of the accelerating growth of communications networks on their structure
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.025101 · Cited by 209
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · Oxford University Press eBooks · Cited by 190
Krapivsky, P. L., & Redner, S. (2005) · Physical Review E · doi:10.1103/physreve.71.036118 · Cited by 175
The self-similar science system
Katz, J. S. (1999) · Research Policy · doi:10.1016/s0048-7333(99)00010-4 · Cited by 133
A simple conceptual model for the Internet topology
Tauro, S. L., Palmer, C., Siganos, G., & Faloutsos, M. (2002) · Globecom · doi:10.1109/glocom.2001.965863 · Cited by 127
The "DGX" distribution for mining massive, skewed data
Bi, Z., Faloutsos, C., & Korn, F. R. (2001) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502521 · Cited by 118
Self-citationA Functional Approach to External Graph Algorithms
Abello, Buchsbaum, & Westbrook (2002) · Algorithmica · doi:10.1007/s00453-001-0088-5 · Cited by 110
Growing and navigating the small world Web by local content
Menczer, F. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.212348399 · Cited by 110
Citation Statistics From More Than a Century of Physical ReviewPreprint
Redner, S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0407137 · Cited by 102
Scale-Independent Bibliometric Indicators
Katz, J. S. (2005) · Measurement Interdisciplinary Research and Perspectives · doi:10.1207/s15366359mea0301_3 · Cited by 46
Disordered networks generated by recursive searches
Vázquez, A. (2001) · Europhysics Letters (EPL) · doi:10.1209/epl/i2001-00259-y · Cited by 45
Accelerated growth of networks
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Wiley eBooks · doi:10.1002/3527602755.ch14 · Cited by 39
Citation Statistics From More Than a Century of Physical Review
Redner, S. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 28
Abello, J. M. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.03.012 · Cited by 19
Cited by
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Self-citationGraph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Metadata
- Authors
- Leskovec, J., Kleinberg, J., & Faloutsos, C.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2007-03
- Volume
- 1
- Issue
- 1
- Pages
- 2
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2108614537
- Cited by
- 2,461
- References
- 54
- FWCI
- 25.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.