English

Random walks on solvable matrix groups

Probability 2017-08-25 v2

Abstract

We define matrix groups FGn(P)FG_n(P) for each natural number nn and finite set of primes PP, such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson], described the \PF boundary of GLn(Q)GL_n (\mathbb{Q}) for measures of finite first moment with respect to adelic length. We show that adelic length is a word metric estimate on FGn(P)FG_n(P) 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 FGn(P)FG_n(P). We also investigate random walks in the case that PP is a length one sequence. Conditions for pointwise convergence in R\mathbb{R} or Qp\mathbb{Q}_p are given. When these conditions are satisfied, we give path estimates from boundary points, discuss boundary triviality, show that the resulting space is a μ\mu-boundary and give cases where the μ\mu-boundary is the \PF boundary, as conjectured by Kaimanovich.

Keywords

Cite

@article{arxiv.1708.06907,
  title  = {Random walks on solvable matrix groups},
  author = {John J. Harrison},
  journal= {arXiv preprint arXiv:1708.06907},
  year   = {2017}
}
R2 v1 2026-06-22T21:21:26.764Z