16 search results - page 1 / 4 » Tight Bounds for the Cover Time of Multiple Random Walks |
98
Voted
ICALP
2009
Springer
15 years 9 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...
ISTCS
1993
Springer
15 years 1 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
STOC
1992
ACM
15 years 1 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
115
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...