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

Finding the resistance distance and eigenvector centrality from the network’s eigenvalues

Author

Listed:
  • Gutiérrez, Caracé
  • Gancio, Juan
  • Cabeza, Cecilia
  • Rubido, Nicolás

Abstract

There are different measures to classify a network’s data set that, depending on the problem, have different success rates. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and differentiating between biomedical images of patients with Alzheimer’s disease, respectively. The resistance distance measures an effective distance between two nodes of a network taking into account all possible shortest paths between them and the eigenvector centrality measures the relative importance of each node in a network. However, both measures require knowing the network’s eigenvalues and eigenvectors. Here, we show that we can closely approximate [find exactly] the resistance distance [eigenvector centrality] of a network only using its eigenvalue spectra, where we illustrate this by experimenting on resistor circuits, real neural networks (weighted and unweighted), and paradigmatic network models — scale-free, random, and small-world networks. Our results are supported by analytical derivations, which are based on the eigenvector–eigenvalue identity. Since the identity is unrestricted to the resistance distance or eigenvector centrality measures, it can be applied to most problems requiring the calculation of eigenvectors.

Suggested Citation

  • Gutiérrez, Caracé & Gancio, Juan & Cabeza, Cecilia & Rubido, Nicolás, 2021. "Finding the resistance distance and eigenvector centrality from the network’s eigenvalues," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 569(C).
    • Handle: RePEc:eee:phsmap:v:569:y:2021:i:c:s0378437121000236
    DOI: 10.1016/j.physa.2021.125751
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121000236
    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.2021.125751?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. Dorogovtsev, S. N. & Mendes, J.F.F., 2013. "Evolution of Networks: From Biological Nets to the Internet and WWW," OUP Catalogue, Oxford University Press, number 9780199686711, Decembrie.
    2. Martínez, J.H. & Ariza, P. & Zanin, M. & Papo, D. & Maestú, F. & Pastor, J.M. & Bajo, R. & Boccaletti, S. & Buldú, J.M., 2015. "Anomalous consistency in Mild Cognitive Impairment: A complex networks approach," Chaos, Solitons & Fractals, Elsevier, vol. 70(C), pages 144-155.
    3. Dorogovtsev, S.N. & Goltsev, A.V. & Mendes, J.F.F. & Samukhin, A.N., 2004. "Random networks: eigenvalue spectra," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(1), pages 76-83.
    4. Robby R Marrotte & Jeff Bowman, 2017. "The relationship between least-cost and resistance distance," PLOS ONE, Public Library of Science, vol. 12(3), pages 1-19, March.
    5. Zhang, Teng & Bu, Changjiang, 2019. "Detecting community structure in complex networks via resistance distance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 526(C).
    6. J. H. Asad & A. Sakaji & R. S. Hijjawi & J. M. Khalifeh, 2006. "On the resistance of an infinite square network of identical resistors – Theoretical and experimental comparison," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 52(3), pages 365-370, August.
    7. Gabriele Lohmann & Daniel S Margulies & Annette Horstmann & Burkhard Pleger & Joeran Lepsien & Dirk Goldhahn & Haiko Schloegl & Michael Stumvoll & Arno Villringer & Robert Turner, 2010. "Eigenvector Centrality Mapping for Analyzing Connectivity Patterns in fMRI Data of the Human Brain," PLOS ONE, Public Library of Science, vol. 5(4), pages 1-8, April.
    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. Ahmadi, Negar & Pei, Yulong & Pechenizkiy, Mykola, 2019. "Effect of linear mixing in EEG on synchronization and complex network measures studied using the Kuramoto model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 289-308.
    2. Xun-Heng Wang & Yun Jiao & Lihua Li, 2018. "Mapping individual voxel-wise morphological connectivity using wavelet transform of voxel-based morphology," PLOS ONE, Public Library of Science, vol. 13(7), pages 1-16, July.
    3. 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.
    4. Lin, Wei & Li, Min & Zhou, Shuming & Liu, Jiafei & Chen, Gaolin & Zhou, Qianru, 2021. "Phase transition in spectral clustering based on resistance matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    5. Li, Xun & Cao, Lang, 2016. "Diffusion processes of fragmentary information on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 624-634.
    6. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    7. A. Paolo Masucci & Carlos Molinero, 2016. "Robustness and closeness centrality for self-organized and planned cities," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 89(2), pages 1-8, February.
    8. Wang, Tao & Chen, Shanshan & Wang, Xiaoxia & Wang, Jinfang, 2020. "Label propagation algorithm based on node importance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
    9. 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.
    10. Pradhan, Priodyuti & C.U., Angeliya & Jalan, Sarika, 2020. "Principal eigenvector localization and centrality in networks: Revisited," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    11. Zhihong Tian & Zhenji Zhang & Ruize Gao, 2016. "Optimization in e-commerce market network based on value order parameter," Information Technology and Management, Springer, vol. 17(2), pages 187-197, June.
    12. Manuel Wolff & Dagmar Haase & Jörg Priess & Tobias Leander Hoffmann, 2023. "The Role of Brownfields and Their Revitalisation for the Functional Connectivity of the Urban Tree System in a Regrowing City," Land, MDPI, vol. 12(2), pages 1-22, January.
    13. Cui, Wei & Pu, Cunlai & Xu, Zhongqi & Cai, Shimin & Yang, Jian & Michaelson, Andrew, 2016. "Bounded link prediction in very large networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 202-214.
    14. Lei, Lixing & Yang, Junzhong, 2021. "Patterns in coupled FitzHugh–Nagumo model on duplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    15. , David, 2016. "The formation of networks with local spillovers and limited observability," Theoretical Economics, Econometric Society, vol. 11(3), September.
    16. Óskarsdóttir, María & Bravo, Cristián, 2021. "Multilayer network analysis for improved credit risk prediction," Omega, Elsevier, vol. 105(C).
    17. Hernández, Juan M. & González-Martel, Christian, 2017. "An evolving model for the lodging-service network in a tourism destination," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 482(C), pages 296-307.
    18. Neiva, Mariane B. & Bruno, Odemir M., 2023. "Exploring ordered patterns in the adjacency matrix for improving machine learning on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    19. Nicanor García Álvarez & Belarmino Adenso-Díaz & Laura Calzada-Infante, 2021. "Maritime Traffic as a Complex Network: a Systematic Review," Networks and Spatial Economics, Springer, vol. 21(2), pages 387-417, June.
    20. Chih-Sheng Hsieh & Michael D. König & Xiaodong Liu, 2012. "Network formation with local complements and global substitutes: the case of R&D networks," ECON - Working Papers 217, Department of Economics - University of Zurich, revised Feb 2017.

    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:569:y:2021:i:c:s0378437121000236. 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.