关于Barabási-Albert随机图的连续时间极限
On the continuous-time limit of the Barabási-Albert random graph
摘要：
我们证明了Barabási-Albert模型通过适当的尺度弱收敛到一组广义Yule模型。为了实现这一目标，我们将其图形结构的一组合适的过程，我们称之为种植模型，我们引入了一个特设的抽样程序。使用所获得的极限过程代表了另一种有利的方式来看待巴拉巴西-阿尔伯特随机图的一些渐近性质。
英文摘要：
We prove that the Barabási-Albert model converges weakly to a set of generalized Yule models via an appropriate scaling. To pursue this aim we superimpose to its graph structure a suitable set of processes that we call the planted model and we introduce an ad-hoc sampling procedure. The use of the obtained limit process represents an alternative and advantageous way of looking at some of the asymptotic properties of the Barabási-Albert random graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
