| Autor: |
BACKHAUSZ, ÁGNES, GERENCSÉR, BALÁZS, HARANGI, VIKTOR, VIZER, MÁTÉ |
| Předmět: |
|
| Zdroj: |
Combinatorics, Probability & Computing; Jan2018, Vol. 27 Issue 1, p1-20, 20p |
| Abstrakt: |
We study factor of i.i.d. processes on the d-regular tree for d ≥ 3. 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) / (\sqrt{d-1})^k$, where k denotes the distance between 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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
