39 search results - page 1 / 8 » The Cover Time of Deterministic Random Walks |
COCOON
2010
Springer
14 years 1 months ago
2010
Springer
CORR
2011
Springer
13 years 6 months ago
2011
Springer
We study properties of a simple random walk on the random digraph Dn,p when
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
SODA
2003
ACM
14 years 10 days ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n