Random walks on the triangular prism and other vertex-transitive graphs

DOI10.1016/0377-0427(86)90229-3zbMath0592.05041OpenAlexW2031250548MaRDI QIDQ1075340

A. R. D. van Slijpe

Publication date: 1986

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(86)90229-3

zbMATH Keywords

Markov chainsregular graphvertex-transitive graphmean first-passage matrix

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Paths and cycles (05C38)

Related Items (9)

Random walks on edge transitive graphs ⋮ The expected hitting times for graphs with cutpoints. ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Hitting times for random walks on vertex-transitive graphs ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Random walks on graphs
• Homological Coverings of Graphs
• Finite Continuous Time Markov Chains
• RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Random walks on the triangular prism and other vertex-transitive graphs