Finitary coloring
From MaRDI portal
Publication:1681594
DOI10.1214/16-AOP1127zbMath1385.60048arXiv1412.2725OpenAlexW3037316224MaRDI QIDQ1681594
Oded Schramm, Alexander E. Holroyd, David Bruce Wilson
Publication date: 24 November 2017
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.2725
Stationary stochastic processes (60G10) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Coloring of graphs and hypergraphs (05C15)
Related Items
Finitary isomorphisms of renewal point processes and continuous-time regenerative processes, Mallows permutations and finite dependence, What can be sampled locally?, Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics, Uniform even subgraphs and graphical representations of Ising as factors of i.i.d., 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 processes are finitary, Finitary codings for spatial mixing Markov random fields, Local mending, Distributed algorithms for fractional coloring
