Carnegie Mellon University
Browse

Cover time of a random graph with given degree sequence

Download (256.75 kB)
journal contribution
posted on 2012-04-09, 00:00 authored by Mohammed Abdullah, Colin Cooper

In this paper we establish the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of is whp asymptotic to . Here θ is the average degree and d is the effective minimum degree.

History

Publisher Statement

This is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at http://dx.doi.org/10.1016/j.disc.2012.07.006

Date

2012-04-09

Usage metrics

    Categories

    Keywords

    Cover timeRandom graphsDegree sequenceMathematical Sciences not elsewhere classified

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC