Random walks on edge-transitive graphs. II

DOI10.1016/S0167-7152(98)00241-7zbMath0942.60030OpenAlexW4232812283MaRDI QIDQ1284583

José Luis Palacios, José Miguel Renom, Pedro Berrizbeitia

Publication date: 31 May 1999

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

Full work available at URL: https://doi.org/10.1016/s0167-7152(98)00241-7

zbMATH Keywords

Cayley graphshitting timesedge-transitive graphs

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Related Items (8)

Some further results on the maximal hitting times of trees with some given parameters ⋮ Generating functions of waiting times and numbers of visits for random walks on graphs ⋮ Extremal hitting times of trees with some given parameters ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ The expected hitting times for graphs with cutpoints. ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Expected hitting times for random walks on weak products of graphs

Cites Work

• Unnamed Item
• Random walks on highly symmetric graphs
• Random walks on edge transitive graphs
• Counting pure \(k\)-cycles in sequences of Cayley graphs
• Vertex and Edge Transitive, but not 1-Transitive, Graphs

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