Sciweavers

RSA
2011
157views more  RSA 2011»
13 years 1 months ago
The cover time of random geometric graphs
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...
Colin Cooper, Alan M. Frieze
RSA
2008
118views more  RSA 2008»
13 years 5 months ago
The cover time of the giant component of a random graph
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 ...
Colin Cooper, Alan M. Frieze
DCOSS
2010
Springer
13 years 6 months ago
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering
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 ...
Joffroy Beauquier, Janna Burman
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
13 years 7 months ago
The cover time of sparse random graphs
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
Colin Cooper, Alan M. Frieze
MSWIM
2006
ACM
14 years 9 days ago
The power of choice in random walks: an empirical study
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...
Chen Avin, Bhaskar Krishnamachari
ICALP
2009
Springer
14 years 6 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
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...
Robert Elsässer, Thomas Sauerwald