Expected Depth of Random Walks on Groups

Abstract

For G a finitely generated group and g ∈ G, we say g is detected by a normal subgroup N G if g N. The depth DG(g) of g is the lowest index of a normal, finite index subgroup N that detects g. In this paper we study the expected depth, E[DG(Xn)], where Xn is a random walk on G. We give several criteria that imply that E[DG(Xn)] [n ∞] 2 + Σk ≥ 21[G:k]\, , where k is the intersection of all normal subgroups of index at most k. In particular, the equality holds in the class of all nilpotent groups and in the class of all linear groups satisfying Kazhdan Property (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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…