Diameters and mixing times for giant components of random graphs with given degrees

Louigi Addario-Berry, Bruce Reed, Corrine Yap

A sequence $D=\{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uni…