𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-reinforced random walk on one-dimensional periodic graphs

✍ Scribed by Franz Merkl; Silke W. W. Rolles

Publisher
Springer
Year
2008
Tongue
English
Weight
323 KB
Volume
145
Category
Article
ISSN
1432-2064

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks on edge transitive graphs
Random walks on edge transitive graphs
✍ JosΓ©Luis Palacios; JosΓ©Miguel Renom πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 337 KB

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.

Random walks on edge-transitive graphs (
Random walks on edge-transitive graphs (II)
✍ JosΓ© Luis Palacios; JosΓ© Miguel Renom; Pedro Berrizbeitia πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 92 KB

We give formulas, in terms of the number of pure k-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs, extending our prior results for neighboring vertices and also extending results of Devroye-Sbihi and Biggs concerning dis

Random walks on random simple graphs
Random walks on random simple graphs
✍ Martin Hildebrand πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 676 KB

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