Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-23T18:12:36.610Z Has data issue: false hasContentIssue false
  • English
  • Français

Kesten’s theorem for uniformly recurrent subgroups

Part of: Graph theory

Published online by Cambridge University Press:  13 March 2019

MIKOLAJ FRACZYK Open the ORCID record for MIKOLAJ FRACZYK [Opens in a new window]
MIKOLAJ FRACZYK*
Affiliation:
Alfréd Rényi Institute of Mathematics, Reáltanoda utca 13-15, H-1053, Budapest, Hungary email [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove a lower bound on the difference between the spectral radius of the Cayley graph of a group $G$ and the spectral radius of the Schreier graph $H\backslash G$ for any subgroup $H$. As an application, we extend Kesten’s theorem on spectral radii to uniformly recurrent subgroups and give a short proof that the result of Lyons and Peres on cycle density in Ramanujan graphs [Lyons and Peres. Cycle density in infinite Ramanujan graphs. Ann. Probab.43(6) (2015), 3337–3358, Theorem 1.2] holds on average. More precisely, we show that if ${\mathcal{G}}$ is an infinite deterministic Ramanujan graph then the time spent in short cycles by a random trajectory of length $n$ is $o(n)$.

Keywords

group actionstopological dynamicsrandom walks

MSC classification

Primary: 05C81: Random walks on graphs
Type
Original Article
Information
Ergodic Theory and Dynamical Systems , Volume 40 , Issue 10 , October 2020 , pp. 2778 - 2787
Check for updates
Copyright
© Cambridge University Press, 2019

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abert, M., Glasner, Y. and Virag, B.. Kesten’s theorem for invariant random subgroups. Duke Math. J. 163(3) (2014), 465–488.CrossRefGoogle Scholar
Abert, M., Glasner, Y. and Virag, B.. The measurable Kesten theorem. Ann. Probab. 44(3) (2016), 1601–1646.Google Scholar
de la Harpe, P.. Spaces of closed subgroups of locally compact groups. Preprint, 2008, arXiv:0807.2030.Google Scholar
Elek, G.. Uniformly recurrent subgroups and simple C*-algebras. J. Funct. Anal. 274(6) (2018), 1657–1689.CrossRefGoogle Scholar
Glasner, E. and Weiss, B.. Uniformly recurrent subgroups. Recent Trends in Ergodic Theory and Dynamical Systems (Contemporary Mathematics, 631) . American Mathematical Society, Providence, RI, 2015, pp. 63–75.Google Scholar
Jonathan, G.. Every connected regular graph of even degree is a Schreier coset graph. J. Combin. Theory Ser. B 22(3) (1977), 227–232.Google Scholar
Kennedy, M.. An intrinsic characterization of C*-simplicity. Preprint, 2015, arXiv:1509.01870.Google Scholar
Kesten, H.. Full Banach mean values on countable groups. Math. Scand. 7 (1959), 146–156.CrossRefGoogle Scholar
Kesten, H.. Symmetric random walks on groups. Trans. Amer. Math. Soc. (1959), 336–354.CrossRefGoogle Scholar
Le Boudec, A. and Matte Bon, N.. Locally compact groups whose ergodic or minimal actions are all free. Int. Math. Res. Notices , https://doi.org/10.1093/imrn/rny116. Published online 31 May 2018.Google Scholar
Lyons, R. and Peres, Y.. Cycle density in infinite Ramanujan graphs. Ann. Probab. 43(6) (2015), 3337–3358.CrossRefGoogle Scholar
Matte Bon, N. and Tsankov, T.. Realizing uniformly recurrent subgroups. Ergod. Th. & Dynam. Sys. ,https://doi.org/10.1017/etds.2018.47. Published online 10 July 2018.Google Scholar
Serre, J.-P.. Répartition asymptotique des valeurs propres de l’opérateur de Hecke Tp. J. Amer. Math. Soc. (1997), 75–102.Google Scholar