We study the number of edges in the inhomogeneous random graph when vertex weights have an infinite mean and show that the number of edges is O(n log n).Central limit theorems for the number of edges are also establis...We study the number of edges in the inhomogeneous random graph when vertex weights have an infinite mean and show that the number of edges is O(n log n).Central limit theorems for the number of edges are also established.展开更多
基金supported by National Natural Science Foundation of China(Grant No.11671373)。
文摘We study the number of edges in the inhomogeneous random graph when vertex weights have an infinite mean and show that the number of edges is O(n log n).Central limit theorems for the number of edges are also established.
