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
β¦ LIBER β¦
Curious properties of simple random walks
β Scribed by Shelomo I. Ben-Abraham
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 192 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0022-4715
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Random walks on random simple graphs
β
Martin Hildebrand
π
Article
π
1996
π
John Wiley and Sons
π
English
β 676 KB
Return statistics of simple random walks
β
Peter Kirschenhofer; Helmut Prodinger
π
Article
π
1996
π
Elsevier Science
π
English
β 298 KB
Intersection properties of simple random
β
G. Felder; J. FrΓΆhlich
π
Article
π
1985
π
Springer
π
English
β 718 KB
An intersection property of the simple r
β
Xianyin Zhou
π
Article
π
1996
π
Institute of Applied Mathematics, Chinese Academy
π
English
β 724 KB
The range of simple branching random wal
β
Karl Grill
π
Article
π
1996
π
Elsevier Science
π
English
β 202 KB
The range of simple branching random wal
β
Karl Grill
π
Article
π
1996
π
Elsevier Science
π
English
β 202 KB
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