Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
arXiv:1505.07412 · doi:10.1214/16-AIHP790
Abstract
We prove that a measure on is the spectral measure of a factor of i.i.d. process on a vertex-transitive infinite graph if and only if it is absolutely continuous with respect to the spectral measure of the graph. Moreover, we show that the set of spectral measures of factor of i.i.d. processes and that of -limits of factor of i.i.d. processes are the same.
arXiv comment26 pages; proof of Proposition 9 shortened
References in corpus (8)
- Non-backtracking random walks mix faster
- Local algorithms for independent sets are half-optimal
- Invariant Gaussian processes and independent sets on regular graphs of large girth
- Ramanujan graphings and correlation decay in local algorithms
- Independence ratio and random eigenvectors in transitive graphs
- Expanders have a spanning Lipschitz subgraph with large girth
- Invariant random matchings in Cayley graphs
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy