Correlation Bounds for Distant Parts of Factor of IID Processes
From MaRDI portal
Publication:4601049
DOI10.1017/S0963548317000360zbMath1380.60086arXiv1603.08423OpenAlexW2963150084MaRDI QIDQ4601049
Viktor Harangi, Máté Vizer, Balázs Gerencsér, Agnes Backhausz
Publication date: 19 January 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.08423
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
Related Items (3)
Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. ⋮ Mutual information decay for factors of i.i.d. ⋮ Entropy inequalities for factors of IID
Cites Work
- Finite entropy actions of free groups, rigidity of stabilizers, and a Howe-Moore type phenomenon
- Expansion of random graphs: new proofs, new results
- Perfect matchings as IID factors on non-amenable groups
- A measurable-group-theoretic solution to von Neumann's problem
- Independence ratio and random eigenvectors in transitive graphs
- The ergodic theory of free group actions: entropy and the \(f\)-invariant
- Entropy and isomorphism theorems for actions of amenable groups
- Automorphism invariant measures on trees
- Local algorithms, regular graphs of large girth, and random regular graphs
- Local algorithms for independent sets are half-optimal
- Cutoff for nonbacktracking random walks on sparse random graphs
- Invariant random perfect matchings in Cayley graphs
- Soficity, amenability, and dynamical entropy
- Sofic entropy and amenable groups
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Ramanujan graphings and correlation decay in local algorithms
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- A proof of Alon’s second eigenvalue conjecture and related problems
- On large‐girth regular graphs and random processes on trees
- The non-backtracking spectrum of the universal cover of a graph
- Factor of IID Percolation on Trees
- Factors of IID on Trees
- Amenable actions and almost invariant sets
- Factors of independent and identically distributed processes with non-amenable group actions
- BROOKS’ THEOREM FOR MEASURABLE COLORINGS
- Limits of local algorithms over sparse random graphs
This page was built for publication: Correlation Bounds for Distant Parts of Factor of IID Processes
