English

Expected Depth of Random Walks on Groups

Group Theory 2021-12-21 v2 Probability

Abstract

For GG a finitely generated group and gGg \in G, we say gg is detected by a normal subgroup NGN \lhd G if gNg \notin N. The depth DG(g)D_G(g) of gg is the lowest index of a normal, finite index subgroup NN that detects gg. In this paper we study the expected depth, E[DG(Xn)]\mathbb E[D_G(X_n)], where XnX_n is a random walk on GG. We give several criteria that imply that E[DG(Xn)]n2+k21[G:Λk],\mathbb E[D_G(X_n)] \xrightarrow[n\to \infty]{} 2 + \sum_{k \geq 2}\frac{1}{[G:\Lambda_k]}\, , where Λk\Lambda_k is the intersection of all normal subgroups of index at most kk. In particular, the equality holds in the class of all nilpotent groups and in the class of all linear groups satisfying Kazhdan Property (T)(T). We explain how the right-hand side above appears as a natural limit and also give an example where the convergence does not hold.

Keywords

Cite

@article{arxiv.1610.00198,
  title  = {Expected Depth of Random Walks on Groups},
  author = {Khalid bou-Rabee and Ioan Manolescu and Aglaia Myropolska},
  journal= {arXiv preprint arXiv:1610.00198},
  year   = {2021}
}

Comments

14 pages

R2 v1 2026-06-22T16:07:45.673Z