✦ LIBER ✦

Biased random walks on resource network graphs for

✍ Scribed by M. Randles; O. Abu-Rahmeh; P. Johnson; A. Taleb-Bendiab

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 888 KB
Volume: 53
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-009-0366-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Biased random walks on directed trees

✍ Christiane Takacs 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 250 KB

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

Biased random walks on Galton–Watson tre

Biased random walks on Galton–Watson trees

✍ Russell Lyons; Robin Pemantle; Yuval Peres 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 250 KB

Random Walks on graphs, electric network

Random Walks on graphs, electric networks and fractals

✍ A. Telcs 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 575 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.