Temporal networks with node-specific memory: Unbiased inference of transition probabilities, relaxation times, and structural breaks

One of the main challenges in the study of time-varying networks is the interplay of memory effects with structural heterogeneity. In particular, different nodes and dyads can have very different statistical properties in terms of both link formation and link persistence, leading to a superposition of typical timescales, suboptimal parametrizations, and substantial estimation biases. Here we develop an unbiased maximum-entropy framework to study empirical network trajectories by controlling for the observed structural heterogeneity and local link persistence simultaneously. An exact mapping to a heterogeneous version of the one-dimensional Ising model leads to an analytic solution that rigorously disentangles the hidden variables that jointly determine both static and temporal properties. Additionally, model selection via likelihood maximization identifies the most parsimonious structural level (either global, node specific, or dyadic) accounting for memory effects. As we illustrate on real-world social networks, this method enables an improved estimation of dyadic transition probabilities, relaxation times, and structural breaks between dynamical regimes. In the resulting picture, the graph follows a generalized configuration model with given degrees and given time-persisting degrees, undergoing transitions between empirically identifiable stationary regimes.

Publication Details

Journal
Zurich Open Repository and Archive (University of Zurich)
Published
2024-12-11
DOI
https://doi.org/10.5167/uzh-276094
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

Temporal networks with node-specific memory: Unbiased inference of transition probabilities, relaxation times, and structural breaks

Zurich Open Repository and Archive (University of Zurich)
Complex Network Analysis Techniques
article

Temporal networks with node-specific memory: Unbiased inference of transition probabilities, relaxation times, and structural breaks

article en

Abstract

One of the main challenges in the study of time-varying networks is the interplay of memory effects with structural heterogeneity. In particular, different nodes and dyads can have very different statistical properties in terms of both link formation and link persistence, leading to a superposition of typical timescales, suboptimal parametrizations, and substantial estimation biases. Here we develop an unbiased maximum-entropy framework to study empirical network trajectories by controlling for the observed structural heterogeneity and local link persistence simultaneously. An exact mapping to a heterogeneous version of the one-dimensional Ising model leads to an analytic solution that rigorously disentangles the hidden variables that jointly determine both static and temporal properties. Additionally, model selection via likelihood maximization identifies the most parsimonious structural level (either global, node specific, or dyadic) accounting for memory effects. As we illustrate on real-world social networks, this method enables an improved estimation of dyadic transition probabilities, relaxation times, and structural breaks between dynamical regimes. In the resulting picture, the graph follows a generalized configuration model with given degrees and given time-persisting degrees, undergoing transitions between empirically identifiable stationary regimes.

Zurich Open Repository and Archive (University of Zurich)
Reduced inequalities
Openalex Percentile: Top 62%
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.