Random walks on highly symmetric graphs

DOI10.1007/BF01046092zbMath0711.60068MaRDI QIDQ923511

Amine Sbihi, Luc P. Devroye

Publication date: 1990

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

zbMATH Keywords

hitting timesnearest neighbor random walk on graphsrandom walks on finite graphsvertex-transitive graphs and distance-regular graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Related Items (18)

Some further results on the maximal hitting times of trees with some given parameters ⋮ Covering with blocks in the non-symmetric case ⋮ Quantum operators in classical probability theory. I: ``Quantum spin techniques and the exclusion model of diffusion ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison ⋮ Extremal hitting times of trees with some given parameters ⋮ Random walks on edge transitive graphs ⋮ A collection of results concerning electric resistance and simple random walk on distance-regular graphs ⋮ Cover levels and random interlacements ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ The expected hitting times for graphs with cutpoints. ⋮ The expected hitting times for finite Markov chains ⋮ Expected cover times of random walks on symmetric graphs ⋮ 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 ⋮ Calculating effective resistances on underlying networks of association schemes ⋮ Random walk covering of some special trees

Cites Work

• Unnamed Item
• Unnamed Item
• Covering problems for Markov chains
• Minimization algorithms and random walk on the d-cube
• Covering problems for Brownian motion on spheres
• Some sample path properties of a random walk on the cube
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Hitting times for random walks on vertex-transitive graphs
• On the time taken by random walks on finite groups to visit every state
• Some Extremal Markov Chains

This page was built for publication: Random walks on highly symmetric graphs