Random random walks on the integers mod n
โ Scribed by Jack J. Dai; Martin V. Hildebrand
- Book ID
- 104302637
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 380 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we present a method for analyzing a general class of random ## ลฝ . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bound
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