𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random Walks, Bisections and Gossiping in Circulant Graphs

✍ Scribed by Bernard Mans, Igor Shparlinski

Book ID
120910112
Publisher
Springer
Year
2013
Tongue
English
Weight
881 KB
Volume
70
Category
Article
ISSN
0178-4617

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 de Bruijn Graphs.
Random Walks on de Bruijn Graphs.
✍ MΓ³ri, T. F. πŸ“‚ Article πŸ“… 1993 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 368 KB
Random walks and electrical resistances
Random walks and electrical resistances in products of graphs
✍ BΓ©la BollobΓ‘s; Graham Brightwell πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 727 KB

We study random walks and electrical resistances between pairs of vertices in products of graphs. Among the results we prove are the following. ( 1) In a graph G x P, where P is a path with endvertices x and y, and G is any graph, with vertices n and b, the resistance between vertices (a,~) and (b,c