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

A New Measure of Centrality for Brain Networks

Author

Listed:
  • Karen E Joyce
  • Paul J Laurienti
  • Jonathan H Burdette
  • Satoru Hayasaka

Abstract

Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components. Among the many nodes that form a network, some play a crucial role and are said to be central within the network structure. Central nodes may be identified via centrality metrics, with degree, betweenness, and eigenvector centrality being three of the most popular measures. Degree identifies the most connected nodes, whereas betweenness centrality identifies those located on the most traveled paths. Eigenvector centrality considers nodes connected to other high degree nodes as highly central. In the work presented here, we propose a new centrality metric called leverage centrality that considers the extent of connectivity of a node relative to the connectivity of its neighbors. The leverage centrality of a node in a network is determined by the extent to which its immediate neighbors rely on that node for information. Although similar in concept, there are essential differences between eigenvector and leverage centrality that are discussed in this manuscript. Degree, betweenness, eigenvector, and leverage centrality were compared using functional brain networks generated from healthy volunteers. Functional cartography was also used to identify neighborhood hubs (nodes with high degree within a network neighborhood). Provincial hubs provide structure within the local community, and connector hubs mediate connections between multiple communities. Leverage proved to yield information that was not captured by degree, betweenness, or eigenvector centrality and was more accurate at identifying neighborhood hubs. We propose that this metric may be able to identify critical nodes that are highly influential within the network.

Suggested Citation

  • Karen E Joyce & Paul J Laurienti & Jonathan H Burdette & Satoru Hayasaka, 2010. "A New Measure of Centrality for Brain Networks," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-13, August.
  • Handle: RePEc:plo:pone00:0012200
    DOI: 10.1371/journal.pone.0012200
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0012200?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. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    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. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    2. Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2022. "The geodesic-transversal problem," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    3. Yin, Rongrong & Li, Linhui & Wang, Yumeng & Lang, Chun & Hao, Zhenyang & Zhang, Le, 2024. "Identifying critical nodes in complex networks based on distance Laplacian energy," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    4. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    5. Almotahari, Amirmasoud & Yazici, Anil, 2021. "A computationally efficient metric for identification of critical links in large transportation networks," Reliability Engineering and System Safety, Elsevier, vol. 209(C).
    6. Saikou Y. Diallo & Christopher J. Lynch & Ross Gore & Jose J. Padilla, 2016. "Identifying key papers within a journal via network centrality measures," Scientometrics, Springer;Akadémiai Kiadó, vol. 107(3), pages 1005-1020, June.
    7. Almotahari, Amirmasoud & Yazici, M. Anil, 2019. "A link criticality index embedded in the convex combinations solution of user equilibrium traffic assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 126(C), pages 67-82.
    8. Ventresca, Mario & Harrison, Kyle Robert & Ombuki-Berman, Beatrice M., 2018. "The bi-objective critical node detection problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 895-908.

    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. De Masi, G. & Giovannetti, G. & Ricchiuti, G., 2013. "Network analysis to detect common strategies in Italian foreign direct investment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(5), pages 1202-1214.
    2. Fogel, Kathy & Jandik, Tomas & McCumber, William R., 2018. "CFO social capital and private debt," Journal of Corporate Finance, Elsevier, vol. 52(C), pages 28-52.
    3. Hyuk-Soo Kwon & Jihong Lee & Sokbae Lee & Ryungha Oh, 2022. "Knowledge spillovers and patent citations: trends in geographic localization, 1976–2015," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 31(3), pages 123-147, April.
    4. Mengying Cui & David Levinson, 2018. "Accessibility analysis of risk severity," Transportation, Springer, vol. 45(4), pages 1029-1050, July.
    5. Fang, Ming & Francis, Bill & Hasan, Iftekhar & Wu, Qiang, 2022. "External social networks and earnings management," The British Accounting Review, Elsevier, vol. 54(2).
    6. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    7. Tao, Qizhi & Li, Haoyu & Wu, Qun & Zhang, Ting & Zhu, Yingjun, 2019. "The dark side of board network centrality: Evidence from merger performance," Journal of Business Research, Elsevier, vol. 104(C), pages 215-232.
    8. repec:dau:papers:123456789/7616 is not listed on IDEAS
    9. Jackie Krafft & Francesco Quatraro, 2011. "The Dynamics of Technological Knowledge: From Linearity to Recombination," Chapters, in: Cristiano Antonelli (ed.), Handbook on the Economic Complexity of Technological Change, chapter 7, Edward Elgar Publishing.
    10. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    11. Wu, Tao & Xian, Xingping & Zhong, Linfeng & Xiong, Xi & Stanley, H. Eugene, 2018. "Power iteration ranking via hybrid diffusion for vital nodes identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 802-815.
    12. Giulia Masi & Giorgio Ricchiuti, 2020. "From FDI network topology to macroeconomic instability," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 15(1), pages 133-158, January.
    13. 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).
    14. Zamudio, César & Anokhin, Sergey & Kellermanns, Franz W., 2014. "Network analysis: A concise review and suggestions for family business research," Journal of Family Business Strategy, Elsevier, vol. 5(1), pages 63-71.
    15. Jing Yang & Yingwu Chen, 2011. "Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks," PLOS ONE, Public Library of Science, vol. 6(7), pages 1-5, July.
    16. Li, Zhitao & Tang, Jinjun & Zhao, Chuyun & Gao, Fan, 2023. "Improved centrality measure based on the adapted PageRank algorithm for urban transportation multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    17. Henderson, Geraldine R. & Iacobucci, Dawn & Calder, Bobby J., 1998. "Brand diagnostics: Mapping branding effects using consumer associative networks," European Journal of Operational Research, Elsevier, vol. 111(2), pages 306-327, December.
    18. repec:hal:wpspec:info:hdl:2441/f6h8764enu2lskk9p5487a6cm is not listed on IDEAS
    19. Fan, Yaoyao & Jiang, Yuxiang & Jin, Pengcheng & Mai, Yong, 2023. "CEO network centrality and bank risk: Evidence from US Bank holding companies," Journal of Corporate Finance, Elsevier, vol. 83(C).
    20. Gomez, Daniel & Gonzalez-Aranguena, Enrique & Manuel, Conrado & Owen, Guillermo & del Pozo, Monica & Tejada, Juan, 2003. "Centrality and power in social networks: a game theoretic approach," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 27-54, August.
    21. Xia, Ling-Ling & Song, Yu-Rong & Li, Chan-Chan & Jiang, Guo-Ping, 2018. "Improved targeted immunization strategies based on two rounds of selection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 540-547.
    22. Jackie Krafft & Francesco Quatraro & Pier Paolo Saviotti, 2011. "The knowledge-base evolution in biotechnology: a social network analysis," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 20(5), pages 445-475.

    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:0012200. 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.