Pages that link to "Item:Q2514190"
From MaRDI portal
The following pages link to An explicit formula of hitting times for random walks on graphs (Q2514190):
Displaying 22 items.
- On partial sums of hitting times (Q434720) (← links)
- On the moments of hitting times for random walks on trees (Q609667) (← links)
- On the average hitting times of the squares of cycles (Q832990) (← links)
- Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
- On hitting times of random walks on trees (Q1003428) (← links)
- Expected hitting times for a random walk on a connected graph (Q1080258) (← links)
- Random walks on edge-transitive graphs. II (Q1284583) (← links)
- First hitting times of simple random walks on graphs with congestion points (Q1415070) (← links)
- The expected hitting times for graphs with cutpoints. (Q1423039) (← links)
- Further results on the expected hitting time, the cover cost and the related invariants of graphs (Q1618224) (← links)
- On hitting and cover times via electric networks (Q1766415) (← links)
- Discrete Green's functions and random walks on graphs (Q1930145) (← links)
- The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
- Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
- Spanning trees and random walks on weighted graphs (Q2256311) (← links)
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
- Decomposing hitting times of walks on graphs into simpler ones (Q2404178) (← links)
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs (Q3008009) (← links)
- Hitting times for random walks on subdivision and triangulation graphs (Q4640054) (← links)
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times (Q4978297) (← links)
- The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
- On the weighted reverse cover cost of trees and unicyclic graphs with given diameter (Q6585505) (← links)
