Concentration inequalities for maximal displacement of random walks on groups of polynomial growth

Concentration inequalities for maximal displacement of random walks on groups of polynomial growth
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

We prove Gaussian concentration inequalities for maximal displacement of compactly supported random walks on a compactly generated locally compact group with polynomial growth. Concentration inequalities with different exponents hold for non-centred random walks as well, after correction by the drift. When the support of the measure generates a virtually nilpotent group, we provide an effective version of this result. These more refined estimates rely on the existence of a ``quantitative splitting’’ of a virtually simply connected nilpotent group, a result which may be of independent interest. As applications, we deduce that the same concentration inequalities hold for centred random walks on the following classes of groups: amenable connected Lie groups (including non-unimodular ones), polycyclic and more generally finitely generated solvable groups with finite Prüfer rank. This shows in particular that centred random walk are diffusive on such groups. For polycyclic groups, this strengthens and completes partial results previously obtained by Russ Thompson in 2011.


💡 Research Summary

The paper establishes Gaussian‑type concentration inequalities for the maximal displacement of compactly supported random walks on compactly generated locally compact groups of polynomial growth, without assuming symmetry, absolute continuity with respect to Haar measure, or even centering of the step distribution.

The first main result (Theorem 1.1) treats centred walks. For any centred compactly supported probability measure µ on such a group G, there exist constants c₁,c₂>0 such that for every t>0
\


Comments & Academic Discussion

Loading comments...

Leave a Comment