The cover time of deterministic random walks

DOI10.1007/978-3-642-14031-0_16zbMath1201.05084arXiv1006.3430OpenAlexW1490227078MaRDI QIDQ612954

Tobias Friedrich, Thomas Sauerwald

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.3430

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (13)

Bounds on the cover time of parallel rotor walks ⋮ The Range of a Rotor Walk ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks ⋮ Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Derandomizing random walks in undirected graphs using locally fair exploration strategies ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Deterministic walks with choice ⋮ Fast Simulation of Large-Scale Growth Models ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Does adding more agents make a difference? A case study of cover time for the rotor-router ⋮ Deterministic random walks on finite graphs

This page was built for publication: The cover time of deterministic random walks