𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random walks on highly symmetric graphs

✍ Scribed by Luc Devroye; Amine Sbihi

Book ID
112469508
Publisher
Springer US
Year
1990
Tongue
English
Weight
620 KB
Volume
3
Category
Article
ISSN
0894-9840

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks and orthogonal functions as
Random walks and orthogonal functions associated with highly symmetric graphs
✍ Peter F. Stadler πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 374 KB

The relationship of orthogonal functions associated with vertex transitive graphs and random walks on such graphs is investigated. We use this relationship to characterize the exponentially decaying autocorrelation functions along random walks on isotropic random fields defined on vertex transitive

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 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
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.