IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v242y2024ics0951832023006804.html
   My bibliography  Save this article

Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach

Author

Listed:
  • Huang, Wencheng
  • Li, Haoran
  • Yin, Yanhui
  • Zhang, Zhi
  • Xie, Anhao
  • Zhang, Yin
  • Cheng, Guo

Abstract

Inspiring by the theory of degree entropy, and considering both the location of the evaluated node and its neighboring nodes in an unweighted urban rail transit network (URTN), a new node identification approach called Adjacency Information Entropy (AIE) is applied to identify the importance of node in URTN. An undirected and unweighted network, a single-way directed and unweighted network, and a double-way directed and unweighted network are constructed as the background of the numerical study, some other previous approaches are used as the comparison algorithms. Finally, based on the double-way directed and unweighted network topology of Chengdu Metro, a real-world case study is conducted. We find that: (i) For a node in a directed and unweighted network, as long as the in-degree and out-degree of a node are not both 0, then the node can be identified based on AIE. (ii) For a double-way directed and unweighted network, if a node has higher node degree and higher Adjacency Degree, then it is more important in the network. (iii) If a node has high AIE in the entire topology of URTN, then it generates connections among non-adjacent nodes.

Suggested Citation

  • Huang, Wencheng & Li, Haoran & Yin, Yanhui & Zhang, Zhi & Xie, Anhao & Zhang, Yin & Cheng, Guo, 2024. "Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    • Handle: RePEc:eee:reensy:v:242:y:2024:i:c:s0951832023006804
    DOI: 10.1016/j.ress.2023.109766
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0951832023006804
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2023.109766?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhong, Haonan & Mahdavi Pajouh, Foad & Prokopyev, Oleg A., 2021. "Finding influential groups in networked systems: The most degree-central clique problem," Omega, Elsevier, vol. 101(C).
    2. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    3. Tabandeh, Armin & Sharma, Neetesh & Gardoni, Paolo, 2022. "Uncertainty propagation in risk and resilience analysis of hierarchical systems," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    4. Liu, Jian-Guo & Ren, Zhuo-Ming & Guo, Qiang, 2013. "Ranking the spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4154-4159.
    5. Latora, Vito & Marchiori, Massimo, 2002. "Is the Boston subway a small-world network?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 109-113.
    6. Bartesaghi, Paolo & Clemente, Gian Paolo & Grassi, Rosanna, 2023. "Clustering coefficients as measures of the complex interactions in a directed weighted multilayer network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 610(C).
    7. Meng, Xueyu & Han, Sijie & Wu, Leilei & Si, Shubin & Cai, Zhiqiang, 2022. "Analysis of epidemic vaccination strategies by node importance and evolutionary game on complex networks," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    8. Cheung, Kam-Fung & Bell, Michael G.H. & Pan, Jing-Jing & Perera, Supun, 2020. "An eigenvector centrality analysis of world container shipping network connectivity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    9. Huang, Wencheng & Li, Linqing & Liu, Hongyi & Zhang, Rui & Xu, Minhao, 2021. "Defense resource allocation in road dangerous goods transportation network: A Self-Contained Girvan-Newman Algorithm and Mean Variance Model combined approach," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    10. Wang, Yuhong & Cullinane, Kevin, 2016. "Determinants of port centrality in maritime container transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 326-340.
    11. Bae, Joonhyun & Kim, Sangwook, 2014. "Identifying and ranking influential spreaders in complex networks by neighborhood coreness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 549-559.
    12. Hou, Bonan & Yao, Yiping & Liao, Dongsheng, 2012. "Identifying all-around nodes for spreading dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(15), pages 4012-4017.
    13. Kang, Won-Hee & Song, Junho & Gardoni, Paolo, 2008. "Matrix-based system reliability method and applications to bridge networks," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1584-1593.
    14. Wang, Ning & Gao, Ying & He, Jia-tao & Yang, Jun, 2022. "Robustness evaluation of the air cargo network considering node importance and attack cost," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    15. Zhang, Xu & Zhang, Wei & Lee, Paul Tae-Woo, 2020. "Importance rankings of nodes in the China Railway Express network under the Belt and Road Initiative," Transportation Research Part A: Policy and Practice, Elsevier, vol. 139(C), pages 134-147.
    16. Hu, Ping & Fan, Wenli & Mei, Shengwei, 2015. "Identifying node importance in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 429(C), pages 169-176.
    17. Li, Zhifang & Hu, Yanqing & Xu, Beishan & Di, Zengru & Fan, Ying, 2012. "Detecting the optimal number of communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1770-1776.
    18. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    19. Liu, Shuli & Wan, Yulai & Ha, Hun-Koo & Yoshida, Yuichiro & Zhang, Anming, 2019. "Impact of high-speed rail network development on airport traffic and traffic distribution: Evidence from China and Japan," Transportation Research Part A: Policy and Practice, Elsevier, vol. 127(C), pages 115-135.
    20. Hao, Yucheng & Wang, Yanhui & Jia, Limin & He, Zhichao, 2020. "Cascading failures in networks with the harmonic closeness under edge attack strategies," Chaos, Solitons & Fractals, Elsevier, vol. 135(C).
    21. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    22. Guo, Xin & Wu, Jianjun & Sun, Huijun & Yang, Xin & Jin, Jian Gang & Wang, David Z.W., 2020. "Scheduling synchronization in urban rail transit networks: Trade-offs between transfer passenger and last train operation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 138(C), pages 463-490.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    2. Yeruva, Sujatha & Devi, T. & Reddy, Y. Samtha, 2016. "Selection of influential spreaders in complex networks using Pareto Shell decomposition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 133-144.
    3. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
    4. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    5. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    6. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    7. Bao, Zhong-Kui & Ma, Chuang & Xiang, Bing-Bing & Zhang, Hai-Feng, 2017. "Identification of influential nodes in complex networks: Method from spreading probability viewpoint," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 391-397.
    8. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.
    9. Ma, Tinghuai & Yue, Mingliang & Qu, Jingjing & Tian, Yuan & Al-Dhelaan, Abdullah & Al-Rodhaan, Mznah, 2018. "PSPLPA: Probability and similarity based parallel label propagation algorithm on spark," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 366-378.
    10. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    11. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    12. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    13. Fu, Yu-Hsiang & Huang, Chung-Yuan & Sun, Chuen-Tsai, 2015. "Using global diversity and local topology features to identify influential network spreaders," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 344-355.
    14. Liu, Jun & Xiong, Qingyu & Shi, Weiren & Shi, Xin & Wang, Kai, 2016. "Evaluating the importance of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 209-219.
    15. Bae, Joonhyun & Kim, Sangwook, 2014. "Identifying and ranking influential spreaders in complex networks by neighborhood coreness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 549-559.
    16. Ma, Qian & Ma, Jun, 2017. "Identifying and ranking influential spreaders in complex networks with consideration of spreading probability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 312-330.
    17. Li, Qian & Zhou, Tao & Lü, Linyuan & Chen, Duanbing, 2014. "Identifying influential spreaders by weighted LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 47-55.
    18. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    19. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    20. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:reensy:v:242:y:2024:i:c:s0951832023006804. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/reliability-engineering-and-system-safety .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.