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
โฆ LIBER โฆ
Boundaries and random walks on finitely generated infinite groups
โ Scribed by Anders Karlsson
- Publisher
- Springer Netherlands
- Year
- 2003
- Tongue
- English
- Weight
- 564 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0004-2080
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Characters and Random Walks on Finite Cl
โ
David Gluck
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 447 KB
Random walks on finite rank solvable gro
โ
Ch. Pittet; L. Saloff-Coste
๐
Article
๐
2003
๐
European Mathematical Society
๐
English
โ 374 KB
On infinite horizon optimal stopping of
โ
Jukka Lempa
๐
Article
๐
2007
๐
Springer
๐
English
โ 248 KB
Context-free languages and random walks
โ
Wolfgang Woess
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 435 KB
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.
Pseudoisotropic random walks on free gro
โ
Michael Voit
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 939 KB
Ergodic and mixing random walks on local
โ
Joseph Rosenblatt
๐
Article
๐
1981
๐
Springer
๐
English
โ 697 KB