How to determine if a random graph with a fixed degree sequence has a giant component

Felix Joos, Guillem Perarnau, Dieter Rautenbach +1

For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this p…