Degree asymptotics with rates for preferential attachment random graphs
From MaRDI portal
Publication:1950267
DOI10.1214/12-AAP868zbMath1271.60019arXiv1108.5236MaRDI QIDQ1950267
Adrian Roellin, Erol A. Peköz, Nathan Ross
Publication date: 10 May 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.5236
Related Items
A Stein characterisation of the generalized hyperbolic distribution, On martingale tail sums in affine two-color urn models with multiple drawings, Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn, A scaling limit for the degree distribution in sublinear preferential attachment schemes, Parametric Stein operators and variance bounds, Approximating dependent rare events, Distributional transformations without orthogonality relations, Generalized gamma approximation with rates for urns, walks and trees, Products of normal, beta and gamma random variables: Stein operators and distributional theory, An algebra of Stein operators, Total variation error bounds for geometric approximation, Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Limit distribution of degrees in random family trees
- Limit theorems for triangular urn schemes
- Moments of gamma type and the Brownian supremum process area
- Stein's method and the zero bias transformation with application to simple random sampling
- Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
- Total variation error bounds for geometric approximation
- Additive properties of the Dufresne laws and their multivariate extension
- New rates for exponential approximation and the theorems of Rényi and Yaglom
- \(L^1\) bounds in normal approximation
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- EXPLOITING THE WAITING TIME PARADOX: APPLICATIONS OF THE SIZE-BIASING TRANSFORMATION
- Normal Approximation by Stein’s Method
- On Gamma Function Inequalities
- LENGTH-BIASING, CHARACTERIZATIONS OF LAWS AND THE MOMENT PROBLEM
- The Structure and Function of Complex Networks
- The Maximum Degree of the Barabási–Albert Random Tree
- Archimedes, Gauss, and Stein
- Values of Mills' Ratio of Area to Bounding Ordinate and of the Normal Probability Integral for Large Values of the Argument
- Probability
