Pages that link to "Item:Q922556"

The following pages link to Bounds on expected hitting times for a random walk on a connected graph (Q922556):

Displaying 14 items.

• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• The expected hitting times for finite Markov chains (Q924349) (← links)
• Further results on the expected hitting time, the cover cost and the related invariants of graphs (Q1618224) (← links)
• The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
• Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
• Finding hitting times in various graphs (Q2637378) (← links)
• On some general operators of hypergraphs (Q2701040) (← 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)
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters (Q4959293) (← links)
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times (Q4978297) (← links)
• The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
• Leontief meets Markov: sectoral vulnerabilities through circular connectivity (Q6188064) (← links)