Correlation bound for distant parts of factor of IID processes
arXiv:1603.08423
Abstract
We study factor of i.i.d. processes on the -regular tree for . 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 , where 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.
arXiv comment18 pages, 5 figures
References in corpus (10)
- Local algorithms for independent sets are half-optimal
- Expansion of Random Graphs: New Proofs, New Results
- Ramanujan graphings and correlation decay in local algorithms
- Independence ratio and random eigenvectors in transitive graphs
- Weak containment and Rokhlin entropy
- Expanders have a spanning Lipschitz subgraph with large girth
- Independent sets and cuts in large-girth regular graphs
- Invariant random matchings in Cayley graphs
- Factor of iid percolation on trees
- Non-backtracking random walks and a weighted Ihara's theorem