Trees and matchings from point processes

DOI10.1214/ECP.V8-1066MaRDI QIDQ1768202zbMATH OpenFDO

Authors A. E. Holroyd, Yuval Peres

Publication date 14 March 2005

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0211455, https://eudml.org/doc/124514

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended tree as a factor graph. This implies that the Poisson points can be given an ordering isomorphic to the usual ordering of the integers in a deterministic isometry-invariant way. For d geq 4 our result answers a question posed by Ferrari, Landim and Thorisson. We prove also that any isometry-invariant ergodic point process of finite intensity in Euclidean or hyperbolic space has a perfect matching as a factor graph provided all the inter-point distances are distinct.

Recommendations

• Tree and grid factors for general point processes
• Geometric properties of Poisson matchings
• Poisson trees, succession lines and coalescing random walks
• Poisson matching
• Poissonian tree constructed from independent Poisson point processes

Cited in

(30)

• Invariant transports of stationary random measures and mass-stationarity
• Matchings in random superpositions of bipartite trees
• On maximal hard-core thinnings of stationary particle processes
• Tree and grid factors for general point processes
• Invariant embeddings of unimodular random planar graphs
• Route lengths in invariant spatial tree networks
• Minimal matchings of point processes
• Absence of warm percolation in the very strong reinforcement regime
• Monotone properties of random geometric graphs have sharp thresholds
• Extra heads and invariant allocations
• Characterization of Palm measures via bijective point-shifts
• Point processes, cost, and the growth of rank in locally compact groups
• Poissonian tree constructed from independent Poisson point processes
• Translation-equivariant matchings of coin flips on \(\mathbb Z^d\)
• The Palm-duality for random subsets of d-dimensional grids
• Harmonic deformation of Delaunay triangulations
• Stationary map coloring
• Invasion percolation on the Poisson-weighted infinite tree
• Connectivity of random geometric graphs related to minimal spanning forests
• Shift-coupling of random rooted graphs and networks
• Factors of IID on trees
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching
• Perfect matchings as IID factors on non-amenable groups
• Poisson splitting by factors
• Percolation in invariant Poisson graphs with i.i.d. degrees
• Geometric properties of Poisson matchings
• Gaboriau's criterion and fixed price one for locally compact groups
• Poisson matching
• Connected spatial networks over random points and a route-length statistic
• Gravitational allocation to Poisson points

This page was built for publication: Trees and matchings from point processes

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