Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.