39 search results - page 2 / 8 » The Cover Time of Deterministic Random Walks |
RSA
2008
13 years 4 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 ...
WOWMOM
2009
ACM
13 years 11 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
ADHOCNOW
2010
Springer
13 years 6 months ago
2010
Springer
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
EJC
2007
13 years 5 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...