Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful

[21] The infection time of graphs [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (18) : 2577 - 2589

[22] Ding J., 2010, Cover times, blanket times, and majorizing measures

[23] Doerr B., 2010, STABILIZING CO UNPUB

[24] FINITE PARTICLE-SYSTEMS AND INFECTION MODELS [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1983, 94 (JUL) : 167 - 182

[25] Efremenko K., 2009, LNCS, V5687, P376

[26] Elsässer R, 2009, LECT NOTES COMPUT SC, V5555, P415, DOI 10.1007/978-3-642-02927-1_35

[27] A TIGHT LOWER-BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (04) : 433 - 438

[28] A TIGHT UPPER BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (01) : 51 - 54

[29] Gasieniec L, 2008, LECT NOTES COMPUT SC, V5344, P14, DOI 10.1007/978-3-540-92248-3_2

[30] Random walks in peer-to-peer networks: Algorithms and evaluation [J]. PERFORMANCE EVALUATION, 2006, 63 (03) : 241 - 263

[21] The infection time of graphs [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (18) : 2577 - 2589

[22] Ding J., 2010, Cover times, blanket times, and majorizing measures

[23] Doerr B., 2010, STABILIZING CO UNPUB

[24] FINITE PARTICLE-SYSTEMS AND INFECTION MODELS [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1983, 94 (JUL) : 167 - 182

[25] Efremenko K., 2009, LNCS, V5687, P376

[26] Elsässer R, 2009, LECT NOTES COMPUT SC, V5555, P415, DOI 10.1007/978-3-642-02927-1_35

[27] A TIGHT LOWER-BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (04) : 433 - 438

[28] A TIGHT UPPER BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (01) : 51 - 54

[29] Gasieniec L, 2008, LECT NOTES COMPUT SC, V5344, P14, DOI 10.1007/978-3-540-92248-3_2

[30] Random walks in peer-to-peer networks: Algorithms and evaluation [J]. PERFORMANCE EVALUATION, 2006, 63 (03) : 241 - 263