Asymptotic Normality of the Hill Estimator in Linear Preferential Attachment
Abstract
We prove asymptotic normality of the Hill estimator based on the largest kn degrees in a homogeneous linear preferential attachment graph with n vertices. Each new vertex sends a fixed number m≥1 of edges sequentially to older vertices, with attachment weight d+δ and fixed δ>−m. Let α=m/(2m+δ). For every deterministic sequence kn→∞ satisfying √(kn)(kn/n)α→0, the estimator, centered at α and multiplied by √(kn), converges to a centered normal law with an explicit variance strictly smaller than α2. The reduction relative to the Hill variance for independent observations separates into contributions from the different degree laws at different birth times and from competition for new edges. The contribution from competition is 1/m times that from different birth times. Representations using Gamma and beta functions give a consistent standard error and a studentized normal limit. The proof uses martingales indexed by edge attachments and comparisons with independent pure-birth processes, while retaining the integer degrees and their ties.
Related
- Strong Consistency and Asymptotic Normality of the Maximum Likelihood Estimator in r-Largest Generalized Extreme-Value Models
- Spatial preferential attachment models: robustness revisited
- Sub-Gaussian Concentration and Entropic Normality of the Maximum Likelihood Estimator
- Persistent Hubs and Sharp Asymptotics in Eigenvector Preferential Attachment Trees
- How Robust is Scale-Free Structure? Phase Transitions in Preferential Attachment Model under Attack?
BibTeX
@misc{wang2026asymptotic,
title = {{Asymptotic Normality of the Hill Estimator in Linear Preferential Attachment}},
author = {Tiandong Wang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.24413},
eprint = {2610.24413},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.24413},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Asymptotic Normality of the Hill Estimator in Linear Preferential Attachment
AU - Tiandong Wang
PY - 2026
DA - 2026/10/17
PB - arXiv
DO - 10.48550/arxiv.2610.24413
UR - https://arxiv.org/abs/2610.24413
AB - We prove asymptotic normality of the Hill estimator based on the largest k_n degrees in a homogeneous linear preferential attachment graph with n vertices. Each new vertex sends a fixed number m≥1 of edges sequentially to older vertices, with attachment weight d+δ and fixed δ>−m. Let α=m/(2m+δ). For every deterministic sequence k_n→∞ satisfying √(k_n)(k_n/n)^α→0, the estimator, centered at α and multiplied by √(k_n), converges to a centered normal law with an explicit variance strictly smaller than α^2. The reduction relative to the Hill variance for independent observations separates into contributions from the different degree laws at different birth times and from competition for new edges. The contribution from competition is 1/m times that from different birth times. Representations using Gamma and beta functions give a consistent standard error and a studentized normal limit. The proof uses martingales indexed by edge attachments and comparisons with independent pure-birth processes, while retaining the integer degrees and their ties.
ER -