Pages that link to "Item:Q1001905"

The following pages link to The hitting and cover times of random walks on finite graphs using local degree information (Q1001905):

Displaying 19 items.

• Comparison of multiple random walks strategies for searching networks (Q474593) (← links)
• Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
• The hitting and cover times of Metropolis walks (Q964410) (← 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)
• The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
• Comparison of mean hitting times for a degree-biased random walk (Q2449093) (← links)
• Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187) (← links)
• Stochastic forms of non-negative matrices and Perron-regularity (Q3186708) (← links)
• How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
• Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← 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)
• The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
• Reversible random walks on dynamic graphs (Q6063351) (← links)
• On cover times of Markov chains (Q6646224) (← links)