Random walks on edge transitive graphs

DOI10.1016/S0167-7152(97)00095-3zbMath0901.60044MaRDI QIDQ1382191

José Miguel Renom, José Luis Palacios

Publication date: 24 November 1998

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

effective resistance; edge-transitive graphs; cover times; expected hitting times

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

60K35: Interacting random processes; statistical mechanics type models; percolation theory

Related Items

On partial sums of hitting times, Random walks on edge-transitive graphs. II, Expected hitting times for random walks on weak products of graphs, The expected hitting times for graphs with cutpoints., Extremal cover cost and reverse cover cost of trees with given segment sequence, Decomposing hitting times of walks on graphs into simpler ones

Cites Work

• Unnamed Item
• Unnamed Item
• Covering problems for Markov chains
• Random walks and the effective resistance of networks
• Random walks on highly symmetric graphs
• Random walks on the triangular prism and other vertex-transitive graphs
• Expected cover times of random walks on symmetric graphs
• Random walks on graphs
• On the cover time of random walks on graphs
• On a Result of Aleliunas et al. Concerning Random Walks on Graphs
• Hitting times for random walks on vertex-transitive graphs
• A tight upper bound on the cover time for random walks on graphs
• Regular line-symmetric graphs
• Vertex and Edge Transitive, but not 1-Transitive, Graphs