Normal approximation for coverage models over binomial point processes
From MaRDI portal
Publication:968780
DOI10.1214/09-AAP634zbMATH Open1200.60014arXiv0812.3084MaRDI QIDQ968780FDOQ968780
Mathew D. Penrose, Larry Goldstein
Publication date: 6 May 2010
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Abstract: We give error bounds which demonstrate optimal rates of convergence in the CLT for the total covered volume and the number of isolated shapes, for germ-grain models with fixed grain radius over a binomial point process of points in a toroidal spatial region of volume . The proof is based on Stein's method via size-biased couplings.
Full work available at URL: https://arxiv.org/abs/0812.3084
Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Approximations to statistical distributions (nonasymptotic) (62E17)
Cites Work
- Central limit theorems for some graphs in computational geometry.
- Random Geometric Graphs
- Sphere packings. (Edited by John Talbot)
- Gaussian limits for random geometric measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new method of normal approximation
- Multivariate normal approximations by Stein's method and size bias couplings
- Normal approximation under local dependence.
- Title not available (Why is that?)
- Statistics of the Boolean model for practitioners and mathematicians
- On central limit theorems in geometrical probability
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Title not available (Why is that?)
- A central limit theorem for exchangeable variates with geometric applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The random volume of interpenetrating spheres in space
Cited In (13)
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- Size bias for one and all
- Bounds to the normal for proximity region graphs
- Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes
- Non uniform exponential bounds on normal approximation by Stein’s method and monotone size bias couplings
- Local limit theorems for occupancy models
- Large deviations for the volume of \(k\)-nearest neighbor balls
- Vector-valued statistics of binomial processes: Berry-Esseen bounds in the convex distance
- Poisson process approximation under stabilization and Palm coupling
- Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior
- A Berry-Esseen bound for the lightbulb process
- 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
Recommendations
This page was built for publication: Normal approximation for coverage models over binomial point processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968780)