✦ LIBER ✦

A note on the maximum of a random walk

✍ Scribed by W. Stadje

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 164 KB
Volume: 23
Category: Article
ISSN: 0167-7152
DOI: 10.1016/0167-7152(94)00117-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walk on a random walk

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

A note on the simple random walk in the

A note on the simple random walk in the plane

✍ S.B. Fotopoulos; D.Y. Downham 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A note on a random walk model for textur

A note on a random walk model for texture analysis

✍ Peter de Souza 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Biased random walk on a biased random wa

Biased random walk on a biased random walk

✍ R. Kutner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 329 KB

We consider the random walk of a particle along topologically linear channels under the influence of a uniform drift force. The channels are generated by the usual biased random walk procedure. The resulting mean-and mean-square displacements of a particle are discussed.

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

On the average of a random walk

✍ Karl Grill 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 237 KB