A Generalized Cover Time for Random Walks on Graphs

@inproceedings{Banderier2000AGC,
  title={A Generalized Cover Time for Random Walks on Graphs},
  author={Cyril Banderier and Robert P. Dobrow},
  year={2000}
}
Abstract. Given a random walk on a graph, the cover time is the rst time (number of steps) that every vertex has been hit (covered) by the walk. De ne the marking time for the walk as follows. When the walk reaches vertex vi, a coin is ipped and with probability pi the vertex is marked (or colored). We study the time that every vertex is marked. (When all… CONTINUE READING