✦ LIBER ✦

Growth Series and Random Walks on Some Hyperbolic Graphs

✍ Scribed by Laurent Bartholdi; Tullio G. Ceccherini-Silberstein

Publisher: Springer Vienna
Year: 2002
Tongue: English
Weight: 197 KB
Volume: 136
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s006050200043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Walks on Graphs with Regular Volu

Random Walks on Graphs with Regular Volume Growth

✍ T. Coulhon; A. Grigoryan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 633 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

Random Walks on graphs, electric network

Random Walks on graphs, electric networks and fractals

✍ A. Telcs 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 575 KB

Isoperimetric inequalities and random wa

Isoperimetric inequalities and random walks on quotients of graphs and buildings

✍ Enrico Leuzinger 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 French ⚖ 148 KB

Random walks on the triangular prism and

Random walks on the triangular prism and other vertex-transitive graphs

✍ A.R.D. van Slijpe 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 703 KB

On the Mean and Variance of Cover Times

On the Mean and Variance of Cover Times for Random Walks on Graphs

✍ Frank Ball; Bruce Dunham; A Hirschowitz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide