A note on recurrent random walks on 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

Note on discrete random walks

✍ S. Foldes; G. Gabor 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 161 KB

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.

A note on vertex-reinforced random walks

✍ Jack Jie Dai 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A vertex-reinforced random walk on Z with exactly ÿve points in its essential range exhibits the behavior described by Theorem 1.3 of Pemantle and Volkov (Ann. Probab. 27 (1999) 1368) almost surely.

Restricted random walks on a graph

✍ F. Y. Wu; H. Kunz 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 338 KB

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