39 search results - page 1 / 8 » The Cover Time of Deterministic Random Walks |
143
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study properties of a simple random walk on the random digraph Dn,p when
108
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
160
click to vote
ICALP
2009
Springer
16 years 3 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...
124
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n