Kesten’s theorem for uniformly recurrent subgroups

DOI10.1017/etds.2019.16zbMath1448.05185arXiv1801.09132OpenAlexW2964235724MaRDI QIDQ4970732

Mikołaj Frączyk

Publication date: 7 October 2020

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

random walksgroup actionstopological dynamics

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Paths and cycles (05C38) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (2)

On Benjamini-Schramm limits of congruence subgroups ⋮ Schreier graphs of spinal groups

Cites Work

• The measurable Kesten theorem
• Every connected regular graph of even degree is a Schreier coset graph
• Uniformly recurrent subgroups and simple \(C^{\ast}\)-algebras
• Kesten's theorem for invariant random subgroups.
• Uniformly recurrent subgroups
• Full Banach Mean Values on Countable groups.
• Symmetric Random Walks on Groups
• Subgroup dynamics and $C^\ast$-simplicity of groups of homeomorphisms
• Realizing uniformly recurrent subgroups
• Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝
• Cycle density in infinite Ramanujan graphs

This page was built for publication: Kesten’s theorem for uniformly recurrent subgroups