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 条
  • [41] The cover time of random geometric graphs
    Cooper, Colin
    Frieze, Alan
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 48 - +
  • [42] On the cover time of random geometric graphs
    Avin, C
    Ercal, G
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 677 - 689
  • [43] The Cover Time of Deterministic Random Walks
    Friedrich, Tobias
    Sauerwald, Thomas
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [44] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740
  • [45] Component structure of the vacant set induced by a random walk on a random graph
    Cooper, Colin
    Frieze, Alan
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1211 - 1221
  • [46] Component structure of the vacant set induced by a random walk on a random graph
    Cooper, Colin
    Frieze, Alan
    RANDOM STRUCTURES & ALGORITHMS, 2013, 42 (02) : 135 - 158
  • [47] BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH
    Khandwawala, Mustafa
    Sundaresan, Rajesh
    ANNALS OF APPLIED PROBABILITY, 2014, 24 (06): : 2414 - 2454
  • [48] On the cover time and mixing time of random geometric graphs
    Avin, Chen
    Ercal, Gunes
    THEORETICAL COMPUTER SCIENCE, 2007, 380 (1-2) : 2 - 22
  • [49] The size of the giant component in random hypergraphs: a short proof
    Cooley, Oliver
    Kang, Mihyun
    Koch, Christoph
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (03):
  • [50] RANDOM NETWORKS WITH SUBLINEAR PREFERENTIAL ATTACHMENT: THE GIANT COMPONENT
    Dereich, Steffen
    Moerters, Peter
    ANNALS OF PROBABILITY, 2013, 41 (01): : 329 - 384
12345