Dynamical system for PageRank with a time-dependent memory

Inspired by the dynamical PageRank framework of Gleich and Rossi (2014), we introduce a continuous-time PageRank model in which the personalization vector evolves as a weighted average of its past values, with the weights determined by a memory function. The resulting dynamics are formulated as an initial value problem for an integro-differential equation, where the initial condition is a probability vector. We investigate how the choice of memory function influences the long-time behavior of the PageRank vector. In particular, for strongly connected networks G , we prove that broad classes of memory functions lead to convergence toward a stationary state that is independent of the initial condition. In contrast, when the memory function is exponential-oscillatory, ω ( t ) = e a t cos 2 ( b t ) for t ≥ 0 with a , b > 0 , we show that the PageRank dynamics exhibit asymptotically periodic behavior, revealing that oscillatory memory can fundamentally alter the qualitative evolution of the ranking process. To establish these results, we first prove the existence and uniqueness of solutions using standard results from the theory of integro-differential equations and show that the solution remains a probability vector for all times, thereby preserving the essential properties of the PageRank model.

Authors

Institutions

Publication Details

Journal
Chaos Solitons & Fractals
Published
2026-11-15
DOI
https://doi.org/10.1016/j.chaos.2026.119429
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Dynamical system for PageRank with a time-dependent memory

Eva Primo, Daniel Rodríguez, Julio Flores, Miguel Romance
1 links
Chaos Solitons & Fractals
Complex Network Analysis Techniques
article

Dynamical system for PageRank with a time-dependent memory

Eva Primo, Daniel Rodríguez, Julio Flores, Miguel Romance
article en

Abstract

Inspired by the dynamical PageRank framework of Gleich and Rossi (2014), we introduce a continuous-time PageRank model in which the personalization vector evolves as a weighted average of its past values, with the weights determined by a memory function. The resulting dynamics are formulated as an initial value problem for an integro-differential equation, where the initial condition is a probability vector. We investigate how the choice of memory function influences the long-time behavior of the PageRank vector. In particular, for strongly connected networks G , we prove that broad classes of memory functions lead to convergence toward a stationary state that is independent of the initial condition. In contrast, when the memory function is exponential-oscillatory, ω ( t ) = e a t cos 2 ( b t ) for t ≥ 0 with a , b > 0 , we show that the PageRank dynamics exhibit asymptotically periodic behavior, revealing that oscillatory memory can fundamentally alter the qualitative evolution of the ranking process. To establish these results, we first prove the existence and uniqueness of solutions using standard results from the theory of integro-differential equations and show that the solution remains a probability vector for all times, thereby preserving the essential properties of the PageRank model.

Chaos Solitons & FractalsVol. 214
Universidad Rey Juan Carlos (ES)
Universidad Rey Juan Carlos
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.

Laika access coming soon