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

Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks

Author

Listed:
  • Tuğal, İhsan
  • Karcı, Ali

Abstract

In order to measure the amount of different information in a system, entropy concept can be used. Graph entropy measures nodes’ contribution to the entropy of the graph. By this way, the influential actors can be identified. Due to this case, a new entropy-based method was proposed to identify the influential actors. Karcı entropy was applied to the social networks first time. The alpha parameter allowed us to combine many different conditions together when measuring in the network. The other important contribution of this paper is to predict the value of alpha parameter of Karcı entropy by using fuzzy logic. After that Karcı and Shannon entropies were compared based on experimental results. Moreover, Karcı entropy was compared to traditional centrality measures. If Karcı entropy definition is considered as a set of entropies, Shannon entropy can be regarded as an element of this set. Accordingly, it can be concluded that Karcı entropy is superior to Shannon entropy.

Suggested Citation

  • Tuğal, İhsan & Karcı, Ali, 2019. "Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 352-363.
    • Handle: RePEc:eee:phsmap:v:523:y:2019:i:c:p:352-363
    DOI: 10.1016/j.physa.2019.02.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119301797
    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.02.026?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. Nie, Tingyuan & Guo, Zheng & Zhao, Kun & Lu, Zhe-Ming, 2016. "Using mapping entropy to identify node centrality in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 290-297.
    2. Kim, Jongkwang & Wilhelm, Thomas, 2008. "What is a complex graph?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(11), pages 2637-2652.
    3. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    4. Claussen, Jens Christian, 2007. "Offdiagonal complexity: A computationally quick complexity measure for graphs and networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(1), pages 365-373.
    5. Fei, Liguo & Deng, Yong, 2017. "A new method to identify influential nodes based on relative entropy," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 257-267.
    6. Shuguang Suo & Yu Chen, 2008. "The Dynamics of Public Opinion in Complex Networks," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 11(4), pages 1-2.
    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. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
    2. Frank Emmert-Streib, 2013. "Structural Properties and Complexity of a New Network Class: Collatz Step Graphs," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-14, February.
    3. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    4. 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.
    5. 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.
    6. Andreas Koulouris & Ioannis Katerelos & Theodore Tsekeris, 2013. "Multi-Equilibria Regulation Agent-Based Model of Opinion Dynamics in Social Networks," Interdisciplinary Description of Complex Systems - scientific journal, Croatian Interdisciplinary Society Provider Homepage: http://indecs.eu, vol. 11(1), pages 51-70.
    7. Chaharborj, Sarkhosh Seddighi & Nabi, Khondoker Nazmoon & Feng, Koo Lee & Chaharborj, Shahriar Seddighi & Phang, Pei See, 2022. "Controlling COVID-19 transmission with isolation of influential nodes," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    8. Gao, Cai & Yan, Chao & Zhang, Zili & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "An amoeboid algorithm for solving linear transportation problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 398(C), pages 179-186.
    9. Wang, Feifei & Sun, Zejun & Gan, Quan & Fan, Aiwan & Shi, Hesheng & Hu, Haifeng, 2022. "Influential node identification by aggregating local structure information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    10. Vahan Mkrtchyan & Hovhannes Sargsyan, 2018. "A tight lower bound for the hardness of clutters," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 21-25, January.
    11. Mehmet N. Aydin & N. Ziya Perdahci, 2019. "Dynamic network analysis of online interactive platform," Information Systems Frontiers, Springer, vol. 21(2), pages 229-240, April.
    12. Tornyeviadzi, Hoese Michel & Owusu-Ansah, Emmanuel & Mohammed, Hadi & Seidu, Razak, 2022. "A systematic framework for dynamic nodal vulnerability assessment of water distribution networks based on multilayer networks," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    13. Mahmoud Saleh & Yusef Esa & Ahmed Mohamed, 2018. "Applications of Complex Network Analysis in Electric Power Systems," Energies, MDPI, vol. 11(6), pages 1-16, May.
    14. Liu, Jia-Bao & Zheng, Ya-Qian & Lee, Chien-Chiang, 2024. "Statistical analysis of the regional air quality index of Yangtze River Delta based on complex network theory," Applied Energy, Elsevier, vol. 357(C).
    15. Yu, Hui & Cao, Xi & Liu, Zun & Li, Yongjun, 2017. "Identifying key nodes based on improved structural holes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 318-327.
    16. da Cunha, Éverton Fernandes & da Fontoura Costa, Luciano, 2022. "On hypercomplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    17. Curado, Manuel & Rodriguez, Rocio & Tortosa, Leandro & Vicent, Jose F., 2022. "Anew centrality measure in dense networks based on two-way random walk betweenness," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    18. Roanes-Lozano, Eugenio & Laita, Luis M. & Roanes-Macías, Eugenio & Wester, Michael J. & Ruiz-Lozano, José Luis & Roncero, Carlos, 2009. "Evolution of railway network flexibility: The Spanish broad gauge case," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(8), pages 2317-2332.
    19. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    20. Nasrolahzadeh, Mahda & Mohammadpoory, Zeynab & Haddadnia, Javad, 2023. "Indices from visibility graph complexity of spontaneous speech signal: An efficient nonlinear tool for Alzheimer's disease diagnosis," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).

    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:523:y:2019:i:c:p:352-363. 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.