论文标题
没有比例的图形多个边缘
Scale-free graphs with many edges
论文作者
论文摘要
我们对Chung-Lu随机图中边缘数量的尾部估计值进行定期变化。我们的结果表明，具有异常数量的边缘的最可能方法是通过一个或多个集线器，即具有订单$ n $的顶点。
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$.
