Asymptotic normality for triangle counting in the sparse $\beta$ -model
Journal of Applied Probability · 07.04.2026 · 1-16
DOI: 10.1017/jpr.2026.10090 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Probability, online erschienen am 07.04.2026. Verfasst von Siang Zhang und 2 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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 the 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$ .
Zitieren
APA
Zhang, S., Feng, Q., & Hu, Z. (2026). Asymptotic normality for triangle counting in the sparse $\beta$ -model. Journal of Applied Probability, 1-16. https://doi.org/10.1017/jpr.2026.10090
Vancouver
Zhang S, Feng Q, Hu Z. Asymptotic normality for triangle counting in the sparse $\beta$ -model. Journal of Applied Probability. 2026:1-16. doi:10.1017/jpr.2026.10090
BibTeX
@article{Zhang2026,
author = {Zhang, Siang and Feng, Qunqiang and Hu, Zhishui},
title = {Asymptotic normality for triangle counting in the sparse $\beta$ -model},
journal = {Journal of Applied Probability},
year = {2026},
pages = {1--16},
doi = {10.1017/jpr.2026.10090}
}
EUVIMED