✦ LIBER ✦

Random Walks on Graphs with Regular Volume Growth

✍ Scribed by T. Coulhon; A. Grigoryan

Publisher: Springer
Year: 1998
Tongue: English
Weight: 633 KB
Volume: 8
Category: Article
ISSN: 1016-443X
DOI: 10.1007/s000390050070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Growth Series and Random Walks on Some H

Growth Series and Random Walks on Some Hyperbolic Graphs

✍ Laurent Bartholdi; Tullio G. Ceccherini-Silberstein 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 197 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.

Random walks on diestel-leader graphs

✍ D. Bertacchi 📂 Article 📅 2001 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 825 KB

Random walks systems on complete graphs

✍ Oswaldo S. M. Alves; Elcio Lebensztayn; Fábio P. Machado; Mauricio Z. Martinez 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 108 KB

Rates of convergence of random walk on d

Rates of convergence of random walk on distance regular graphs

✍ Eric David Belsley 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 306 KB