Asymptotic normality for triangle counting in the sparse $\beta$-model
We study the number of triangles $T_n$ in the sparse $\beta$-model on $n$ vertices, a random graph model that captures degree heterogeneity in real-world networks. Using the norms of the heterogeneity parameter vector, we first determine the asymptotic mean and variance of $T_n$. Next, by applying the Malliavin-Stein method, we derive a non-asymptotic upper bound on the Kolmogorov distance between normalized $T_n$ and the standard normal distribution. Under an additional assumption on degree heterogeneity, we further prove the asymptotic normality for $T_n$, as $n\to\infty$.
math.PR↗