Open Access
2023 Scale-free graphs with many edges
Clara Stegehuis, Bert Zwart
Author Affiliations +
Electron. Commun. Probab. 28: 1-11 (2023). DOI: 10.1214/23-ECP567

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 n.

Citation

Download Citation

Clara Stegehuis. Bert Zwart. "Scale-free graphs with many edges." Electron. Commun. Probab. 28 1 - 11, 2023. https://doi.org/10.1214/23-ECP567

Information

Received: 12 December 2022; Accepted: 2 December 2023; Published: 2023
First available in Project Euclid: 13 December 2023

Digital Object Identifier: 10.1214/23-ECP567

Subjects:
Primary: 05C80 , 60F10

Keywords: large deviations , power law , Random graphs

Back to Top