Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
From MaRDI portal
Publication:6126971
DOI10.1214/24-ejp1082arXiv2112.03228OpenAlexW4392113530MaRDI QIDQ6126971
Omer Angel, Yinon Spinka, Gourab Ray
Publication date: 10 April 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.03228
Geometric probability and stochastic geometry (60D05) Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- Unnamed Item
- Wired cycle-breaking dynamics for uniform spanning forests
- Perfect matchings as IID factors on non-amenable groups
- Coupling and Bernoullicity in random-cluster and Potts models
- Finitary codings for spatial mixing Markov random fields
- A measurable-group-theoretic solution to von Neumann's problem
- Minimal spanning forests
- Independence ratio and random eigenvectors in transitive graphs
- A measure-conjugacy invariant for free group actions
- Ends in uniform spanning forests
- The end structure of a graph: Recent results and open problems
- Group-invariant percolation on graphs
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- On the existence and nonexistence of finitary codings for a class of random fields
- Finitary coloring
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Very weak Bernoulli for amenable groups
- Uniform spanning forests
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- A nonamenable ``factor of a Euclidean space
- 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
- Translation-invariant Gibbs states of the Ising model: general setting
- Finitary coding for the sub-critical Ising model with finite expected coding volume
- Random currents and continuity of Ising model's spontaneous magnetization
- One-ended spanning trees in amenable unimodular graphs
- Hyperbolic and parabolic unimodular random maps
- On the double random current nesting field
- Über unendliche Wege in Graphen
- Emergent planarity in two-dimensional Ising models with finite-range interactions
- Processes on unimodular random networks
- Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields
- Invariant coupling of determinantal measures on sofic groups
- Følner Independence and the amenable Ising model
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Correlation Bounds for Distant Parts of Factor of IID Processes
- The Cycle Space of an Infinite Graph
- Mutual information decay for factors of i.i.d.
- Factors of IID on Trees
- The Random-Cluster Model
- Finitary codings for gradient models and a new graphical representation for the six‐vertex model
This page was built for publication: Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.