Stationary map coloring

DOI10.1214/10-AIHP399zbMath1258.60015arXiv0905.2563MaRDI QIDQ424689

Omer Angel, Itai Benjamini, Tom Meyerovitch, Ori Gurel-Gurevich, Ron Peled

Publication date: 4 June 2012

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

percolationgraph coloringplanar graphsPoisson processDelaunay triangulationVoronoi tessellation

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Factors of IID on Trees ⋮ Perfect matchings as IID factors on non-amenable groups ⋮ Ising model on trees and factors of IID ⋮ Finitary codings for spatial mixing Markov random fields

Cites Work

• Unnamed Item
• Phase transitions in gravitational allocation
• Poisson splitting by factors
• Poisson matching
• A stable marriage of Poisson and Lebesgue
• Gravitational allocation to Poisson points
• Set theory. An introduction to independence proofs
• Domination by product measures
• Trees and matchings from point processes
• Poisson thinning by monotone factors
• Connected allocation to Poisson points in \(\mathbb R^{2}\)
• Extra heads and invariant allocations
• The critical probability for random Voronoi percolation in the plane is 1/2
• Deterministic thinning of finite Poisson processes
• Tail Bounds for the Stable Marriage of Poisson and Lebesgue
• Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching

This page was built for publication: Stationary map coloring