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 条
  • [21] Bisecting sparse random graphs
    Luczak, MJ
    McDiarmid, C
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (01) : 31 - 38
  • [22] Dismantling sparse random graphs
    Department of Mathematics, Uppsala University, PO Box 480, SE-75.1 06 Uppsala, Sweden
    不详
    Comb. Probab. Comput., 2008, 2 (259-264):
  • [23] Sparse Random Graphs with Clustering
    Bollobas, Bela
    Janson, Svante
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 269 - 323
  • [24] The diameter of sparse random graphs
    Fernholz, Daniel
    Ramachandran, Vijaya
    RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (04) : 482 - 516
  • [25] TREES IN SPARSE RANDOM GRAPHS
    DELAVEGA, WF
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 45 (01) : 77 - 85
  • [26] Cycles in sparse random graphs
    Marinari, Enzo
    Van Kerrebroeck, Valery
    INTERNATIONAL WORKSHOP ON STATISTICAL-MECHANICAL INFORMATICS 2007 (IW-SMI 2007), 2008, 95
  • [27] The Diameter of Sparse Random Graphs
    Riordan, Oliver
    Wormald, Nicholas
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (5-6): : 835 - 926
  • [28] On the Rigidity of Sparse Random Graphs
    Linial, Nati
    Mosheiff, Jonathan
    JOURNAL OF GRAPH THEORY, 2017, 85 (02) : 466 - 480
  • [29] Dismantling sparse random graphs
    Janson, Svante
    Thomason, Andrew
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (02): : 259 - 264
  • [30] RANDOM SUBGRAPHS IN SPARSE GRAPHS
    Joos, Felix
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2350 - 2360
12345