A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
From MaRDI portal
Publication:1948698
DOI10.1214/12-AAP848zbMath1278.60048arXiv1005.4390MaRDI QIDQ1948698
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
60F05: Central limit and other weak theorems
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
Related Items
Local limit theorems for occupancy models, Moderate deviations via cumulants, Discretized normal approximation by Stein's method, 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, A simplified second-order Gaussian Poincaré inequality in discrete setting with applications
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
