2023-12-13
Scale-free graphs with many edges
Publication
Publication
Electronic Communications in Probability , Volume 28 p. 62:1- 62:11
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.
| Additional Metadata | |
|---|---|
| , , | |
| doi.org/10.1214/23-ECP567 | |
| Electronic Communications in Probability | |
| Organisation | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
|
Stegehuis, C., & Zwart, B. (2023). Scale-free graphs with many edges. Electronic Communications in Probability, 28, 62:1–62:11. doi:10.1214/23-ECP567 |
|
