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 条
  • [1] The cover time of sparse random graphs.
    Cooper, C
    Frieze, A
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 140 - 147
  • [2] On the cover time for random walks on random graphs
    Jonasson, J
    COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (03): : 265 - 279
  • [3] The Cover Time of Random Geometric Graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 324 - 349
  • [4] The cover time of random geometric graphs
    Cooper, Colin
    Frieze, Alan
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 48 - +
  • [5] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740
  • [6] On the cover time of random geometric graphs
    Avin, C
    Ercal, G
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 677 - 689
  • [7] Hamilton completion and the path cover number of sparse random graphs
    Alon, Yahav
    Krivelevich, Michael
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 118
  • [8] On the cover time and mixing time of random geometric graphs
    Avin, Chen
    Ercal, Gunes
    THEORETICAL COMPUTER SCIENCE, 2007, 380 (1-2) : 2 - 22
  • [9] The cover time of two classes of random graphs
    Cooper, Colin
    Frieze, Alan
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 961 - 970
  • [10] A generalized cover time for random walks on graphs
    Banderier, C
    Dobrow, RP
    FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS, 2000, : 113 - 124
12345