✦ LIBER ✦

Cutoff phenomenon for random walks on Kneser graphs

✍ Scribed by Pourmiri, Ali; Sauerwald, Thomas

Book ID: 122120790
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 336 KB
Volume: 176
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.04.015

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

Restricted random walks on graphs

✍ Milan Randić 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 466 KB

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.