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 条
  • [21] Graph augmentation problems with degree-unchangeable vertices
    Mashima, T
    Watanabe, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (03): : 781 - 793
  • [22] On numbers of vertices of maximum degree in the spanning trees of a graph
    Topp, J
    Vestergaard, PD
    DISCRETE MATHEMATICS, 1996, 155 (1-3) : 247 - 258
  • [23] Bounding the number of vertices in the degree graph of a finite group
    Akhlaghi, Zeinab
    Dolfi, Silvio
    Pacifici, Emanuele
    Sanus, Lucia
    JOURNAL OF PURE AND APPLIED ALGEBRA, 2020, 224 (02) : 725 - 731
  • [24] High degree vertices and eigenvalues in the preferential attachment graph
    Flaxman, A
    Frieze, A
    Fenner, T
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 264 - 274
  • [25] ON THE DEGREE SEQUENCE OF AN EVOLVING RANDOM GRAPH PROCESS AND ITS CRITICAL PHENOMENON
    Wu, Xian-Yuan
    Dong, Zhao
    Liu, Ke
    Cai, Kai-Yuan
    JOURNAL OF APPLIED PROBABILITY, 2009, 46 (04) : 1213 - 1220
  • [26] Transition of the Degree Sequence in the Random Graph Model of Cooper, Frieze, and Vera
    Vallier, Thomas
    STOCHASTIC MODELS, 2013, 29 (03) : 341 - 352
  • [27] Degree polynomial for vertices in a graph and its behavior under graph operations
    Jafarpour-Golzari, Reza
    COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 2022, 63 (04): : 397 - 413
  • [28] A random degree with strong minimal cover
    Lewis, Andrew E. M.
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2007, 39 : 848 - 856
  • [29] Depth of vertices with high degree in random recursive trees
    Eslava, Laura
    ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2022, 19 (01): : 839 - 857
  • [30] On the maximum degree of a random planar graph
    McDiarmid, Colin
    Reed, Bruce
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (04): : 591 - 601
12345