Time-dependent personalized PageRank for temporal networks: Discrete and continuous scales

被引:0
|
作者
Aleja, David [1 ,2 ,3 ,4 ]
Flores, Julio [1 ]
Primo, Eva [1 ,2 ]
Romance, Miguel [1 ,2 ,4 ]
机构
[1] Univ Rey Juan Carlos, Dept Matemat Aplicada Ciencia Ingn Mat & Tecnol El, Mostoles 28933, Madrid, Spain
[2] Univ Rey Juan Carlos, Lab Math Computat Complex Networks & their Applica, Mostoles 28933, Madrid, Spain
[3] Univ Michigan, Dept Internal Med, Ann Arbor, MI 48109 USA
[4] Univ Rey Juan Carlos, Data Complex Networks & Cybersecur Res Inst, Madrid 28028, Spain
关键词
D O I
10.1063/5.0203824
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we explore the PageRank of temporal networks (networks that evolve with time) with time-dependent personalization vectors. We consider both continuous and discrete time intervals and show that the PageRank of a continuous-temporal network can be nicely estimated by the PageRanks of the discrete-temporal networks arising after sampling. Additionally, precise boundaries are given for the estimated influence of the personalization vector on the ranking of a particular node. All ingredients in the classic PageRank definition, namely, the normalized matrix collecting the topology of the network, the damping factor, and the personalization vector are allowed, to the best of our knowledge, for the first time in the literature to vary independently with time. The theoretical results are illustrated by means of some real and synthetic examples.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Community Detection Using Time-Dependent Personalized PageRank
    Avron, Haim
    Horesh, Lior
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 1795 - 1803
  • [2] Temporal motifs in time-dependent networks
    Kovanen, Lauri
    Karsai, Marton
    Kaski, Kimmo
    Kertesz, Janos
    Saramaki, Jari
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
  • [3] On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales
    Flores, Julio
    Romance, Miguel
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 330 : 1041 - 1051
  • [4] A Dynamical System for PageRank with Time-Dependent Teleportation
    Gleich, David F.
    Rossi, Ryan A.
    INTERNET MATHEMATICS, 2014, 10 (1-2) : 188 - 217
  • [5] Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank
    Li, Yiming
    Shen, Yanyan
    Chen, Lei
    Yuan, Mingxuan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (06): : 1332 - 1345
  • [6] TIME-DEPENDENT SIMPLE TEMPORAL NETWORKS: PROPERTIES AND ALGORITHMS
    Pralet, Cedric
    Verfaillie, Gerard
    RAIRO-OPERATIONS RESEARCH, 2013, 47 (02) : 173 - 198
  • [7] Time-Dependent Simple Temporal Networks: Properties and Algorithms
    Pralet, Cedric
    Verfaillie, Gerard
    TWENTY-FOURTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2014, : 536 - 539
  • [8] Shortest paths in piecewise continuous time-dependent networks
    Dell'Amico, M.
    Iori, M.
    Pretolani, D.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (06) : 688 - 691
  • [9] Important nodes mining based on a novel personalized temporal motif pagerank algorithm in temporal networks
    Zhao, Xiuming
    Yu, Hongtao
    Zhang, Jianpeng
    Wu, Zheng
    Wu, Yiteng
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2022, 33 (12):
  • [10] Time-dependent NMR relaxation curve smoothing using a discrete continuous method
    Le Botlan, D
    REVUE DE L INSTITUT FRANCAIS DU PETROLE, 1998, 53 (04): : 483 - 487