





















We study the number of isolated vertices in a preferential attachment random graph introduced by Dereich and Mörters in 2009. In this graph model vertices are added over time and newly arriving vertices connect to older ones with probability proportional to a (sub-)linear function of the indegree of the older vertex at that time. Using Stein's method and a size-bias coupling, we deduce bounds in the Wasserstein distance between the law of the properly rescaled number of isolated vertices and a standard Gaussian distribution.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。