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

Group based centrality for immunization of complex networks

Author

Listed:
  • Saxena, Chandni
  • Doja, M.N.
  • Ahmad, Tanvir

Abstract

Network immunization is an extensively recognized issue in several domains like virtual network security, public health and social media, to deal with the problem of node inoculation so as to minimize the transmission through the links existed in these networks. We aim to identify top ranked nodes to immunize networks, leading to control the outbreak of epidemics or misinformation. We consider group based centrality and define a heuristic objective criteria to establish the target of key nodes finding in network which if immunized result in essential network vulnerability. We propose a group based game theoretic payoff division approach, by employing Shapley value to assign the surplus acquired by participating nodes in different groups through the positional power and functional influence over other nodes. We tag these key nodes as Shapley Value based Information Delimiters (SVID). Experiments on empirical datasets and model networks establish the efficacy of our proposed approach and acknowledge performance of node inoculation to delimit contagion outbreak.

Suggested Citation

  • Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2018. "Group based centrality for immunization of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 35-47.
  • Handle: RePEc:eee:phsmap:v:508:y:2018:i:c:p:35-47
    DOI: 10.1016/j.physa.2018.05.107
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118306368
    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.2018.05.107?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-Yuan Jiang & Man-Gui Liang, 2012. "Improved Efficient Routing Strategy On Scale-Free Networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 23(02), pages 1-11.
    2. 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.
    3. Marcel Salathé & James H Jones, 2010. "Dynamics and Control of Diseases in Networks with Community Structure," PLOS Computational Biology, Public Library of Science, vol. 6(4), pages 1-11, April.
    4. Xiaotie Deng & Christos H. Papadimitriou, 1994. "On the Complexity of Cooperative Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 257-266, May.
    5. Gupta, Naveen & Singh, Anurag & Cherifi, Hocine, 2016. "Centrality measures for networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 46-59.
    6. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    7. Shapley, L. S. & Shubik, Martin, 1954. "A Method for Evaluating the Distribution of Power in a Committee System," American Political Science Review, Cambridge University Press, vol. 48(3), pages 787-792, September.
    8. Dangalchev, Chavdar, 2006. "Residual closeness in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 365(2), pages 556-564.
    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. Ahmad, Amreen & Ahmad, Tanvir & Bhatt, Abhishek, 2020. "HWSMCB: A community-based hybrid approach for identifying influential nodes in the social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    2. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2020. "Entropy based flow transfer for influence dissemination in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    3. Jiaqi Ren & Jin Liu & Yibo Dong & Zhe Li & Weili Li, 2024. "NIGA: A Novel Method for Investigating the Attacker–Defender Model within Critical Infrastructure Networks," Mathematics, MDPI, vol. 12(16), pages 1-24, August.

    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. Chen, Dandan & Zheng, Muhua & Zhao, Ming & Zhang, Yu, 2018. "A dynamic vaccination strategy to suppress the recurrent epidemic outbreaks," Chaos, Solitons & Fractals, Elsevier, vol. 113(C), pages 108-114.
    2. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    3. Meinhardt, Holger Ingmar, 2021. "Disentangle the Florentine Families Network by the Pre-Kernel," MPRA Paper 106482, University Library of Munich, Germany.
    4. Benati, Stefano & Rizzi, Romeo & Tovey, Craig, 2015. "The complexity of power indexes with graph restricted coalitions," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 53-63.
    5. Tanaka, Masato & Matsui, Tomomi, 2022. "Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games," Mathematical Social Sciences, Elsevier, vol. 115(C), pages 47-51.
    6. Hamers, Herbert & Husslage, Bart & Lindelauf, R. & Campen, Tjeerd, 2016. "A New Approximation Method for the Shapley Value Applied to the WTC 9/11 Terrorist Attack," Other publications TiSEM 8a67b416-1091-4efe-a1a6-7, Tilburg University, School of Economics and Management.
    7. Kar, Anirban & Mitra, Manipushpak & Mutuswami, Suresh, 2009. "On the coincidence of the prenucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 16-25, January.
    8. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
    9. Meisam Akbarzadeh & Soroush Memarmontazerin & Sybil Derrible & Sayed Farzin Salehi Reihani, 2019. "The role of travel demand and network centrality on the connectivity and resilience of an urban street system," Transportation, Springer, vol. 46(4), pages 1127-1141, August.
    10. Hamers, Herbert & Husslage, Bart & Lindelauf, R. & Campen, Tjeerd, 2016. "A New Approximation Method for the Shapley Value Applied to the WTC 9/11 Terrorist Attack," Discussion Paper 2016-042, Tilburg University, Center for Economic Research.
    11. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2020. "Efficient computation of the Shapley value for large-scale linear production games," Annals of Operations Research, Springer, vol. 287(2), pages 761-781, April.
    12. 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.
    13. Chen, Peng & Qi, Mingze & Yan, Liang & Duan, Xiaojun, 2024. "Diffusion capacity analysis of complex network based on the cluster distribution," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).
    14. Yuto Ushioda & Masato Tanaka & Tomomi Matsui, 2022. "Monte Carlo Methods for the Shapley–Shubik Power Index," Games, MDPI, vol. 13(3), pages 1-14, June.
    15. 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.
    16. de Keijzer, B. & Klos, T.B. & Zhang, Y., 2012. "Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration," ERIM Report Series Research in Management ERS-2012-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Zhao, Narisa & Cui, Xuelian, 2017. "Impact of individual interest shift on information dissemination in modular networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 232-242.
    18. Adil Baykasoğlu & Burcu Kubur Özbel, 2021. "Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty," Operational Research, Springer, vol. 21(3), pages 2149-2179, September.
    19. Deniz Aksoy, 2010. "Who gets what, when, and how revisited: Voting and proposal powers in the allocation of the EU budget," European Union Politics, , vol. 11(2), pages 171-194, June.
    20. Laruelle, Annick & Valenciano, Federico, 2008. "Noncooperative foundations of bargaining power in committees and the Shapley-Shubik index," Games and Economic Behavior, Elsevier, vol. 63(1), pages 341-353, May.

    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:508:y:2018:i:c:p:35-47. 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.