Decomposing hitting times of walks on graphs into simpler ones

DOI10.1007/S11009-015-9455-6MaRDI QIDQ2404178zbMATH OpenOpenAlexFDO

Authors 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

effective resistanceunicyclic graphsvoltage

Mathematics Subject Classification ID

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

Recommendations

• An explicit formula of hitting times for random walks on graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Hitting times for random walks on vertex-transitive graphs
• The hitting times of random walks on bicyclic graphs
• Hitting times for random walks on tricyclic graphs
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• On the Structure and Computation of Random Walk Times in Finite Graphs
• Maximum hitting time for random walks on graphs
• Bounds on expected hitting times for a random walk on a connected graph
• Hitting times, commute times, and cover times for random walks on random hypergraphs

Cites work

• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• On hitting times of random walks on trees
• Random walks on edge transitive graphs
• Random walks on trees
• The electrical resistance of a graph captures its commute and cover times
• The expected hitting times for graphs with cutpoints.

Cited in

(20)

• On hitting times of random walks on trees
• A note on expected hitting times for birth and death chains
• Moran's genetics model via electric networks.
• The expected hitting times for graphs with cutpoints.
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• On hitting and cover times via electric networks
• The hitting times of random walks on bicyclic graphs
• Dumbbell graphs with extremal (reverse) cover cost
• On the equivalence of cylinder tilings and planar electric networks
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications
• An explicit formula of hitting times for random walks on graphs
• Finding hitting times in various graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Simple random walks on wheel graphs
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
• The hitting time of random walk on unicyclic graphs
• Hitting times for random walks on tricyclic graphs
• Hitting times of random walks on unicyclic graphs with a given number of pendant vertices
• The hitting time of random walks on unicyclic graphs with a given maximum degree

This page was built for publication: Decomposing hitting times of walks on graphs into simpler ones

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