Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
From MaRDI portal
Publication:2856041
Abstract: For a family of linear preferential attachment graphs, we provide rates of convergence for the total variation distance between the degree of a randomly chosen vertex and an appropriate power law distribution as the number of vertices tends to infinity. Our proof uses a new formulation of Stein's method for the negative binomial distribution, which stems from a distributional transformation that has the negative binomial distributions as the only fixed points.
Recommendations
- Fluctuations in a general preferential attachment model via Stein's method
- Degree asymptotics with rates for preferential attachment random graphs
- scientific article; zbMATH DE number 5732563
- Degree distribution nearby the origin of a preferential attachment graph
- Joint degree distributions of preferential attachment random graphs
Cites work
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- An expansion for self-interacting random walks
- Archimedes, Gauss, and Stein
- Bounds on tail probabilities of discrete distributions
- Degree asymptotics with rates for preferential attachment random graphs
- Emergence of Scaling in Random Networks
- Exact Kolmogorov and total variation distances between some familiar discrete distributions
- Fundamentals of Stein's method
- Negative binomial approximation with Stein's method
- New rates for exponential approximation and the theorems of Rényi and Yaglom
- Normal Approximation by Stein’s Method
- Popularity based random graph models leading to a scale-free degree sequence
- Random trees and general branching processes
- Stein's method and birth-death processes
- Stein's method and the zero bias transformation with application to simple random sampling
- Stein's method for geometric approximation
- The Maximum Degree of the Barabási–Albert Random Tree
- The degree sequence of a scale-free random graph process
- The degree sequences and spectra of scale-free random graphs
- Total variation error bounds for geometric approximation
Cited in
(12)- Joint degree distributions of preferential attachment random graphs
- Consistency of Hill estimators in a linear preferential attachment model
- Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Scale-free and power law distributions via fixed points and convergence of (thinning and conditioning) transformations
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Degree asymptotics with rates for preferential attachment random graphs
- Generalized gamma approximation with rates for urns, walks and trees
- Fluctuations in a general preferential attachment model via Stein's method
- Tauberian theory for multivariate regularly varying distributions with application to preferential attachment networks
- Some new bounds and approximations on tail probabilities of the Poisson and other discrete distributions
- Pólya urns with immigration at random times
This page was built for publication: Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856041)
