How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

@inproceedings{Avin2008HowTE,
  title={How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)},
  author={Chen Avin and Michal Kouck{\'y} and Zvi Lotker},
  booktitle={ICALP},
  year={2008}
}
Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of such a dynamic graph, the cover time, under the assumption that the graph is being modified by an oblivious adversary. It is well known that on… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
77 Citations
17 References
Similar Papers

Similar Papers

Loading similar papers…