A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels
From MaRDI portal
Publication:6068420
DOI10.1017/etds.2022.14arXiv1111.3067MaRDI QIDQ6068420
Publication date: 15 December 2023
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3067
Stationary stochastic processes (60G10) Percolation (82B43) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Measurable group actions (22F10)
Cites Work
- Unnamed Item
- Finitary codings for spatial mixing Markov random fields
- A measurable-group-theoretic solution to von Neumann's problem
- Ergodic subequivalence relations induced by a Bernoulli action
- Entropy and isomorphism theorems for actions of amenable groups
- Bernoulli schemes of the same entropy are finitarily isomorphic
- Group-invariant percolation on graphs
- On the existence and nonexistence of finitary codings for a class of random fields
- Indistinguishability of percolation clusters
- Local algorithms for independent sets are half-optimal
- Ising model on trees and factors of IID
- Probability on Trees and Networks
- Orbit Equivalence and Measured Group Theory
- Ramanujan graphings and correlation decay in local algorithms
- The Independence Ratio of Regular Graphs
- A BRIEF INTRODUCTION TO SOFIC ENTROPY THEORY
- Finitary Codes, a short survey
- Factors of IID on Trees
