Normal approximation for coverage models over binomial point processes
From MaRDI portal
Publication:968780
DOI10.1214/09-AAP634zbMath1200.60014arXiv0812.3084MaRDI QIDQ968780
Mathew D. Penrose, Larry Goldstein
Publication date: 6 May 2010
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.3084
60D05: Geometric probability and stochastic geometry
60F05: Central limit and other weak theorems
05C80: Random graphs (graph-theoretic aspects)
62E17: Approximations to statistical distributions (nonasymptotic)
Related Items
Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings, A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph, A Berry-Esseen bound for the lightbulb process
Cites Work
- A new method of normal approximation
- On central limit theorems in geometrical probability
- Sphere packings. (Edited by John Talbot)
- Central limit theorems for some graphs in computational geometry.
- Normal approximation under local dependence.
- Gaussian limits for random geometric measures
- A central limit theorem for exchangeable variates with geometric applications
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Random Geometric Graphs
- Multivariate normal approximations by Stein's method and size bias couplings
- The random volume of interpenetrating spheres in space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item