IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0119678.html
   My bibliography  Save this article

Rich-Cores in Networks

Author

Listed:
  • Athen Ma
  • Raúl J Mondragón

Abstract

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.

Suggested Citation

  • Athen Ma & Raúl J Mondragón, 2015. "Rich-Cores in Networks," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-13, March.
  • Handle: RePEc:plo:pone00:0119678
    DOI: 10.1371/journal.pone.0119678
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0119678
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0119678&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0119678?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
    ---><---

    References listed on IDEAS

    as
    1. V. Zlatic & G. Bianconi & A. Díaz-Guilera & D. Garlaschelli & F. Rao & G. Caldarelli, 2009. "On the rich-club effect in dense and weighted networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 67(3), pages 271-275, February.
    2. Yang-Yu Liu & Jean-Jacques Slotine & Albert-László Barabási, 2011. "Controllability of complex networks," Nature, Nature, vol. 473(7346), pages 167-173, May.
    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. Yang, Shuhui & Li, Zhongkai & Zhou, Jianlin & Gao, Yancheng & Cui, Xuefeng, 2024. "Evolving patterns of agricultural production space in China: A network-based approach," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 5(1), pages 121-134.
    2. Yao, Dongmin & Sun, Rong & Gao, Qiunan, 2022. "The network structure of the China bond market: Characteristics and explanations from trading factors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    3. Shen, Xin & Han, Yue & Li, Wenqian & Wong, Ka-Chun & Peng, Chengbin, 2021. "Finding core–periphery structures in large networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    4. Cinelli, Matteo & Ferraro, Giovanna & Iovanella, Antonio, 2018. "Rich-club ordering and the dyadic effect: Two interrelated phenomena," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 808-818.

    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. 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.
    2. 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.
    3. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    4. Ellinas, Christos & Allan, Neil & Johansson, Anders, 2016. "Project systemic risk: Application examples of a network model," International Journal of Production Economics, Elsevier, vol. 182(C), pages 50-62.
    5. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    6. Andrea Avena-Koenigsberger & Xiaoran Yan & Artemy Kolchinsky & Martijn P van den Heuvel & Patric Hagmann & Olaf Sporns, 2019. "A spectrum of routing strategies for brain networks," PLOS Computational Biology, Public Library of Science, vol. 15(3), pages 1-24, March.
    7. Bo Zhang & Jianping Yuan & J. F. Pan & Xiaoyu Wu & Jianjun Luo & Li Qiu, 2017. "Global Feedback Control for Coordinated Linear Switched Reluctance Machines Network with Full-State Observation and Internal Model Compensation," Energies, MDPI, vol. 10(12), pages 1-19, December.
    8. Meng, Tao & Duan, Gaopeng & Li, Aming & Wang, Long, 2023. "Control energy scaling for target control of complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    9. Yan Zhang & Antonios Garas & Frank Schweitzer, 2019. "Control Contribution Identifies Top Driver Nodes In Complex Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 22(07n08), pages 1-15, December.
    10. Tao Jia & Robert F Spivey & Boleslaw Szymanski & Gyorgy Korniss, 2015. "An Analysis of the Matching Hypothesis in Networks," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-12, June.
    11. Kyu-Min Lee & Jae-Suk Yang & Gunn Kim & Jaesung Lee & Kwang-Il Goh & In-mook Kim, 2011. "Impact of the Topology of Global Macroeconomic Network on the Spreading of Economic Crises," PLOS ONE, Public Library of Science, vol. 6(3), pages 1-11, March.
    12. Yang, Xu-Hua & Lou, Shun-Li & Chen, Guang & Chen, Sheng-Yong & Huang, Wei, 2013. "Scale-free networks via attaching to random neighbors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3531-3536.
    13. Zhang, Rui & Wang, Xiaomeng & Cheng, Ming & Jia, Tao, 2019. "The evolution of network controllability in growing networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 257-266.
    14. Wouter Vermeer & Otto Koppius & Peter Vervest, 2018. "The Radiation-Transmission-Reception (RTR) model of propagation: Implications for the effectiveness of network interventions," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-21, December.
    15. Henriet, Fanny & Hallegatte, Stéphane & Tabourier, Lionel, 2012. "Firm-network characteristics and economic robustness to natural disasters," Journal of Economic Dynamics and Control, Elsevier, vol. 36(1), pages 150-167.
    16. Neil Johnson & Guannan Zhao & Eric Hunsader & Jing Meng & Amith Ravindar & Spencer Carran & Brian Tivnan, 2012. "Financial black swans driven by ultrafast machine ecology," Papers 1202.1448, arXiv.org.
    17. Chen, Shi-Ming & Xu, Yun-Fei & Nie, Sen, 2017. "Robustness of network controllability in cascading failure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 536-539.
    18. Xizhe Zhang & Huaizhen Wang & Tianyang Lv, 2017. "Efficient target control of complex networks based on preferential matching," PLOS ONE, Public Library of Science, vol. 12(4), pages 1-10, April.
    19. Badhwar, Rahul & Bagler, Ganesh, 2017. "A distance constrained synaptic plasticity model of C. elegans neuronal network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 313-322.
    20. Lazaro M Sanchez-Rodriguez & Yasser Iturria-Medina & Erica A Baines & Sabela C Mallo & Mehdy Dousty & Roberto C Sotero & on behalf of The Alzheimer’s Disease Neuroimaging Initiative, 2018. "Design of optimal nonlinear network controllers for Alzheimer's disease," PLOS Computational Biology, Public Library of Science, vol. 14(5), pages 1-24, May.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0119678. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.