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 条
  • [21] On a cover time problem on a dynamic graph with steps at random times
    Demirci, Yunus Emre
    Islak, Umit
    Yildiz, Mehmet Akif
    STATISTICS & PROBABILITY LETTERS, 2023, 197
  • [22] The limit distribution of the size of a giant component in an Internet-type random graph
    Pavlov, Yj. L.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2007, 17 (05): : 425 - 437
  • [23] How to determine if a random graph with a fixed degree sequence has a giant component
    Felix Joos
    Guillem Perarnau
    Dieter Rautenbach
    Bruce Reed
    Probability Theory and Related Fields, 2018, 170 : 263 - 310
  • [24] How to determine if a random graph with a fixed degree sequence has a giant component
    Joos, Felix
    Perarnau, Guillem
    Rautenbach, Dieter
    Reed, Bruce
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 695 - 703
  • [25] How to determine if a random graph with a fixed degree sequence has a giant component
    Joos, Felix
    Perarnau, Guillem
    Rautenbach, Dieter
    Reed, Bruce
    PROBABILITY THEORY AND RELATED FIELDS, 2018, 170 (1-2) : 263 - 310
  • [26] How to Design a Linear Cover Time Random Walk on a Finite Graph
    Nonaka, Yoshiaki
    Ono, Hirotaka
    Sadakane, Kunihiko
    Yamashita, Masafumi
    STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2009, 5792 : 104 - +
  • [27] ON THE COVER TIME OF THE EMERGING GIANT
    Frieze, Alan M.
    Pegden, Wesley
    Tkocz, Tomasz
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) : 1687 - 1710
  • [28] The Order of the Giant Component of Random Hypergraphs
    Behrisch, Michael
    Coja-Oghlan, Amin
    Kang, Mihyun
    RANDOM STRUCTURES & ALGORITHMS, 2010, 36 (02) : 149 - 184
  • [29] Cover Time of a Random Graph With a Degree Sequence II: Allowing Vertices of Degree Two
    Cooper, Colin
    Frieze, Alan
    Lubetzky, Eyal
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (04) : 627 - 674
  • [30] The cover time of random digraphs
    Cooper, Colin
    Frieze, Alan
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 422 - +
12345