Cover Time of a Random Graph With a Degree Sequence II: Allowing Vertices of Degree Two

被引：4
|
作者：
Cooper, Colin [1 ]
Frieze, Alan [2 ]
Lubetzky, Eyal [3 ]
机构：
[1] Univ London, Kings Coll, Dept Comp Sci, London WC2R 2LS, England
[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[3] Microsoft Res, Redmond, WA 98052 USA
来源：
RANDOM STRUCTURES & ALGORITHMS | 2014年 / 45卷 / 04期
关键词：
random graphs; emerging giant; cover time; RANDOM-WALKS; GIANT COMPONENT;
D O I：
10.1002/rsa.20573
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence. In a previous work (Abdullah, Cooper, and Frieze, Discrete Math 312 (2012), 3146-3163), the asymptotic cover time was obtained under a number of assumptions on d, the most significant being that d(i) 3 for all i. Here we replace this assumption by d(i) 2. As a corollary, we establish the asymptotic cover time for the 2-core of the emerging giant component of G(n,p). (c) 2014 Wiley Periodicals, Inc. Random Struct. Alg., 45, 627-674, 2014
引用
收藏
页码：627 / 674
页数：48
相关论文
共 50 条
12345