Cover time of a random graph with given degree sequence

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