IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v101y2017icp50-67.html
   My bibliography  Save this article

Systematic evaluation of a new combinatorial curvature for complex networks

Author

Listed:
  • Sreejith, R.P.
  • Jost, Jürgen
  • Saucan, Emil
  • Samal, Areejit

Abstract

We have recently introduced Forman’s discretization of Ricci curvature to the realm of complex networks. Forman curvature is an edge-based measure whose mathematical definition elegantly encapsulates the weights of nodes and edges in a complex network. In this contribution, we perform a comparative analysis of Forman curvature with other edge-based measures such as edge betweenness, embeddedness and dispersion in diverse model and real networks. We find that Forman curvature in comparison to embeddedness or dispersion is a better indicator of the importance of an edge for the large-scale connectivity of complex networks. Based on the definition of the Forman curvature of edges, there are two natural ways to define the Forman curvature of nodes in a network. In this contribution, we also examine these two possible definitions of Forman curvature of nodes in diverse model and real networks. Based on our empirical analysis, we find that in practice the unnormalized definition of the Forman curvature of nodes with the choice of combinatorial node weights is a better indicator of the importance of nodes in complex networks.

Suggested Citation

  • Sreejith, R.P. & Jost, Jürgen & Saucan, Emil & Samal, Areejit, 2017. "Systematic evaluation of a new combinatorial curvature for complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 101(C), pages 50-67.
  • Handle: RePEc:eee:chsofr:v:101:y:2017:i:c:p:50-67
    DOI: 10.1016/j.chaos.2017.05.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077917302102
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2017.05.021?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. Mehatari, Ranjit & Banerjee, Anirban, 2015. "Effect on normalized graph Laplacian spectrum by motif attachment and duplication," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 382-387.
    2. L. Šubelj & M. Bajec, 2011. "Robust network community detection using balanced propagation," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 81(3), pages 353-362, June.
    3. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    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. Xinyu Wang & Liang Zhao & Ning Zhang & Liu Feng & Haibo Lin, 2022. "Stability of China's Stock Market: Measure and Forecast by Ricci Curvature on Network," Papers 2204.06692, arXiv.org.
    2. Jiang, Haotong & Zhao, Mingen & Zhang, Zirui & Luo, Tianyuan, 2023. "Evaluating financial contagion through Ricci curvature on multivariate reactive point processes," Finance Research Letters, Elsevier, vol. 58(PA).
    3. Nazanin Azarhooshang & Prithviraj Sengupta & Bhaskar DasGupta, 2020. "A Review of and Some Results for Ollivier–Ricci Network Curvature," Mathematics, MDPI, vol. 8(9), pages 1-11, August.
    4. Saucan, Emil & Sreejith, R.P. & Vivek-Ananth, R.P. & Jost, Jürgen & Samal, Areejit, 2019. "Discrete Ricci curvatures for directed networks," Chaos, Solitons & Fractals, Elsevier, vol. 118(C), pages 347-360.

    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. 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.
    2. Natarajan Meghanathan, 2019. "Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    3. Zareie, Ahmad & Sheikhahmadi, Amir & Fatemi, Adel, 2017. "Influential nodes ranking in complex networks: An entropy-based approach," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 485-494.
    4. Zhou, Andu & Maletić, Slobodan & Zhao, Yi, 2018. "Robustness and percolation of holes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 459-468.
    5. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    6. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    7. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    8. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(4), pages 957-986, December.
    9. 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.
    10. 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.
    11. Saucan, Emil & Sreejith, R.P. & Vivek-Ananth, R.P. & Jost, Jürgen & Samal, Areejit, 2019. "Discrete Ricci curvatures for directed networks," Chaos, Solitons & Fractals, Elsevier, vol. 118(C), pages 347-360.
    12. Hu, Fang & Liu, Jia & Li, Liuhuan & Liang, Jun, 2020. "Community detection in complex networks using Node2vec with spectral clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    13. Xu, Shuang & Wang, Pei, 2017. "Identifying important nodes by adaptive LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 654-664.
    14. Rosenberg, Eric, 2018. "Generalized Hausdorff dimensions of a complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 511(C), pages 1-17.
    15. Antiqueira, L. & Nunes, M.G.V. & Oliveira Jr., O.N. & F. Costa, L. da, 2007. "Strong correlations between text quality and complex networks features," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 373(C), pages 811-820.
    16. 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).
    17. Su, Zhen & Liu, Fanzhen & Gao, Chao & Gao, Shupeng & Li, Xianghua, 2018. "Inferring infection rate based on observations in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 107(C), pages 170-176.
    18. Šubelj, Lovro & Bajec, Marko, 2011. "Community structure of complex software systems: Analysis and applications," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(16), pages 2968-2975.
    19. Li, Xiaojia & Li, Menghui & Hu, Yanqing & Di, Zengru & Fan, Ying, 2010. "Detecting community structure from coherent oscillation of excitable systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(1), pages 164-170.
    20. Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).

    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:chsofr:v:101:y:2017:i:c:p:50-67. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.