IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i18p2898-d1479847.html
   My bibliography  Save this article

A Study on Linguistic Z-Graph and Its Application in Social Networks

Author

Listed:
  • Rupkumar Mahapatra

    (Department of Applied Mathematics, Vidyasagar University, Midnapore 721102, West Bengal, India)

  • Sovan Samanta

    (Department of Technical Sciences, Western Caspian University, Baku AZ1001, Azerbaijan
    Department of Mathematics, Tamralipta Mahavidyalaya, Tamluk 721636, West Bengal, India
    Research Center of Performance and Productivity Analysis, Istinye University, Istanbul 34396, Türkiye
    Department of Technical Sciences, Algebra University, Gradiscanska 24, 10000 Zagreb, Croatia)

  • Madhumangal Pal

    (Department of Applied Mathematics, Vidyasagar University, Midnapore 721102, West Bengal, India
    Department of Mathematics and Innovation, Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, Chennai 602105, Tamilnadu, India)

  • Tofigh Allahviranloo

    (Research Center of Performance and Productivity Analysis, Istinye University, Istanbul 34396, Türkiye
    Quantum Technologies Research Center (QTRC), Science and Research Branch, Islamic Azad University, Tehran 1477893855, Iran)

  • Antonios Kalampakas

    (College of Engineering and Technology, American University of the Middle East, Egaila 54200, Kuwait)

Abstract

This paper presents a comprehensive study of the linguistic Z-graph, which is a novel framework designed to analyze linguistic structures within social networks. By integrating concepts from graph theory and linguistics, the linguistic Z-graph provides a detailed understanding of language dynamics in online communities. This study highlights the practical applications of linguistic Z-graphs in identifying central nodes within social networks, which are crucial for online businesses in market capture and information dissemination. Traditional methods for identifying central nodes rely on direct connections, but social network connections often exhibit uncertainty. This paper focuses on using fuzzy theory, particularly linguistic Z-graphs, to address this uncertainty, offering more detailed insights compared to fuzzy graphs. Our study introduces a new centrality measure using linguistic Z-graphs, enhancing our understanding of social network structures.

Suggested Citation

  • Rupkumar Mahapatra & Sovan Samanta & Madhumangal Pal & Tofigh Allahviranloo & Antonios Kalampakas, 2024. "A Study on Linguistic Z-Graph and Its Application in Social Networks," Mathematics, MDPI, vol. 12(18), pages 1-24, September.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2898-:d:1479847
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2898/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/18/2898/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chao Song & Jian-Qiang Wang & Jun-Bo Li, 2020. "New Framework for Quality Function Deployment Using Linguistic Z-Numbers," Mathematics, MDPI, vol. 8(2), pages 1-20, February.
    2. Amir Hosein Mahmoodi & Seyed Jafar Sadjadi & Soheil Sadi-Nezhad & Roya Soltani & Farzad Movahedi Sobhani, 2020. "Linguistic Z-number weighted averaging operators and their application to portfolio selection problem," PLOS ONE, Public Library of Science, vol. 15(1), pages 1-34, January.
    3. Rupkumar Mahapatra & Sovan Samanta & Madhumangal Pal & Anibal Coronel, 2022. "Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-8, July.
    4. Pierre Hansen & Julio Kuplinsky & Dominique Werra, 1997. "Mixed graph colorings," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(1), pages 145-160, February.
    5. 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.
    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. Luo, Mengzhuo & Liu, Xinzhi & Zhong, Shouming & Cheng, Jun, 2018. "Synchronization of multi-stochastic-link complex networks via aperiodically intermittent control with two different switched periods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 20-38.
    2. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    3. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    4. Yang, Ming-Yuan & Wang, Chengjin & Wu, Zhen-Guo & Wu, Xin & Zheng, Chengsi, 2023. "Influential risk spreaders and their contribution to the systemic risk in the cryptocurrency network," Finance Research Letters, Elsevier, vol. 57(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. Pejman Peykani & Mojtaba Nouri & Mir Saman Pishvaee & Camelia Oprean-Stan & Emran Mohammadi, 2023. "Credibilistic Multi-Period Mean-Entropy Rolling Portfolio Optimization Problem Based on Multi-Stage Scenario Tree," Mathematics, MDPI, vol. 11(18), pages 1-23, September.
    8. Wang, Jing & Ma, Xiao-Jing & Xiang, Bing-Bing & Bao, Zhong-Kui & Zhang, Hai-Feng, 2022. "Maximizing influence in social networks by distinguishing the roles of seeds," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    9. 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.
    10. Peter Damaschke, 2019. "Parameterized Mixed Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 362-374, August.
    11. Chi, Kuo & Qu, Hui & Yin, Guisheng, 2022. "Link prediction for existing links in dynamic networks based on the attraction force," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    12. Hua Nam Son, 2016. "On the modelling of structured organizations," Logisztika - Informatika - Menedzsment, Budapest Business School, vol. 2016(1), pages 59-69.
    13. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    14. Qu, Hongbo & Song, Yu-Rong & Li, Ruqi & Li, Min, 2023. "GNR: A universal and efficient node ranking model for various tasks based on graph neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P2).
    15. 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.
    16. Tao, Li & Kong, Shengzhou & He, Langzhou & Zhang, Fan & Li, Xianghua & Jia, Tao & Han, Zhen, 2022. "A sequential-path tree-based centrality for identifying influential spreaders in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).
    17. 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.
    18. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    19. 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.
    20. 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.

    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:gam:jmathe:v:12:y:2024:i:18:p:2898-:d:1479847. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.