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 条
  • [41] MINIMUM WEIGHT PATHS IN TIME-DEPENDENT NETWORKS
    ORDA, A
    ROM, R
    NETWORKS, 1991, 21 (03) : 295 - 319
  • [42] Diffusion in Networks with Time-Dependent Transmission Conditions
    Wolfgang Arendt
    Dominik Dier
    Marjeta Kramar Fijavž
    Applied Mathematics & Optimization, 2014, 69 : 315 - 336
  • [43] Ranking paths in stochastic time-dependent networks
    Nielsen, Lars Relund
    Andersen, Kim Allan
    Pretolani, Daniele
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) : 903 - 914
  • [44] Shortest Paths in Time-Dependent FIFO Networks
    Dehne, Frank
    Omran, Masoud T.
    Sack, Joerg-Ruediger
    ALGORITHMICA, 2012, 62 (1-2) : 416 - 435
  • [45] Shortest Paths in Time-Dependent FIFO Networks
    Frank Dehne
    Masoud T. Omran
    Jörg-Rüdiger Sack
    Algorithmica, 2012, 62 : 416 - 435
  • [46] Bidirectional A* Search on Time-Dependent Road Networks
    Nannicini, Giacomo
    Delling, Daniel
    Schultes, Dominik
    Liberti, Leo
    NETWORKS, 2012, 59 (02) : 240 - 251
  • [47] Inference of time-dependent causal influences in Networks
    Killmann, M.
    Sommerlade, L.
    Mader, W.
    Timmer, J.
    Schelter, B.
    BIOMEDICAL ENGINEERING-BIOMEDIZINISCHE TECHNIK, 2012, 57 : 387 - 390
  • [48] Time-dependent performance analysis of a discrete-time priority queue
    Walraevens, Joris
    Fiems, Dieter
    Bruneel, Herwig
    PERFORMANCE EVALUATION, 2008, 65 (09) : 641 - 652
  • [49] Time-dependent statistical failure of fiber networks
    Mattsson, Amanda
    Uesaka, Tetsu
    PHYSICAL REVIEW E, 2015, 92 (04):
  • [50] Diffusion in Networks with Time-Dependent Transmission Conditions
    Arendt, Wolfgang
    Dier, Dominik
    Fijavz, Marjeta Kramar
    APPLIED MATHEMATICS AND OPTIMIZATION, 2014, 69 (02): : 315 - 336