Likelihood-Based Inference for Random Networks With Changepoints

Document Type

Article

Publication Date

2026

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Source Publication

IEEE Transactions on Network Science and Engineering

Source ISSN

2327-4697

Original Item ID

DOI: 10.1109/TNSE.2025.3583550

Abstract

Generative, temporal network models play an important role in analyzing the dependence structure and evolution patterns of complex networks. Due to the complicated nature of real network data, it is often naive to assume that the underlying data-generative mechanism itself is invariant with time. Such observation leads to the study of changepoints or sudden shifts in the distributional structure of the evolving network. In this paper, we propose a likelihood-based methodology to detect changepoints in undirected, affine preferential attachment networks where, upon introduction, a new node selects one old to attach to with probability proportional to its degree. In particular, we establish a hypothesis testing framework to detect a single changepoint, together with a consistent estimator for the changepoint. Such results require establishing consistency and asymptotic normality of the MLE under the changepoint regime, which suffers from long range dependence. The methodology is then extended to the multiple changepoint setting via both a sliding window method and a more computationally efficient score statistic. We also compare the proposed methodology with previously developed non-parametric estimators of the changepoint via simulation, and the methods developed herein are applied to modeling the advisor choice in a Mathematics Genealogy Project network over time.

Comments

IEEE Transactions on Network Science and Engineering, Vol. 13 (2026). DOI.

Link to Full Text

Share

COinS