Pages that link to "Item:Q3970909"

The following pages link to Maximum hitting time for random walks on graphs (Q3970909):

Displaying 48 items.

• Cop vs. gambler (Q267177) (← links)
• Exact mixing times for random walks on trees (Q354448) (← links)
• Capturing the drunk robber on a graph (Q406701) (← links)
• The best mixing time for random walks on trees (Q503614) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• On the expected time for Herman's probabilistic self-stabilizing algorithm (Q817822) (← links)
• Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
• Bounds on expected hitting times for a random walk on a connected graph (Q922556) (← links)
• The hitting and cover times of Metropolis walks (Q964410) (← links)
• The hitting and cover times of random walks on finite graphs using local degree information (Q1001905) (← links)
• Expected hitting times for a random walk on a connected graph (Q1080258) (← links)
• The maximum relaxation time of a random walk (Q1795486) (← links)
• Chromatic posets (Q2049439) (← links)
• The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
• The access time of random walks on trees with given partition (Q2141241) (← links)
• Containment: a variation of cops and robber (Q2175792) (← links)
• Slowdown for the geodesic-biased random walk (Q2279090) (← links)
• Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
• Three conjectures in extremal spectral graph theory (Q2399353) (← links)
• Decomposing hitting times of walks on graphs into simpler ones (Q2404178) (← links)
• Comparison of mean hitting times for a degree-biased random walk (Q2449093) (← links)
• Finding hitting times in various graphs (Q2637378) (← links)
• Walker-Breaker Games (Q2944455) (← links)
• Tight inequalities among set hitting times in Markov chains (Q3190216) (← links)
• How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
• Expected return times for a random walk on random graphs \(\zeta{} (n,M)\) (Q3990483) (← links)
• Random walks and the regeneration time (Q4242911) (← links)
• A tight upper bound on the cover time for random walks on graphs (Q4322474) (← links)
• Characterizing graphs of maximum principal ratio (Q4568074) (← links)
• Hitting times for random walks on subdivision and triangulation graphs (Q4640054) (← links)
• Lollipop and Lariat Symmetric Functions (Q4641758) (← links)
• A model of self‐avoiding random walks for searching complex networks (Q4648693) (← links)
• A stochastic process on a network with connections to Laplacian systems of equations (Q5066880) (← links)
• TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS (Q5076122) (← links)
• Extremal hitting times of trees with some given parameters (Q5089351) (← links)
• Computing Kemeny's constant for a barbell graph (Q5215582) (← links)
• The Mixing Time of the Newman-Watts Small-World Model (Q5246170) (← links)
• New Bounds for Edge-Cover by Random Walk (Q5495676) (← links)
• (Q5743507) (← links)
• The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
• Forest formulas of discrete Green's functions (Q6046689) (← links)
• Reversible random walks on dynamic graphs (Q6063351) (← links)
• Distributed protocols against mobile eavesdroppers (Q6084554) (← links)
• A central limit theorem for the mean starting hitting time for a random walk on a random graph (Q6103737) (← links)
• Hitting times for random walks on tricyclic graphs (Q6166239) (← links)
• Unexpected advantages of exploitation for target searches in complex networks (Q6567595) (← links)
• A new probabilistic molecular index (Q6630951) (← links)
• A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees (Q6646407) (← links)