The cover time of the giant component of a random graph

被引：39
|
作者：
Cooper, Colin [2 ]
Frieze, Alan [1 ]
机构：
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[2] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
来源：
RANDOM STRUCTURES & ALGORITHMS | 2008年 / 32卷 / 04期
关键词：
cover time; random graphs; giant component;
D O I：
10.1002/rsa.20201
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the cover time of a random walk on the largest component of the random graph G(n,p). We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In particular, we show that the cover time is not monotone for c = Theta(ln n). We also determine the cover time of the k-cores, k >= 2. (c) 2008 Wiley Periodicals, Inc.
引用
收藏
页码：401 / 439
页数：39
相关论文
共 50 条
  • [31] On the cover time for random walks on random graphs
    Jonasson, J
    COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (03): : 265 - 279
  • [32] The Big Friendly Giant: The Giant Component in Clustered Random Graphs
    Berchenko, Yakir
    Artzy-Randrup, Yael
    Teicher, Mina
    Stone, Lewi
    DYNAMICS ON AND OF COMPLEX NETWORKS: APPLICATIONS TO BIOLOGY, COMPUTER SCIENCE, AND THE SOCIAL SCIENCES, 2009, : 237 - +
  • [33] The cover time of the preferential attachment graph
    Cooper, Colin
    Frieze, Alan
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (02) : 269 - 290
  • [34] Random Walk in the Complete Graph : Hitting and Cover Times
    François Castella
    Bruno Sericola
    Methodology and Computing in Applied Probability, 2025, 27 (2)
  • [35] On the largest component of the random graph at a nearcritical stage
    Pittel, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 82 (02) : 237 - 269
  • [36] Time evolution of a random graph
    Lushnikov, AA
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2005, 38 (46): : L777 - L782
  • [37] The emergence of a giant component in random subgraphs of Pseudo-random graphs
    Frieze, A
    Krivelevich, M
    Martin, R
    RANDOM STRUCTURES & ALGORITHMS, 2004, 24 (01) : 42 - 50
  • [38] The cover time of sparse random graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 1 - 16
  • [39] The Cover Time of Deterministic Random Walks
    Friedrich, Tobias
    Sauerwald, Thomas
    COMPUTING AND COMBINATORICS, 2010, 6196 : 130 - +
  • [40] The Cover Time of Random Geometric Graphs
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 324 - 349
12345