Random walks on solvable matrix groups
Abstract
We define matrix groups for each natural number and finite set of primes , such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson], described the \PF boundary of for measures of finite first moment with respect to adelic length. We show that adelic length is a word metric estimate on by constructing another, intermediate, word metric estimate which can be easily computed from the entries of any matrix in the group. In particular, finite first moment of a probability measure with respect to adelic length is an equivalent condition to requiring finite first moment with respect to word length in . We also investigate random walks in the case that is a length one sequence. Conditions for pointwise convergence in or are given. When these conditions are satisfied, we give path estimates from boundary points, discuss boundary triviality, show that the resulting space is a -boundary and give cases where the -boundary is the \PF boundary, as conjectured by Kaimanovich.
Cite
@article{arxiv.1708.06907,
title = {Random walks on solvable matrix groups},
author = {John J. Harrison},
journal= {arXiv preprint arXiv:1708.06907},
year = {2017}
}