An Effective Approach Based on Temporal Centrality Measures for Improving Temporal Network Controllability

被引:8
|
作者
Arebi, Peyman [1 ]
Fatemi, Afsaneh [2 ]
Ramezani, Reza [2 ]
机构
[1] Tech & Vocat Univ TVU, Dept Comp Engn, Tehran, Iran
[2] Univ Isfahan, Fac Comp Engn, Esfahan, Iran
关键词
Layered model method; minimal driver nodes set; network controllability; temporal centrality measures; temporal networks; COMPLEX; PREDICTION; DYNAMICS;
D O I
10.1080/01969722.2022.2159162
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Controllability on temporal complex networks is one of the most important challenges among researchers in this field. The primary purpose of network controllability is to apply inputs by selecting minimum driver nodes set (MDS) to the network components to move the network from an initial state to a final state in a limited time. The most important challenges in the controllability of temporal networks can be mentioned the high complexity of the control algorithms used in these methods as well as the high data overhead of temporal network representation models such as the layered model. In this paper, centrality measures are used as the most important characteristics of networks for network controllability. For this purpose, centrality measures have been redefined based on temporal networks and a new controllability method has been proposed based on temporal centrality measures. Then, these properties are used for selecting the minimal driver nodes set, in such a way that the network can be fully controlled using these nodes. The experimental results demonstrate that by using temporal centrality measures the execution speed of control processes is improved (57% improvement) and the overhead is not increased and also the control process has led to the same length of MDS as other conventional controllability methods, it has even been better in some cases.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
    Cimatti, Alessandro
    Michell, Andrea
    Roveri, Marco
    [J]. ARTIFICIAL INTELLIGENCE, 2015, 224 : 1 - 27
  • [22] Eigenvector Centrality Based on Inter-layer Similarity for Link Prediction in Temporal Network
    Zhang, Ting
    Zhang, Kun
    Lv, Laishui
    Li, Xun
    Cai, Ying
    [J]. JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2022, 91 (02)
  • [23] 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)
  • [24] Centrality-Based Opinion Modeling on Temporal Networks
    Eeti
    Singh, Anurag, Sr.
    Cherifi, Hocine
    [J]. IEEE ACCESS, 2020, 8 (08): : 1945 - 1961
  • [25] Improving the controllability robustness of complex temporal networks against intelligent attacks
    Zhang, Qian
    Arebi, Peyman
    [J]. JOURNAL OF COMPLEX NETWORKS, 2024, 12 (04)
  • [26] FCER Routing Using Temporal Closeness Centrality for Delay Tolerant Network
    Patel, Jay
    Shah, Hemal
    [J]. 2013 4TH NIRMA UNIVERSITY INTERNATIONAL CONFERENCE ON ENGINEERING (NUICONE 2013), 2013,
  • [27] Utilization of network centrality measures for risk based surveillance
    Selhorst, T.
    Lentz, H.
    Konschake, M.
    Kasper, M.
    Conraths, F. J.
    [J]. EPIDEMIOLOGIE ET SANTE ANIMALE, NO 59-60, 2011, 59-60 : 123 - 124
  • [28] Ranking Plant Network Nodes Based on Their Centrality Measures
    Kumar, Nilesh
    Mukhtar, M. Shahid
    [J]. ENTROPY, 2023, 25 (04)
  • [29] Network Sampling Based on Centrality Measures for Relational Classification
    Berton, Lilian
    Vega-Oliveros, Didier A.
    Valverde-Rebaza, Jorge
    da Silva, Andre Tavares
    Lopes, Alneu de Andrade
    [J]. INFORMATION MANAGEMENT AND BIG DATA, 2017, 656 : 43 - 56
  • [30] Latent based temporal optimization approach for improving the performance of collaborative filtering
    Al-Hadi, Ismail Ahmed Al-Qasem
    Sharef, Nurfadhlina Mohd
    Sulaiman, Md Nasir
    Mustapha, Norwati
    Nilashi, Mehrbakhsh
    [J]. PEERJ COMPUTER SCIENCE, 2020,