Hitting times for random walks on vertex-transitive graphs

DOI10.1017/S0305004100068079zbMath0668.05043MaRDI QIDQ3820630

David J. Aldous

Publication date: 1989

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

random walkshitting timefinite graphsvertex-transitive graphs

Mathematics Subject Classification ID

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

Related Items (22)

Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance ⋮ Threshold limits for cover times ⋮ Stochastic forms of non-negative matrices and Perron-regularity ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ Random walks on edge transitive graphs ⋮ Random Lights Out processes on graphs ⋮ Hitting times for random walks on tricyclic graphs ⋮ A spectral characterization for concentration of the cover time ⋮ The expected hitting times for graphs with cutpoints. ⋮ Random walks on highly symmetric graphs ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Laplace eigenvalues of graphs---a survey ⋮ Intermediate range migration in the two-dimensional stepping stone model ⋮ 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 ⋮ The hitting times of random walks on bicyclic graphs ⋮ Random walks on a finite graph with congestion points ⋮ Continuous Time Markov Processes on Graphs ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ The hitting time of random walk on unicyclic graphs

Cites Work

• Random shuffles and group representations
• Isoperimetric inequalities and Markov chains
• Random walks on the triangular prism and other vertex-transitive graphs
• Markov chains with almost exponential hitting times
• Probability approximations via the Poisson clumping heuristic
• Random walks on graphs
• Markov chain models - rarity and exponentiality
• Bounds on the cover time
• An introduction to covering problems for random walks on graphs
• Random flights on regular graphs
• Finite Continuous Time Markov Chains
• Les fonctions sphériques d'un couple de Gelfand symétrique et les chaînes de Markov
• Occupation measures for Markov chains
• Algebraic Graph Theory

This page was built for publication: Hitting times for random walks on vertex-transitive graphs