Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
From MaRDI portal
Publication:1700413
DOI10.1214/16-AIHP790zbMath1387.60063arXiv1505.07412OpenAlexW373100479MaRDI QIDQ1700413
Publication date: 5 March 2018
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07412
Related Items
Continuity of the Ising phase transition on nonamenable groups, Suboptimality of local algorithms for a class of max-cut problems, On the almost eigenvectors of random regular graphs, Uniform even subgraphs and graphical representations of Ising as factors of i.i.d., Finite-energy infinite clusters without anchored expansion, Hyper-positive definite functions I: scalar case, branching-type stationary stochastic processes, Entropy and expansion, Typicality and entropy of processes on infinite trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of regular graphs with large girth via local algorithms
- Perfect matchings as IID factors on non-amenable groups
- Reconstruction for the Potts model
- 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
- Spherical functions and harmonic analysis on free groups
- Stationary processes indexed by a homogeneous tree
- Mean quantum percolation
- Broadcasting on trees and the Ising model.
- Local algorithms for independent sets are half-optimal
- Invariant random perfect matchings in Cayley graphs
- Limits of locally-globally convergent graph sequences
- On the estimation of the mean of weakly stationary and polynomial weakly stationary sequences
- Probability on Trees and Networks
- 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
- Borel oracles. An analytical approach to constant-time algorithms
- On large‐girth regular graphs and random processes on trees
- Factors of IID on Trees
- Limits of local algorithms over sparse random graphs