Percolation and limit theory for the poisson lilypond model
DOI10.1002/RSA.20410zbMATH Open1267.60107arXiv1008.0769OpenAlexW2144777487MaRDI QIDQ4909202FDOQ4909202
Authors: 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
Recommendations
- A note on the lilypond model
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- On a class of growth-maximal hardcore processes
- A one-dimensional Poisson growth model with non-overlapping intervals.
- How many processes have Poisson counts?
- On a Class of Models of Stochastic Geometry Constructed by Random Measures
- Random lattices in the wild: from Pólya's orchard to quantum oscillators
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Central limit theorems for some graphs in computational geometry.
- Random Geometric Graphs
- Percolation
- Gaussian limits for random geometric measures
- Random parking, sequential adsorption, and the jamming limit
- Stopping sets: Gamma-type results and hitting properties
- Gaussian limits for multidimensional random sequential packing at saturation
- Gamma distributions for stationary Poisson flat processes
- Nearest neighbor and hard sphere models in continuum percolation
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- Existence, uniqueness, and algorithmic computation of general lilypond systems
- The volume fraction of a Poisson germ model with maximally non-overlapping spherical grains
- A one-dimensional Poisson growth model with non-overlapping intervals.
- A percolating hard sphere model
Cited In (14)
- Existence, uniqueness, and algorithmic computation of general lilypond systems
- A note on the lilypond model
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- Absence of percolation for Poisson outdegree-one graphs
- Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
- Optimal stationary markings
- On the absence of percolation in a line-segment based lilypond model
- Iterated Gilbert mosaics
- Stationary Apollonian packings
- On a class of growth-maximal hardcore processes
- Title not available (Why is that?)
- Central limit theorems for the radial spanning tree
- Two lilypond systems of finite line-segments
- Normal approximation for statistics of Gibbsian input in geometric probability
This page was built for publication: Percolation and limit theory for the poisson lilypond model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909202)