Correlation bounds for distant parts of factor of IID processes

DOI10.1017/S0963548317000360MaRDI QIDQ4601049zbMATH OpenOpenAlexFDO

Authors Balázs Gerencsér, Viktor Harangi, Máté Vizer, Ágnes 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

zbMATH Keywords

\(d\)-regular treei.i.d. processes

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Abstract: We study factor of i.i.d. processes on the $d$-regular tree for $dgeq3$. We show that if such a process is restricted to two distant connected subgraphs of the tree, then the two parts are basically uncorrelated. More precisely, any functions of the two parts have correlation at most $k(d-1)/(sqrtd-1{)}^k$, where $k$ denotes the distance of the subgraphs. This result can be considered as a quantitative version of the fact that factor of i.i.d. processes have trivial 1-ended tails.

Recommendations

• Mutual information decay for factors of i.i.d.
• Factors of IID on trees
• Factor of iid percolation on trees
• Entropy inequalities for factors of IID
• Finitely dependent processes are finitary

Cites work

• A measurable-group-theoretic solution to von Neumann's problem
• A proof of Alon’s second eigenvalue conjecture and related problems
• Amenable actions and almost invariant sets
• Automorphism invariant measures on trees
• BROOKS’ THEOREM FOR MEASURABLE COLORINGS
• Cutoff for nonbacktracking random walks on sparse random graphs
• Entropy and isomorphism theorems for actions of amenable groups
• Expansion of random graphs: new proofs, new results
• Factor of iid percolation on trees
• Factors of IID on trees
• Factors of independent and identically distributed processes with non-amenable group actions
• Finite entropy actions of free groups, rigidity of stabilizers, and a Howe-Moore type phenomenon
• Independence ratio and random eigenvectors in transitive graphs
• Invariant Gaussian processes and independent sets on regular graphs of large girth
• Invariant random perfect matchings in Cayley graphs
• Limits of local algorithms over sparse random graphs
• Local algorithms for independent sets are half-optimal
• Local algorithms, regular graphs of large girth, and random regular graphs
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• On large‐girth regular graphs and random processes on trees
• Perfect matchings as IID factors on non-amenable groups
• Ramanujan graphings and correlation decay in local algorithms
• Sofic entropy and amenable groups
• Soficity, amenability, and dynamical entropy
• The ergodic theory of free group actions: entropy and the f-invariant
• The non-backtracking spectrum of the universal cover of a graph

Cited in

(6)

• Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
• Mutual information decay for factors of i.i.d.
• Factors of IID on trees
• Factor of iid percolation on trees
• A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels
• Entropy inequalities for factors of IID

This page was built for publication: Correlation bounds for distant parts of factor of IID processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601049)