Scale-free graphs with many edges
Probability
2023-12-05 v4
Abstract
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 .
Cite
@article{arxiv.2212.05907,
title = {Scale-free graphs with many edges},
author = {Clara Stegehuis and Bert Zwart},
journal= {arXiv preprint arXiv:2212.05907},
year = {2023}
}
Comments
10 pages