  We develop tail estimates for the number of edges in a Chung-Lu random graph
with regularly varying weight distribution. Our results show that the most
likely way to have an unusually large number of edges is through the presence
of one or more hubs, i.e.\ vertices with degree of order $n$.
