A control analysis perspective on Katz centrality

被引:0
|
作者
Kieran J. Sharkey
机构
[1] Department of Mathematical Sciences,
[2] University of Liverpool,undefined
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Methods for efficiently controlling dynamics propagated on networks are usually based on identifying the most influential nodes. Knowledge of these nodes can be used for the targeted control of dynamics such as epidemics, or for modifying biochemical pathways relating to diseases. Similarly they are valuable for identifying points of failure to increase network resilience in, for example, social support networks and logistics networks. Many measures, often termed ‘centrality’, have been constructed to achieve these aims. Here we consider Katz centrality and provide a new interpretation as a steady-state solution to continuous-time dynamics. This enables us to implement a sensitivity analysis which is similar to metabolic control analysis used in the analysis of biochemical pathways. The results yield a centrality which quantifies, for each node, the net impact of its absence from the network. It also has the desirable property of requiring a node with a high centrality to play a central role in propagating the dynamics of the system by having the capacity to both receive flux from others and then to pass it on. This new perspective on Katz centrality is important for a more comprehensive analysis of directed networks.
引用
收藏
相关论文
共 50 条
  • [1] A control analysis perspective on Katz centrality
    Sharkey, Kieran J.
    SCIENTIFIC REPORTS, 2017, 7
  • [2] Katz Centrality of Markovian Temporal Networks: Analysis and Optimization
    Ogura, Masaki
    Preciado, Victor M.
    2017 AMERICAN CONTROL CONFERENCE (ACC), 2017, : 5001 - 5006
  • [3] Identifying Node Importance by Combining Betweenness Centrality and Katz Centrality
    Zhang, Yanping
    Bao, Yuanyuan
    Zhao, Shu
    Chen, Jie
    Tang, Jie
    2015 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CCBD), 2015, : 354 - 357
  • [4] Identifying Node Importance by Combining Betweenness Centrality and Katz Centrality
    Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei
    Anhui Province
    230606, China
    不详
    Anhui Province
    230601, China
    不详
    100084, China
    Proc. - Int. Conf. Cloud Comput. Big Data, CCBD, (354-357):
  • [5] Concurrent Katz Centrality for Streaming Graphs
    Yin, Chunxing
    Riedy, Jason
    2019 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2019,
  • [6] Incrementally updating Katz centrality in dynamic graphs
    Nathan, Eisha
    Bader, David A.
    SOCIAL NETWORK ANALYSIS AND MINING, 2018, 8 (01)
  • [7] Approximating Personalized Katz Centrality in Dynamic Graphs
    Nathan, Eisha
    Bader, David A.
    PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2017), PT I, 2018, 10777 : 290 - 302
  • [8] Efficient computation of Katz centrality for very dense networks via negative parameter Katz
    Noferini, Vanni
    Wood, Ryan
    JOURNAL OF COMPLEX NETWORKS, 2024, 12 (05)
  • [9] Graph Ranking Guarantees for Numerical Approximations to Katz Centrality
    Nathan, Eisha
    Sanders, Geoffrey
    Fairbanks, James
    Henson, Van Emden
    Bader, David A.
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (ICCS 2017), 2017, 108 : 68 - 78
  • [10] Connected Model for Opportunistic Sensor Network Based on Katz Centrality
    Shu, Jian
    Xu, Lei
    Jiang, Shandong
    Meng, Lingchong
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2017, 14 (03) : 735 - 750