2000 character limit reached
On Rapid mixing for random walks on nilmanifolds (2510.00398v1)
Published 1 Oct 2025 in math.DS and math.PR
Abstract: We prove rapid mixing for almost all random walks generated by $m$ translations on an arbitrary nilmanifold under mild assumptions on the size of $m$. For several classical classes of nilmanifolds, we show $m=2$ suffices. This provides a partial answer to the question raised in \cite{D02} about the prevalence of rapid mixing for random walks on homogeneous spaces.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.