𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Einstein Relation for Random Walks on Graphs

✍ Scribed by András Telcs

Publisher
Springer
Year
2006
Tongue
English
Weight
185 KB
Volume
122
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks on random simple graphs
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 edge transitive graphs
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 systems on complete graphs
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