Pages that link to "Item:Q3638899"
From MaRDI portal
The following pages link to How Well Do Random Walks Parallelize? (Q3638899):
Displaying 17 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Broadcasting on paths and cycles (Q2138979) (← links)
- On an epidemic model on finite graphs (Q2180383) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Multiple cover time (Q3123120) (← links)
- The Hitting Time of Multiple Random Walks (Q3185674) (← links)
- Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
- Random walks on colored graphs (Q4286296) (← links)
- Cover time and mixing time of random walks on dynamic graphs (Q4584911) (← links)
- Multiple random walks on paths and grids (Q4636644) (← links)
- Multiple lazy random walks on cycles (Q4640675) (← links)
- The power of two choices for random walks (Q5886308) (← 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)
