✦ LIBER ✦

Large deviations for hitting times of a random walk in random environment on a strip

✍ Scribed by Zhang, Mei Juan

Book ID: 121560632
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2014
Tongue: English
Weight: 304 KB
Volume: 30
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-014-2683-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quenched large deviations for random wal

Quenched large deviations for random walk in a random environment

✍ Atilla Yilmaz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

Quenched Large Deviations for Multidimen

Quenched Large Deviations for Multidimensional Random Walk in Random Environment with Holding Times

✍ Fukushima, Ryoki; Kubota, Naoki 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 302 KB

Large deviations for random walks in a r

Large deviations for random walks in a random environment

✍ S. R. S. Varadhan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB 👁 1 views

Linear and sub-linear growth and the CLT

Linear and sub-linear growth and the CLT for hitting times of a random walk in random environment on a strip

✍ Ilya Ya. Goldsheid 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 458 KB

Precise large deviation estimates for a

Precise large deviation estimates for a one-dimensional random walk in a random environment

✍ Agoston Pisztora; Tobias Povel; Ofer Zeitouni 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 186 KB

Expected hitting times for a random walk

Expected hitting times for a random walk on a connected graph

✍ Gregory F Lawler 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 297 KB

A random walk on a graph is defined in which a particle moves from one vertex to any adjoining vertex, each with equal probability. The expected number of steps to get from one point to another is considered. It is shown that the maximum expectation for a graph with N vertices is O(N3). It is also s