Papers
Topics
Authors
Recent
2000 character limit reached

Random walk on unipotent matrix groups (1512.06304v4)

Published 20 Dec 2015 in math.PR and math.GR

Abstract: We introduce a new method for proving central limit theorems for random walk on nilpotent groups. The method is illustrated in a local central limit theorem on the Heisenberg group, weakening the necessary conditions on the driving measure. As a second illustration, the method is used to study walks on the $n\times n$ uni-upper triangular group with entries taken modulo $p$. The method allows sharp answers to the behavior of individual coordinates: coordinates immediately above the diagonal require order $p2$ steps for randomness, coordinates on the second diagonal require order $p$ steps; coordinates on the $k$th diagonal require order $p{\frac{2}{k}}$ steps.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.