Percolation and limit theory for the poisson lilypond model

DOI10.1002/rsa.20410zbMath1267.60107arXiv1008.0769OpenAlexW2144777487MaRDI QIDQ4909202

Mathew D. Penrose, Günter Last

Publication date: 12 March 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

stabilizationcentral limit theoremPoisson processgrowth modelcontinuum percolationlilypond model

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items

Iterated Gilbert mosaics ⋮ Absence of percolation for Poisson outdegree-one graphs ⋮ Stationary Apollonian packings ⋮ Central limit theorems for the radial spanning tree ⋮ Normal approximation for statistics of Gibbsian input in geometric probability ⋮ Optimal stationary markings ⋮ Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization ⋮ On a Class of Growth-Maximal Hardcore Processes

Cites Work

• Central limit theorems for some graphs in computational geometry.
• A one-dimensional Poisson growth model with non-overlapping intervals.
• Gaussian limits for random geometric measures
• Gaussian limits for multidimensional random sequential packing at saturation
• Existence, uniqueness, and algorithmic computation of general lilypond systems
• Gamma distributions for stationary Poisson flat processes
• A percolating hard sphere model
• Percolation
• Random Geometric Graphs
• Stopping sets: Gamma-type results and hitting properties
• Nearest neighbor and hard sphere models in continuum percolation
• The volume fraction of a Poisson germ model with maximally non-overlapping spherical grains
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching
• Random parking, sequential adsorption, and the jamming limit