✦ LIBER ✦

Random Walks on graphs, electric networks and fractals

✍ Scribed by A. Telcs

Publisher: Springer
Year: 1989
Tongue: English
Weight: 575 KB
Volume: 82
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00339997

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fractals meet fractals: self-avoiding ra

Fractals meet fractals: self-avoiding random walks on percolation clusters

✍ Viktoria Blavatska; Wolfhard Janke 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 283 KB

The scaling behavior of linear polymers in disordered media, modelled by self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by numerical simulations. We apply the pruned-enriched Rosenbluth chain-growth method (PERM). Our numerical results

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

Multifractality of random walks and loca

Multifractality of random walks and localized excitations on linear random fractals

✍ H.Eduardo Roman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Biased random walks on resource network

Biased random walks on resource network graphs for

✍ M. Randles; O. Abu-Rahmeh; P. Johnson; A. Taleb-Bendiab 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 888 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.