Limit theorems in preferential attachment random graphs

Please use this identifier to cite or link to this item:
Open Access logo originally created by the Public Library of Science (PLoS)
Title: Limit theorems in preferential attachment random graphs
Authors: Betken, Carina
Thesis advisor: Prof. Dr. Hanna Döring
Thesis referee: Prof. Dr. Adrian Röllin
Abstract: We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a (sub-)linear function of the indegree of the older vertex at that time. We provide a limit theorem with rates of convergence for the distribution of a vertex, chosen uniformly at random, as the number of vertices tends to infinity. To do so, we develop Stein's method for a new class of limting distributions including power-laws. Similar, but slightly weaker results are shown to be deducible using coupling techniques. Concentrating on a specific preferential attachment model we also show that the outdegree distribution asymptotically follows a Poisson law. In addition, we deduce a central limit theorem for the number of isolated vertices. We thereto construct a size-bias coupling which in combination with Stein’s method also yields bounds on the distributional distance.
Subject Keywords: preferential attachment random graphs; Stein's method; limiting distribution; rates of convergence; coupling; power-law distribution
Issue Date: 17-May-2019
License name: Attribution 3.0 Germany
License url:
Type of publication: Dissertation oder Habilitation [doctoralThesis]
Appears in Collections:FB06 - E-Dissertationen

Files in This Item:
File Description SizeFormat 
thesis_betken.pdfPräsentationsformat1,42 MBAdobe PDF

This item is licensed under a Creative Commons License Creative Commons