On large‐girth regular graphs and random processes on trees

DOI10.1002/rsa.20769zbMath1401.05267arXiv1406.4420OpenAlexW2963998687MaRDI QIDQ4961543

Balázs Szegedy, Agnes Backhausz

Publication date: 25 October 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.4420

zbMATH Keywords

Glauber dynamicsgraphingrandom \(d\)-regular graphfactor of i.i.dlocal-global convergence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (19)

Total domination in regular graphs ⋮ Symmetric Measures, Continuous Networks, and Dynamics ⋮ Factor of IID Percolation on Trees ⋮ Asymptotic bounds on total domination in regular graphs ⋮ Suboptimality of local algorithms for a class of max-cut problems ⋮ On the almost eigenvectors of random regular graphs ⋮ Local Kesten-McKay law for random regular graphs ⋮ Correlation Bounds for Distant Parts of Factor of IID Processes ⋮ Spectral measures of factor of i.i.d. processes on vertex-transitive graphs ⋮ The distribution of sandpile groups of random regular graphs ⋮ Entropy and expansion ⋮ Flows on measurable spaces ⋮ Mutual information decay for factors of i.i.d. ⋮ Entropy inequalities for factors of IID ⋮ Typicality and entropy of processes on infinite trees ⋮ Minimum 2-dominating sets in regular graphs ⋮ Graphop Mean-Field Limits for Kuramoto-Type Models ⋮ Sofic homological invariants and the Weak Pinsker Property ⋮ Action convergence of operators and graphs

This page was built for publication: On large‐girth regular graphs and random processes on trees