Descending chains, the lilypond model, and mutual-nearest-neighbour matching

DOI10.1239/AAP/1127483738zbMATH Open1078.60038OpenAlexW2060666409MaRDI QIDQ5697193FDOQ5697193

Authors: D. J. Daley, Günter Last 

Publication date: 17 October 2005

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1127483738

Recommendations

• Percolation and limit theory for the poisson lilypond model
• A note on the lilypond model
• Nearest-Neighbour Markov Point Processes and Random Sets
• Long range percolation in stationary point processes
• Two lilypond systems of finite line-segments

zbMATH Keywords

stationaritypoint processespercolationPalm probabilityhard-sphere model

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cites Work

• An introduction to the theory of point processes
• Title not available (Why is that?)
• Random fields
• Title not available (Why is that?)
• Continuum Percolation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of Palm measures via bijective point-shifts
• Nearest neighbor and hard sphere models in continuum percolation
• Poisson trees, succession lines and coalescing random walks
• Trees and matchings from point processes
• Invarianzeigens chaften allgemeiner PALMscher Maße
• Mean characteristics of Gibbsian point processes
• Existence, uniqueness, and algorithmic computation of general lilypond systems
• The volume fraction of a Poisson germ model with maximally non-overlapping spherical grains

Cited In (19)

• Percolation in invariant Poisson graphs with i.i.d. degrees
• First passage percolation on random geometric graphs and an application to shortest-path trees
• Moderate deviations for shortest-path lengths on random segment processes
• Stationary map coloring
• Percolation and limit theory for the poisson lilypond model
• Existence and percolation results for stopped germ-grain models with unbounded velocities
• Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
• Absence of percolation for Poisson outdegree-one graphs
• 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
• Connectivity of random geometric graphs related to minimal spanning forests
• A percolating hard sphere model
• Absence of warm percolation in the very strong reinforcement regime
• Friendly frogs, stable marriage, and the magic of invariance
• Stable matchings in high dimensions via the Poisson-weighted infinite tree
• Minimal matchings of point processes
• Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation

This page was built for publication: Descending chains, the lilypond model, and mutual-nearest-neighbour matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5697193)