RSA
2011
13 years 5 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
RSA
2008
13 years 10 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
DCOSS
2010
Springer
13 years 11 months ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
SODA
2003
ACM
14 years 7 days ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
MSWIM
2006
ACM
14 years 4 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
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...