Random walks on edge-transitive graphs. II

DOI10.1016/S0167-7152(98)00241-7MaRDI QIDQ1284583zbMATH OpenOpenAlexFDO

Authors José Luis Palacios, José M. 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)

Recommendations

• Random walks on edge transitive graphs
• Hitting times for random walks on vertex-transitive graphs
• scientific article; zbMATH DE number 5629593
• An explicit formula of hitting times for random walks on graphs
• Random walks on highly symmetric graphs

Cites work

• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• Counting pure \(k\)-cycles in sequences of Cayley graphs
• Random walks on edge transitive graphs
• Random walks on highly symmetric graphs
• Vertex and Edge Transitive, but not 1-Transitive, Graphs

Cited in

(17)

• The expected hitting times for graphs with cutpoints.
• Critical density of activated random walks on transitive graphs
• Extremal hitting times of trees with some given parameters
• Some further results on the maximal hitting times of trees with some given parameters
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
• The random walk on directed Kautz graphs
• Expected hitting times for random walks on weak products of graphs
• Chung-Yau invariants and graphs with symmetric hitting times
• Generating functions of waiting times and numbers of visits for random walks on graphs
• Hitting times for random walks on vertex-transitive graphs
• On the average hitting times of \(\operatorname{Cay} (\mathbb{Z}_N, \{+1, +2\})\)
• On the (reverse) cover cost of trees with some given parameters
• scientific article; zbMATH DE number 2067820 (Why is no real title available?)
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Cycle density in infinite Ramanujan graphs
• On the second eigenvalue and random walks in random \(d\)-regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284583)