Graph Evolution: Densification and Shrinking Diameters

Authors: Jure Leskovec, Jon Kleinberg, Christos Faloutsos

ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 1(1), 2007
arXiv: physics/0603229v3 - DOI (physics.soc-ph)

Results of the summarizing process for the arXiv paper: physics/0603229v3

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
In their study titled "Graph Evolution: Densification and Shrinking Diameters," authors Jure Leskovec, Jon Kleinberg, and Christos Faloutsos explore the evolution of real graphs over time. They focus on growth patterns in social, technological, and information networks to gain a better understanding of how these networks change over extended periods. Previous research has identified static graph properties such as heavy-tailed degree distributions and small-world phenomena. However, there is a lack of information on network evolution. Through an analysis of various real graphs, the authors make several intriguing observations. Firstly, they note that most graphs densify over time as the number of edges increases super-linearly in relation to the number of nodes. This finding challenges conventional wisdom as it suggests that average distances between nodes often decrease over time. This is contrary to expectations that such parameters should increase slowly with the number of nodes. Existing graph generation models do not adequately capture these evolving behaviors. To address this gap, the authors introduce a new graph generator based on a "forest fire" spreading process. This model offers a simple and intuitive explanation for network evolution by requiring minimal parameters like node flammability. Importantly, graphs generated using this approach exhibit a wide range of properties observed in prior studies and the current investigation. Furthermore, the authors highlight a sharp transition in the "forest fire" model between sparse graphs and densifying ones. They find that graphs with decreasing distances between nodes are generated around this transition point. Overall, this study sheds light on how real-world networks evolve over time and provides valuable insights into their changing structures and dynamics.
AI-generated keywords: Graph Evolution Densification Shrinking Diameters Real Graphs Network Evolution

AI-generated Key Points

  • Study titled "Graph Evolution: Densification and Shrinking Diameters" by Jure Leskovec, Jon Kleinberg, and Christos Faloutsos
  • Focus on growth patterns in social, technological, and information networks
  • Most graphs densify over time as the number of edges increases super-linearly in relation to the number of nodes
  • Introduction of a new graph generator based on a "forest fire" spreading process
  • Graphs generated using this approach exhibit properties observed in prior studies
  • Sharp transition in the "forest fire" model between sparse graphs and densifying ones
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

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. 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.

Submitted to arXiv on 27 Mar. 2006

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.