Expected hitting time estimates on finite graphs

DOI10.1016/J.SPA.2025.104626MaRDI QIDQ6987922zbMATH OpenFDO

Authors Laurent Saloff-Coste, Yuwen Wang

Publication date 6 May 2025

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.SPA.2025.104626

zbMATH Keywords

finite graphsGreen functionheat kernel estimateshitting timesrandom walks

Mathematics Subject Classification ID

Random walks on graphs (05C81) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites work

• Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
• Characterization of sub‐Gaussian heat kernel estimates on strongly recurrent graphs
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• Discrete Green's functions
• Expected hitting times for a random walk on a connected graph
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• Inequalities for rare events in time-reversible Markov chains. I.
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixing times for random walks on finite lamplighter groups
• Moderate growth and random walk on finite groups
• Nash inequalities for finite Markov chains
• Probability. Theory and examples.
• Random walks and heat kernels on graphs
• Random walks on dual Sierpinski gaskets
• Stability of parabolic Harnack inequalities
• Surprise probabilities in Markov chains
• Theory of resistor networks: the two-point resistance

This page was built for publication: Expected hitting time estimates on finite graphs

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