The cover time of sparse random graphs

被引：44
|
作者：
Cooper, Colin
Frieze, Alan [1 ]
机构：
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[2] Univ London Goldsmiths Coll, Dept Math & Comp Sci, London SW14 6NW, England
来源：
RANDOM STRUCTURES & ALGORITHMS | 2007年 / 30卷 / 1-2期
关键词：
random walk; random graphs; cover time;
D O I：
10.1002/rsa.20151
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the cover time of a random walk on graphs G epsilon G(n,p), when p = c log n /n, c > 1. We prove that whp, the cover time, is asymptotic to c log (c/c-1) n log n. (c) 2006 Wiley Periodicals, Inc.
引用
收藏
页码：1 / 16
页数：16
相关论文
共 50 条
  • [31] Random perturbation of sparse graphs
    Hahn-Klimroth, Max
    Maesaka, Giulia S.
    Mogge, Yannick
    Mohr, Samuel
    Parczyk, Olaf
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [32] Sampling Random Colorings of Sparse Random Graphs
    Efthymiou, Charilaos
    Hayes, Thomas P.
    Stefankovic, Daniel
    Vigoda, Eric
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1759 - 1771
  • [33] A TIGHT UPPER BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS
    FEIGE, U
    RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (01) : 51 - 54
  • [34] Bounded clique cover of some sparse graphs
    Munaro, Andrea
    DISCRETE MATHEMATICS, 2017, 340 (09) : 2208 - 2216
  • [35] Rainbow Connection of Sparse Random Graphs
    Frieze, Alan
    Tsourakakis, Charalampos E.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (04):
  • [36] Implementing huge sparse random graphs
    Naor, Moni
    Nussboim, Asaf
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 596 - +
  • [37] INDUCED TREES IN SPARSE RANDOM GRAPHS
    DELAVEGA, WF
    GRAPHS AND COMBINATORICS, 1986, 2 (03) : 227 - 231
  • [38] LONG PATHS IN SPARSE RANDOM GRAPHS
    BOLLOBAS, B
    COMBINATORICA, 1982, 2 (03) : 223 - 228
  • [39] The largest eigenvalue of sparse random graphs
    Krivelevich, M
    Sudakov, B
    COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (01): : 61 - 72
  • [40] Largest sparse subgraphs of random graphs
    Fountoulakis, Nikolaos
    Kang, Ross J.
    McDiarmid, Colin
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 35 : 232 - 244
12345