𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random Walks on Directed Covers of Graphs

✍ Scribed by Lorenz A. Gilch; Sebastian Müller

Publisher
Springer US
Year
2009
Tongue
English
Weight
684 KB
Volume
24
Category
Article
ISSN
0894-9840

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

Computer enumeration of walks on directe
Computer enumeration of walks on directed graphs
✍ K. Balasubramanian 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 526 KB

A vectorized computer code is developed for the enumeration of walks through the matrix power method for directed graphs. Application of this code to several graphs is considered. It is shown that the coefficients in the generating functions for signed graphs are much smaller in magnitude. It is sho

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