Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution

DOI10.1239/aap/1377868543zbMath1273.05205arXiv1208.1558OpenAlexW2963364593MaRDI QIDQ2856041

Nathan Ross

Publication date: 23 October 2013

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1558

zbMATH Keywords

Stein's methodnegative binomial distributionrandom graphpower lawpreferential attachmentdistributional transformation

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items

SOME NEW BOUNDS AND APPROXIMATIONS ON TAIL PROBABILITIES OF THE POISSON AND OTHER DISCRETE DISTRIBUTIONS ⋮ Consistency of Hill estimators in a linear preferential attachment model ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ Pólya urns with immigration at random times ⋮ A scaling limit for the degree distribution in sublinear preferential attachment schemes ⋮ Generalized gamma approximation with rates for urns, walks and trees ⋮ Nonstandard regular variation of in-degree and out-degree in the preferential attachment model ⋮ Fluctuations in a general preferential attachment model via Stein's method ⋮ Joint degree distributions of preferential attachment random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• An expansion for self-interacting random walks
• Stein's method and the zero bias transformation with application to simple random sampling
• Popularity based random graph models leading to a scale-free degree sequence
• Stein's method and birth-death processes
• Degree asymptotics with rates for preferential attachment random graphs
• Total variation error bounds for geometric approximation
• Negative binomial approximation with Stein's method
• New rates for exponential approximation and the theorems of Rényi and Yaglom
• Exact Kolmogorov and total variation distances between some familiar discrete distributions
• BOUNDS ON TAIL PROBABILITIES OF DISCRETE DISTRIBUTIONS
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• The degree sequences and spectra of scale-free random graphs
• Normal Approximation by Stein’s Method
• The Maximum Degree of the Barabási–Albert Random Tree
• Stein's method for geometric approximation
• Archimedes, Gauss, and Stein
• Random trees and general branching processes