[论文解读] Graphs Over Time: Densification and Shrinking Diameters

Jure Leskovec, Jon Kleinberg+1 more|arXiv (Cornell University)|Mar 27, 2006

Complex Network Analysis Techniques被引用 6

一句话总结

本文指出，现实世界中的图（如社交网络和技术网络）随时间推移呈现密集化趋势，边数相对于节点数呈超线性增长，同时平均节点距离缩小——这与预期的缓慢增长相反。本文提出一种名为“森林火灾”的图生成器，这是一种基于传播过程的简单、参数化模型，能够复现这些动态模式，并揭示稀疏与密集化状态之间的明显相变，将密集化与度分布的演化联系起来。

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

研究动机与目标

• 理解现实世界图的长期演化，特别是密集化和节点距离的变化。
• 识别在静态图分析中被忽视的网络演化中的持久结构模式。
• 开发一种生成模型，以捕捉真实网络的动态行为，包括密集化和直径缩小。
• 探讨密集化与度分布随时间演化的关联。
• 解释为何现有图生成模型无法复现观察到的网络动态。

提出的方法

• 提出一种‘森林火灾’模型，其中节点被点燃并以固定可燃性参数向邻居传播，通过传播过程模拟网络增长。
• 采用随机过程，每个新节点连接到现有节点的一个随机子集，随后这些节点‘燃烧’并连接到其邻居，产生级联效应。
• 使用单一关键参数——可燃性，以控制传播过程的范围，从而在稀疏图与密集化图之间进行调节。
• 分析不同可燃性值下模型的行为，识别稀疏与密集化状态之间的明显相变。
• 通过边增长速率、平均距离和度分布等指标，将模型输出与真实世界图进行比较。
• 使用对多样化真实图的实证分析，验证模型复现观察到的密集化和直径缩小的能力。

实验结果

研究问题

• RQ1 真实图在边增长和节点连通性方面如何随时间演化？
• RQ2 为何真实网络中节点间的平均距离随时间减少，与理论预期相反？
• RQ3 何种机制可解释真实世界网络中观察到的密集化和直径缩小？
• RQ4 度分布与演化网络中密集化过程有何关联？
• RQ5 能否通过一个简单的生成模型捕捉真实图中观察到的复杂动态行为？

主要发现

• 真实世界图表现出超线性密集化，即边数的增长速度快于节点数的线性增长。
• 尽管图的规模不断扩大，真实图中节点间的平均距离仍随时间趋于缩小，这与传统的 O(log n) 或 O(log log n) 增长预期相悖。
• ‘森林火灾’模型成功复现了密集化和直径缩小，且在临界可燃性阈值附近，稀疏与密集化状态之间存在明显的相变。
• 模型行为对可燃性参数极为敏感，密集化图恰好在相变点出现。
• 密集化与度分布形状之间存在根本性关联，这在真实网络中已被观察到。
• 现有图生成模型无法复现观察到的时序动态，特别是直径缩小和超线性边增长。