Ising model on trees and factors of IID
From MaRDI portal
Publication:2071790
DOI10.1007/s00220-021-04260-2zbMath1490.60280arXiv2012.09484OpenAlexW4206301619MaRDI QIDQ2071790
Danny Nam, Allan Sly, Lingfu Zhang
Publication date: 31 January 2022
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.09484
Random graphs (graph-theoretic aspects) (05C80) 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)
Related Items (4)
Proper -colorings of are Bernoulli ⋮ A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels ⋮ Continuity of the Ising phase transition on nonamenable groups ⋮ Random interlacement is a factor of i.i.d.
Cites Work
- Unnamed Item
- Stationary map coloring
- Perfect matchings as IID factors on non-amenable groups
- Poisson splitting by factors
- The weak limit of Ising models on locally tree-like graphs
- Finitely dependent processes are finitary
- Finitary codings for spatial mixing Markov random fields
- Poisson matching
- Ising models on locally tree-like graphs
- A measure-conjugacy invariant for free group actions
- Entropy and isomorphism theorems for actions of amenable groups
- Information flow on trees
- The Ising model and percolation on trees and tree-like graphs
- Reconstruction on trees: Beating the second eigenvalue
- Broadcasting on trees and the Ising model.
- Local algorithms for independent sets are half-optimal
- A short proof of the discontinuity of phase transition in the planar random-cluster model with \(q > 4\)
- Bernoulli shifts with the same entropy are isomorphic
- Factors of Bernoulli shifts are Bernoulli shifts
- Invariant colorings of random planar maps
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Information, Physics, and Computation
- Markov chains with exponential return times are finitary
- Generalized Divide and Color models
- Factors of IID on Trees
- Limits of local algorithms over sparse random graphs
This page was built for publication: Ising model on trees and factors of IID