✦ LIBER ✦

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

✍ Scribed by A.R.D. van Slijpe

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 703 KB
Volume: 15
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(86)90229-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is

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

Asymptotic Behavior of the Transition Pr

Asymptotic Behavior of the Transition Probability of a Random Walk on an Infinite Graph

✍ Motoko Kotani; Tomoyuki Shirai; Toshikazu Sunada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Ideas cultivated in spectral geometry are applied to obtain an asymptotic property of a reversible random walk on an infinite graph satisfying a certain periodic condition. In the course of our argument, we employ perturbation theory for the maximal eigenvalues of twisted transition operator. As a r