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

Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction

Author

Listed:
  • Malang, Kanokwan
  • Wang, Shuliang
  • Phaphuangwittayakul, Aniwat
  • Lv, Yuanyuan
  • Yuan, Hanning
  • Zhang, Xiuzhen

Abstract

The inherent structure and substantial information on global terrorism network are often understood by identifying influential nodes. Recently, novel node identification methods are developed from different perspectives. Each of them has trade-offs and strengths. However, the algorithms for exploring the key influential nodes have been adopted unevenly in light of network extraction research. A set of nodes that is more favorable to define the core network structure is unclear. In this paper, we, therefore, present a comparative study of node identification methods over the global terrorism network. The new insight each method contributes to identifying key influential nodes and core network structure is investigated. Six comparative methods are verified by the SIR model and monotonicity index. We further elaborate on experimental analysis by applying the critical nodes from each method to extract the skeleton network. All extracted skeletons are eventually compared with the original network in terms of node correlation and network structural-equivalence. Thus, the comparison and results not only used to reflect the potential of different methods to a particular network structure but also guide us to select a method that works best for extracting the skeleton network of real-world global terrorism.

Suggested Citation

  • Malang, Kanokwan & Wang, Shuliang & Phaphuangwittayakul, Aniwat & Lv, Yuanyuan & Yuan, Hanning & Zhang, Xiuzhen, 2020. "Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
  • Handle: RePEc:eee:phsmap:v:545:y:2020:i:c:s0378437119320990
    DOI: 10.1016/j.physa.2019.123769
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119320990
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2019.123769?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. Hanning Yuan & Yanni Han & Ning Cai & Wei An, 2018. "A Multi-Granularity Backbone Network Extraction Method Based on the Topology Potential," Complexity, Hindawi, vol. 2018, pages 1-8, October.
    2. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    3. Shuliang Wang & Wenyan Gan & Deyi Li & Deren Li, 2011. "Data Field for Hierarchical Clustering," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 7(4), pages 43-63, October.
    4. Dai, Liang & Derudder, Ben & Liu, Xingjian, 2018. "Transport network backbone extraction: A comparison of techniques," Journal of Transport Geography, Elsevier, vol. 69(C), pages 271-281.
    5. Daniel Grady & Christian Thiemann & Dirk Brockmann, 2012. "Robust classification of salient links in complex networks," Nature Communications, Nature, vol. 3(1), pages 1-10, January.
    6. Institute for Economics and Peace, 2017. "Global Peace Index 2017," Working Papers id:11991, eSocialSciences.
    7. 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.
    8. Fei, Liguo & Zhang, Qi & Deng, Yong, 2018. "Identifying influential nodes in complex networks based on the inverse-square law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1044-1059.
    9. 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.
    10. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).

    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. Ibnoulouafi, Ahmed & El Haziti, Mohamed, 2018. "Density centrality: identifying influential nodes based on area density formula," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 69-80.
    2. Liu, Qiang & Zhu, Yu-Xiao & Jia, Yan & Deng, Lu & Zhou, Bin & Zhu, Jun-Xing & Zou, Peng, 2018. "Leveraging local h-index to identify and rank influential spreaders in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 379-391.
    3. 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).
    4. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    5. 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.
    6. 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.
    7. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    8. Li, Meizhu & Zhang, Qi & Deng, Yong, 2018. "Evidential identification of influential nodes in network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 283-296.
    9. 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.
    10. Xu, Guiqiong & Meng, Lei, 2023. "A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    11. 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.
    12. Li, Chao & Wang, Li & Sun, Shiwen & Xia, Chengyi, 2018. "Identification of influential spreaders based on classified neighbors in real-world complex networks," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 512-523.
    13. Jiayu Qin & Gang Mei & Lei Xiao, 2020. "Building the Traffic Flow Network with Taxi GPS Trajectories and Its Application to Identify Urban Congestion Areas for Traffic Planning," Sustainability, MDPI, vol. 13(1), pages 1-18, December.
    14. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
    15. Sheng, Jinfang & Dai, Jinying & Wang, Bin & Duan, Guihua & Long, Jun & Zhang, Junkai & Guan, Kerong & Hu, Sheng & Chen, Long & Guan, Wanghao, 2020. "Identifying influential nodes in complex networks based on global and local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 541(C).
    16. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    17. Liu, Ying & Tang, Ming & Zhou, Tao & Do, Younghae, 2016. "Identify influential spreaders in complex networks, the role of neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 289-298.
    18. Yang, Xu-Hua & Xiong, Zhen & Ma, Fangnan & Chen, Xiaoze & Ruan, Zhongyuan & Jiang, Peng & Xu, Xinli, 2021. "Identifying influential spreaders in complex networks based on network embedding and node local centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 573(C).
    19. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    20. Xiaojian Ma & Yinghong Ma, 2019. "The Local Triangle Structure Centrality Method to Rank Nodes in Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.

    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:phsmap:v:545:y:2020:i:c:s0378437119320990. 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: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.