A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph

DOI10.1214/12-AAP848zbMath1278.60048arXiv1005.4390MaRDI QIDQ1948698

Larry Goldstein

Publication date: 24 April 2013

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Stein's methodrandom graphBerry-Esseen boundssize bias couplings

Mathematics Subject Classification ID

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

Related Items (7)

Moderate deviations via cumulants ⋮ Discretized normal approximation by Stein's method ⋮ Local limit theorems for occupancy models ⋮ A simplified second-order Gaussian Poincaré inequality in discrete setting with applications ⋮ Error bounds in local limit theorems using Stein's method ⋮ Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models ⋮ Stein's method via induction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• Normal approximation for coverage models over binomial point processes
• A central limit theorem for decomposable random variables with applications to random graphs
• Normal approximation under local dependence.
• A Berry-Esseen bound for the lightbulb process
• On the number of vertices of given degree in a random graph
• Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
• Normal Approximation by Stein’s Method
• An estimate of the remainder in a combinatorial central limit theorem
• Poisson convergence and semi-induced properties of random graphs
• Multivariate normal approximations by Stein's method and size bias couplings
• Moment Recurrence Relations for Binomial, Poisson and Hypergeometric Frequency Distributions

This page was built for publication: A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph