One-dependent coloring by finitary factors
From MaRDI portal
Publication:2357268
DOI10.1214/15-AIHP735zbMath1370.60061arXiv1411.1463OpenAlexW2962899242MaRDI QIDQ2357268
Publication date: 13 June 2017
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/1411.1463
Stationary stochastic processes (60G10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Related Items (8)
Mallows permutations and finite dependence ⋮ One-dependent colorings of the star graph ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 ⋮ FINITELY DEPENDENT COLORING ⋮ Finitely dependent cycle coloring ⋮ Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma ⋮ Finitely dependent processes are finitary ⋮ Finitary codings for spatial mixing Markov random fields
This page was built for publication: One-dependent coloring by finitary factors