Pages that link to "Item:Q541669"

The following pages link to Tight bounds for the cover time of multiple random walks (Q541669):

Displaying 15 items.

• Bounds on the cover time of parallel rotor walks (Q269498) (← links)
• Comparison of multiple random walks strategies for searching networks (Q474593) (← links)
• A discrete random walk on the hypercube (Q2150085) (← links)
• On an epidemic model on finite graphs (Q2180383) (← links)
• The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
• Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
• The ANTS problem (Q2401118) (← links)
• The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
• Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs (Q2942665) (← links)
• The Hitting Time of Multiple Random Walks (Q3185674) (← links)
• Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
• A general lower bound for collaborative tree exploration (Q5919423) (← links)
• Reversible random walks on dynamic graphs (Q6063351) (← links)
• Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
• Spread of information and diseases via random walks in sparse graphs (Q6535006) (← links)