Random interlacement is a factor of i.i.d.
From MaRDI portal
Publication:6165199
DOI10.1214/23-ejp950zbMath1528.60093arXiv2208.14545OpenAlexW4367334134MaRDI QIDQ6165199
Sándor Rokob, Márton Borbényi, Balázs Ráth
Publication date: 4 July 2023
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14545
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-dimensional random interlacements and late points for random walks
- Random walks on torus and random interlacements: macroscopic coupling and phase transition
- Topics in occupation times and Gaussian free fields
- Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
- Disconnection, random walks, and random interlacements
- Coupling and Bernoullicity in random-cluster and Potts models
- Finitary codings for spatial mixing Markov random fields
- Compressions and isoperimetric inequalities
- A measurable-group-theoretic solution to von Neumann's problem
- Soft local times and decoupling of random interlacements
- Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
- Vacant set of random interlacements and percolation
- Random walk on a discrete torus and random interlacements
- Interlacement percolation on transient weighted graphs
- Isoperimetric inequalities and Markov chains
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- A class of finitary codes
- Bernoulli schemes of the same entropy are finitarily isomorphic
- Isoperimetricity for groups and manifolds
- On the existence and nonexistence of finitary codings for a class of random fields
- Interlacements and the wired uniform spanning forest
- Uniform spanning forests
- Random interlacements and amenability
- Finitary random interlacements and the Gaboriau-Lyons problem
- Ising model on trees and factors of IID
- Finitary codings for the random-cluster model and other infinite-range monotone models
- Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID
- Finitary coding for the sub-critical Ising model with finite expected coding volume
- Bernoulli shifts with the same entropy are isomorphic
- Evolving sets, mixing and heat kernel bounds
- Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields
- Invariant coupling of determinantal measures on sofic groups
- Probability on Trees and Networks
- Milnor's Problem on the Growth of Groups and its Consequences
- Følner Independence and the amenable Ising model
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli
- GRAPHS WITH POLYNOMIAL GROWTH
- Croissance polynomiale et périodes des fonctions harmoniques
- Finitary codes between Markov processes
- Random Walks on Infinite Graphs and Groups
- Markov chains with exponential return times are finitary
- Generalized Divide and Color models
- Factors of IID on Trees
- An Introduction to Random Interlacements
- The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups
- Equality of critical parameters for percolation of Gaussian free field level sets
- Finitary codings for gradient models and a new graphical representation for the six‐vertex model
This page was built for publication: Random interlacement is a factor of i.i.d.
