Decomposing hitting times of walks on graphs into simpler ones

DOI10.1007/s11009-015-9455-6zbMath1370.05194OpenAlexW1431200394MaRDI QIDQ2404178

Miguel Del Río, José Luis Palacios

Publication date: 18 September 2017

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-015-9455-6

zbMATH Keywords

unicyclic graphseffective resistancevoltage

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38) Random walks on graphs (05C81)

Related Items

Further results on the expected hitting time, the cover cost and the related invariants of graphs, On the equivalence of cylinder tilings and planar electric networks, Hitting times for random walks on tricyclic graphs, Hitting times for random walks on subdivision and triangulation graphs, Expected hitting times for random walks on quadrilateral graphs and their applications, Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters, The hitting times of random walks on bicyclic graphs, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, The hitting time of random walk on unicyclic graphs, Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• Unnamed Item
• On hitting times of random walks on trees
• Random walks on trees
• Random walks on edge transitive graphs
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs