Semiparametric Modeling and Analysis for Longitudinal Network Data
Yinqiu He, Jiajin Sun, Yuang Tian, Zhiliang Ying, Yang Feng
TL;DR
This work addresses the challenge of learning a shared, static latent space from longitudinal network count data by proposing a semiparametric Poisson latent-space model with a time-invariant latent matrix $Z$ and time-varying baseline $\alpha_{it}$. It develops two estimation strategies: a generalized semiparametric one-step updater based on the efficient score on the quotient manifold and a nuclear-norm penalized maximum likelihood estimator on $G=ZZ^{\top}$, each achieving near-oracle error rates for the latent structure. Theoretical results establish non-Euclidean convergence rates and account for identifiability under rotation, while practical validation includes simulation studies and analysis of the New York Citi Bike dataset, where latent positions align with geography and reveal meaningful baseline activity patterns. Collectively, the paper provides a principled, efficient framework for inferring latent structure in longitudinal networks with node-time heterogeneity, with implications for prediction, hypothesis testing, and change-point analysis in complex networks.
Abstract
We introduce a semiparametric latent space model for analyzing longitudinal network data. The model consists of a static latent space component and a time-varying node-specific baseline component. We develop a semiparametric efficient score equation for the latent space parameter by adjusting for the baseline nuisance component. Estimation is accomplished through a one-step update estimator and an appropriately penalized maximum likelihood estimator. We derive oracle error bounds for the two estimators and address identifiability concerns from a quotient manifold perspective. Our approach is demonstrated using the New York Citi Bike Dataset.
