✦ LIBER ✦

A note on vertex-reinforced random walks

✍ Scribed by Jack Jie Dai

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 195 KB
Volume: 62
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(03)00014-2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A note on the last new vertex visited by

A note on the last new vertex visited by a random walk

✍ Lászlo Lovász; Peter Winkler 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract A “cover tour” of a connected graph __G__ from a vertex __x__ is a random walk that begins at __x__, moves at each step with equal probability to any neighbor of its current vertex, and ends when it has hit every vertex of __G__. The cycle __C__~n~ is well known to have the curious prop

Note on discrete random walks

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

Random walk on a random walk

✍ K.W. Kehr; R. Kutner 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 783 KB

Random walks on the triangular prism and

Random walks on the triangular prism and other vertex-transitive graphs

✍ A.R.D. van Slijpe 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 703 KB

A note on various holding probabilities

A note on various holding probabilities for random lazy random walks on finite groups

✍ Martin Hildebrand 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 101 KB

A note on the maximum of a random walk

✍ W. Stadje 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 164 KB