Pages that link to "Item:Q1423039"
From MaRDI portal
The following pages link to The expected hitting times for graphs with cutpoints. (Q1423039):
Displaying 19 items.
- On the moments of hitting times for random walks on trees (Q609667) (← links)
- On the first passage time of a simple random walk on a tree (Q634583) (← links)
- Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
- The expected hitting times for finite Markov chains (Q924349) (← links)
- On hitting times of random walks on trees (Q1003428) (← links)
- A note on expected hitting times for birth and death chains (Q1126106) (← links)
- Expected hitting times for random walks on weak products of graphs (Q1284584) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
- The access time of random walks on trees with given partition (Q2141241) (← links)
- On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
- Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← 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)
- The generating functions of hitting times for random walk on trees (Q2462080) (← links)
- (Q3643436) (← links)
- Hitting times for random walks on subdivision and triangulation graphs (Q4640054) (← links)
- Expected hitting times for random walks on quadrilateral graphs and their applications (Q4689926) (← links)
- Hitting times for random walks on tricyclic graphs (Q6166239) (← links)