This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou
Return statistics of simple random walks
β Scribed by Peter Kirschenhofer; Helmut Prodinger
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 298 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider simple branching random walk, i.e., a Galton-Watson process in which each particle, as it is created, may randomly perform a unit step to the left or right. We show that for a supercritical BRW, the set of occupied points is eventually an interval. In addition, we give a limit law for t
## Abstract Starβbranched random walks with 3, 4, 6, 8 and 12 arms (the total chainβlength ranging from __N__ = 49 to 1925) have been produced and analysed with respect to their instantaneous shape. The shortβchain behaviour of nonreversal random walk stars (NRRWs) embedded in various lattices is c