𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random walks on edge-transitive graphs (II)

✍ Scribed by José Luis Palacios; José Miguel Renom; Pedro Berrizbeitia

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
92 KB
Volume
43
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

✦ Synopsis

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 distance-regular graphs. We apply these formulas to a class of Cayley graphs and give explicit values for the expected hitting times.

📜 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 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