Random walks on edge transitive graphs

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

José Miguel Renom, José Luis Palacios

Publication date: 24 November 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-7152(97)00095-3

zbMATH Keywords

effective resistanceedge-transitive graphscover timesexpected hitting times

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (8)

Decomposing hitting times of walks on graphs into simpler ones ⋮ On partial sums of hitting times ⋮ The expected hitting times for graphs with cutpoints. ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Random walks on edge-transitive graphs. II ⋮ Expected hitting times for random walks on weak products of graphs

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

This page was built for publication: Random walks on edge transitive graphs