论文信息 - The cover time of a biased random walk on Gn, p

The cover time of a biased random walk on Gn, p

We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case

[1] Paul Erdös,et al. On random graphs, I , 1959 .

[2] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3] Uriel Feige,et al. A Tight Upper Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[4] Uriel Feige,et al. A Tight Lower Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[5] László Lovász,et al. The cover time, the blanket time, and the Matthews bound , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6] Masafumi Yamashita,et al. Impact of Local Topological Information on Random Walks on Finite Graphs , 2003, ICALP.

[7] Alan M. Frieze,et al. The cover time of sparse random graphs. , 2003, SODA '03.

[8] Alan M. Frieze,et al. The cover time of the giant component of a random graph , 2008, Random Struct. Algorithms.

[9] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .

[10] Alan M. Frieze,et al. The cover times of random walks on random uniform hypergraphs , 2013, Theor. Comput. Sci..

[11] Colin Cooper,et al. Speeding Up Cover Time of Sparse Graphs Using Local Knowledge , 2015, IWOCA.

[12] Y. Peres,et al. Markov Chains and Mixing Times: Second Edition , 2017 .