Ergodic and mixing random walks on locally compact groups
โ Scribed by Joseph Rosenblatt
- Publisher
- Springer
- Year
- 1981
- Tongue
- English
- Weight
- 697 KB
- Volume
- 257
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be a finite group and E a generating set for G. Let P be a probability measure on G whose support is E. We define a random walk on G as follows. At the zeroth stage, we set w 0 =1. At the k th stage, we set w k =w k&1 x, where x # E is chosen with probability P(x). For g # G, the probability t
The Green function of an arbitrary, finitely supported random walk on a discrete group with context-free word problem is algebraic. It is shown how this theorem can be deduced from basic results of formal language theory. Context-free groups are precisely the finite extensions of free groups.