✦ LIBER ✦

Random Walks on de Bruijn Graphs.

✍ Scribed by Móri, T. F.

Book ID: 118226855
Publisher: Society for Industrial and Applied Mathematics
Year: 1993
Tongue: English
Weight: 368 KB
Volume: 37
Category: Article
ISSN: 0040-585X
DOI: 10.1137/1137038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting closed walks in generalized de

Counting closed walks in generalized de Bruijn graphs

✍ Yukio Shibata; Miyuki Shirahata; Shingo Osawa 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 313 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 highly symmetric graphs

✍ Luc Devroye; Amine Sbihi 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 620 KB

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

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.