✦ LIBER ✦

Walks on random digraphs

✍ Scribed by B. Goertzel; H. Bowman

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 263 KB
Volume: 9
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(95)00100-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks on trees

✍ Lynn Hauser Pearce 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 267 KB

The classical gambler's ruin problem, i.e., a random walk along a line may be viewed q raph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an i0vestigation of the natural generalization of this problem to that of a particle walking randomly on a tre

Random walks on groups

✍ Lajos Takács 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 874 KB

Random walks on fractals

✍ V. Balakrishnan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 869 KB

Random walks (RWs) and related stochastic techniques have become ubiquitous tools in many areas of physics recently. Fractals are no exception. Random walks on fractals have an added interest: random walk trails (e.g. sample paths of Brownian motion) are themselves fractal in general, and interestin

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

Random walk on a random walk

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

Note on discrete random walks

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