通过随机递归树证明小世界现象
Justifying the small-world phenomenon via random recursive trees
摘要:
我们提出了一种新的技术,证明对数上界的直径不断变化的随机图模型,这是基于定义随机图和随机递归树的变种之间的耦合。该技术的优点是三方面的:它是相当简单,并提供了简短的证明,它适用于各种各样的模型,包括那些纳入优先连接,它提供了小常数的界限。我们说明了这一点,证明,为第一次,对数上界的直径以下众所周知的模型:森林火灾模型,复制模型,PageRank为基础的选择模型,Aiello-Chung-Lu模型,广义线性偏好模型,有向无标度图,库珀Frieze模型,和随机无序增加$k$ -树。我们的研究结果揭示了为什么小世界现象在如此多的现实世界的图形中观察到。
英文摘要:
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attachment, and it provides bounds with small constants. We illustrate this by proving, for the first time, logarithmic upper bounds for the diameters of the following well known models: the forest fire model, the copying model, the PageRank-based selection model, the Aiello-Chung-Lu models, the generalized linear preference model, directed scale-free graphs, the Cooper-Frieze model, and random unordered increasing $k$-trees. Our results shed light on why the small-world phenomenon is observed in so many real-world graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。