Separating temporal and topological effects in walk-based network centrality

被引:1
|
作者
Colman, Ewan R. [1 ]
Charlton, Nathaniel [2 ]
机构
[1] Georgetown Univ, Dept Biol, Washington, DC 20057 USA
[2] CountingLab Ltd, Reading RG6 6AX, Berks, England
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.1103/PhysRevE.94.012313
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The recently introduced concept of dynamic communicability is a valuable tool for ranking the importance of nodes in a temporal network. Two metrics, broadcast score and receive score, were introduced to measure the centrality of a node with respect to a model of contagion based on time-respecting walks. This article examines the temporal and structural factors influencing these metrics by considering a versatile stochastic temporal network model. We analytically derive formulas to accurately predict the expectation of the broadcast and receive scores when one or more columns in a temporal edge-list are shuffled. These methods are then applied to two publicly available data sets and we quantify how much the centrality of each individual depends on structural or temporal influences. From our analysis, we highlight two practical contributions: a way to control for temporal variation when computing dynamic communicability and the conclusion that the broadcast and receive scores can, under a range of circumstances, be replaced by the row and column sums of the matrix exponential of a weighted adjacency matrix given by the data.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] PageRank centrality with non-local random walk-based teleportation
    Bowater, David
    Stefanakis, Emmanuel
    [J]. JOURNAL OF COMPLEX NETWORKS, 2023, 11 (04)
  • [2] A random walk-based method for detecting essential proteins by integrating the topological and biological features of PPI network
    Ahmed, Nahla Mohamed
    Chen, Ling
    Li, Bin
    Liu, Wei
    Dai, Caiyan
    [J]. SOFT COMPUTING, 2021, 25 (14) : 8883 - 8903
  • [3] A random walk-based method for detecting essential proteins by integrating the topological and biological features of PPI network
    Nahla Mohamed Ahmed
    Ling Chen
    Bin Li
    Wei Liu
    Caiyan Dai
    [J]. Soft Computing, 2021, 25 : 8883 - 8903
  • [4] A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
    Lu, Neng-Pin
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 2021, 45 (01): : 51 - 64
  • [5] Temporal walk based centrality metric for graph streams
    Béres F.
    Pálovics R.
    Oláh A.
    Benczúr A.A.
    [J]. Béres, Ferenc (beres@sztaki.hu), 2018, Springer Science and Business Media Deutschland GmbH (03)
  • [6] A Deep Dive Into Understanding The Random Walk-Based Temporal Graph Learning
    Talati, Nishil
    Jin, Di
    Yet, Haojie
    Brahmakshatriya, Ajay
    Dasika, Ganesh
    Amarasinghe, Saman
    Mudge, Trevor
    Koutra, Danai
    Dreslinski, Ronald
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON WORKLOAD CHARACTERIZATION (IISWC 2021), 2021, : 87 - 100
  • [7] Evaluating Random Walk-Based Network Embeddings for Web Service Applications
    Adeleye, Olayinka
    Ye, Jian
    Ruan, Ji
    Sheng, Quan Z.
    [J]. DATABASES THEORY AND APPLICATIONS, ADC 2020, 2020, 12008 : 198 - 205
  • [8] Estimating Walk-Based Similarities Using Random Walk
    Murai, Shogo
    Yoshida, Yuichi
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 1321 - 1331
  • [9] Semantic Concept Network and Deep Walk-based Visual Question Answering
    Li, Qun
    Xiao, Fu
    An, Le
    Long, Xianzhong
    Sun, Xiaochuan
    [J]. ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2019, 15 (02)
  • [10] Random walk centrality for temporal networks
    Rocha, Luis E. C.
    Masuda, Naoki
    [J]. NEW JOURNAL OF PHYSICS, 2014, 16