On partial sums of hitting times

DOI10.1016/J.SPL.2011.12.012zbMATH Open1245.05117OpenAlexW2069251215MaRDI QIDQ434720FDOQ434720

José M. Renom, José Luis Palacios

Publication date: 16 July 2012

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

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

zbMATH Keywords

Kirchhoff indexeffective resistance

Mathematics Subject Classification ID

Trees (05C05) Random walks on graphs (05C81)

Cites Work

• Wiener index of trees: Theory and applications
• Sum rules for hitting times of Markov chains
• Random walks on edge transitive graphs
• Bounds on the cover time
• Random Walks on Regular and Irregular Graphs
• On the first passage time of a simple random walk on a tree

Cited In (5)

• An Elementary Proof of the Hitting Time Theorem
• A collection of results concerning electric resistance and simple random walk on distance-regular graphs
• Some more interplay of the three Kirchhoffian indices
• Lower bounds on partial sums of expected hitting times
• A central limit theorem for the mean starting hitting time for a random walk on a random graph

   Recommendations

• Lower bounds on partial sums of expected hitting times 👍 👎
• An explicit formula of hitting times for random walks on graphs 👍 👎
• Expected hitting times for a random walk on a connected graph 👍 👎
• Hitting times for random walks on vertex-transitive graphs 👍 👎
• Bounds on expected hitting times for a random walk on a connected graph 👍 👎

This page was built for publication: On partial sums of hitting times

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