On rate of convergence to the Poisson law of the number of cycles in the generalized random graphs

Abstract

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The weights are assumed to be independent identically distributed random variables which have a power-law distribution. The proof is based on the Chen--Stein approach and on the derived properties of the ratio of the sum of squares of random variables and the sum of these variables. These properties can be applied to other asymptotic problems related to generalized random graphs.

Figures (2)

• Figure 1: Histogram of the number of triangles in GRG with $2000$ vertices. The vertex weights $W_{i}=scale*Y+loc,$ where $loc=1,$$scale=10$ and $Y \thicksim Pareto$$(9.5)$ for all $i \leq 2000.$ The number of realizations is 400.
• Figure 2: Q-Q plot for the number of quadrilaterals in GRG with $2000$ vertices and the Poisson variable $Pois(2880.16)$. The vertex weights $W_{i}=scale*Y+loc,$ where $loc=1,$$scale=10$ and $Y \thicksim Pareto$$(9.5)$ for all $i \leq 2000.$ The number of realizations is 400.

Theorems & Definitions (26)

• theorem \oldthetheorem
• remark 1
• remark 2
• theorem \oldthetheorem
• theorem \oldthetheorem
• lemma 1
• proof
• lemma 2
• proof
• lemma 3