Abstract
We study the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set and degree sequence . In a previous work, the asymptotic cover time was obtained under a number of assumptions on , the most significant being that for all . Here we replace this assumption by . As a corollary, we establish the asymptotic cover time for the 2-core of the emerging giant component of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.