On hitting times of random walks on trees

DOI10.1016/j.spl.2008.07.046zbMath1168.90003OpenAlexW2077636904MaRDI QIDQ1003428

José Luis Palacios

Publication date: 4 March 2009

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2008.07.046

zbMATH Keywords

Random walkElectric networkHitting time

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Some further results on the maximal hitting times of trees with some given parameters ⋮ Birth and death chains on finite trees: computing their stationary distribution and hitting times ⋮ The access time of random walks on trees with given partition ⋮ The Hitting Time of Multiple Random Walks ⋮ Stochastic forms of non-negative matrices and Perron-regularity ⋮ Generating functions of waiting times and numbers of visits for random walks on graphs ⋮ Decomposing hitting times of walks on graphs into simpler ones ⋮ Extremal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Potential distribution on random electrical networks ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ The hitting times of random walks on bicyclic graphs

Cites Work

• Random walks and the effective resistance of networks
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.
• Unnamed Item