Long-memory and cyclical link prediction in temporal social networks

<title>Abstract</title> Temporal social networks contain persistent tie activation and periodic communication rhythms, but most link prediction models either emphasize short-term recurrence or rely on black-box embeddings that offer no interpretable summary of temporal structure. We propose a Bayesian discrete temporal link prediction framework that captures such dependence through Gegenbauer long-memory operators acting on a network-level latent dynamic process governing edge formation. Edges are modeled as conditionally independent Bernoulli variables given the latent process, embedded within the broader multivariate Bernoulli family for possible extensions to higher-order edge dependence. The Gegenbauer parameter-ization uses a memory parameter d to control hyperbolic decay and a frequency parameter u to locate cyclical components, yielding interpretable summaries of temporal dependence in binary network data. Two extensions accommodate non-stationarity: a B-spline time-varying specification for smooth structural drift, and a Markov-switching specification for abrupt regime changes; for the latter we establish strict stationarity and ergodicity of the finite-truncation implementation. Bayesian inference via Hamiltonian Monte Carlo provides posterior uncertainty for memory parameters and forward link predictions. Application to the SNAP email-Eu-core temporal communication dataset shows that long-memory MulBer specifications substantially improve held-out link prediction over static and traditional baselines, while the full Gegenbauer specification recovers a sharply concentrated weekly cyclical frequency (ˆ u = 0.622, implied period 1 ≈ 7.0 days), providing an interpretable network-level summary of recurring communication rhythms.

Authors

Institutions

Publication Details

Journal
Social Network Analysis and Mining
Published
2026-08-18
DOI
https://doi.org/10.1007/s13278-026-01640-1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Long-memory and cyclical link prediction in temporal social networks

Xingyu Yan, Gareth William Peters, Hongxuan Yan, Luoyi Sun
Social Network Analysis and Mining
Complex Network Analysis Techniques
article

Long-memory and cyclical link prediction in temporal social networks

Xingyu Yan, Gareth William Peters, Hongxuan Yan, Luoyi Sun
article en

Abstract

<title>Abstract</title> Temporal social networks contain persistent tie activation and periodic communication rhythms, but most link prediction models either emphasize short-term recurrence or rely on black-box embeddings that offer no interpretable summary of temporal structure. We propose a Bayesian discrete temporal link prediction framework that captures such dependence through Gegenbauer long-memory operators acting on a network-level latent dynamic process governing edge formation. Edges are modeled as conditionally independent Bernoulli variables given the latent process, embedded within the broader multivariate Bernoulli family for possible extensions to higher-order edge dependence. The Gegenbauer parameter-ization uses a memory parameter d to control hyperbolic decay and a frequency parameter u to locate cyclical components, yielding interpretable summaries of temporal dependence in binary network data. Two extensions accommodate non-stationarity: a B-spline time-varying specification for smooth structural drift, and a Markov-switching specification for abrupt regime changes; for the latter we establish strict stationarity and ergodicity of the finite-truncation implementation. Bayesian inference via Hamiltonian Monte Carlo provides posterior uncertainty for memory parameters and forward link predictions. Application to the SNAP email-Eu-core temporal communication dataset shows that long-memory MulBer specifications substantially improve held-out link prediction over static and traditional baselines, while the full Gegenbauer specification recovers a sharply concentrated weekly cyclical frequency (ˆ u = 0.622, implied period 1 ≈ 7.0 days), providing an interpretable network-level summary of recurring communication rhythms.

Social Network Analysis and Mining
Beijing Institute of Technology (CN), University of California, Santa Barbara (US), University of Science and Technology Beijing (CN)
Reduced inequalities
Openalex Percentile: Top 45%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.