Skip to main content

Resistance Distance, Information Centrality, Node Vulnerability and Vibrations in Complex Networks

  • Chapter
Network Science

Abstract

We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement. We first prove various relations among them. Then we focus on the node displacement, showing its usefulness as an index of node vulnerability. We argue that the node displacement has a better resolution as a measure of node vulnerability than the degree and the information centrality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)

    Article  MATH  Google Scholar 

  2. Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)

    Article  Google Scholar 

  3. Atilgan, A.R., Akan, P., Baysal, C.: Small-world communication of residues and significance for protein dynamics. Biophys. J. 86, 85–91 (2004)

    Article  Google Scholar 

  4. Bahar, I., Atilgan, A.R., Erman, B.: Direct evaluation of thermal fluctuations in proteins using a single-parameter harmonic potential. Fold. Des. 2, 173–181 (1997)

    Article  Google Scholar 

  5. Barthelemy, M., Barrat, A., Vespignani, A.: The role of geography and traffic in the structure of complex networks. Adv. Complex Syst. 10, 5–28 (2007)

    MATH  Google Scholar 

  6. Chen, H.Y., Zhang, F.J.: Resistance distance and the normalized Laplacian spectrum. Discrete Appl. Math. 155, 654–661 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Choi, J., Barnett, G., Chou, B.: Comparing world city networks: a network analysis of Internet backbone and air transport intercity linkages. Glob. Netw. 6, 81–99 (2006)

    Article  Google Scholar 

  8. de Nooy, W., Mrvar, A., Batagelj, V.: Exploratory Social Network Analysis with Pajek. Cambridge University Press, Cambridge (2005)

    Book  Google Scholar 

  9. del Rio, G., Koschutzki, D., Coello, G.: How to identify essential genes from molecular networks? BMC Syst. Biol. (2009). doi:10.1186/1752-0509-3-102

    Google Scholar 

  10. Dobrynin, A.A., Entringer, R., Gutman, I.: Wiener index of trees: Theory and applications. Acta Appl. Math. 66, 211–249 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Estrada, E.: Virtual identification of essential proteins within the protein interaction network of yeast. Proteomics 6, 35–40 (2006)

    Article  Google Scholar 

  12. Estrada, E.: Universality in protein residue networks. Biophys. J. 98, 890–900 (2010)

    Article  Google Scholar 

  13. Estrada, E., Bodin, O.: Using network centrality measures to manage landscape connectivity. a short path for assessing habitat patch importance. Ecol. Appl. 18, 1810–1825 (2008)

    Article  Google Scholar 

  14. Estrada, E., Hatano, N.: A vibrational approach to node centrality and vulnerability in complex networks. arXiv:0912.4307

  15. Estrada, E., Hatano, N.: Topological atomic displacements, Kirchhoff and Wiener indices of molecules. Chem. Phys. Lett. 486, 166–170 (2010)

    Article  Google Scholar 

  16. Estrada, E., Rodríguez, L., Gutiérrez, A.: Matrix algebraic manipulations of molecular graphs. 1. graph theoretical invariants based on distances and adjacency matrices. MATCH Commun. Math. Comput. Chem. 35, 145–156 (1997)

    MATH  Google Scholar 

  17. Fiedler, M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23, 298–305 (1973)

    MathSciNet  Google Scholar 

  18. Freeman, L.C.: A set of measures of centrality based upon betweenness. Sociometry 40, 35–41 (1977)

    Article  Google Scholar 

  19. Freeman, L.C.: The Development of Social Network Analysis. Empirical Press, Vancouver (2004)

    Google Scholar 

  20. Harary, F. (ed.): Graph Theory and Theoretical Physics. Academic Press, London (1967)

    MATH  Google Scholar 

  21. Jeong, H., Mason, S.P., Barabási, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41–42 (2001)

    Article  Google Scholar 

  22. Jordán, F.: Keystone species and food webs. Philos. Trans. R. Soc. Lond. B, Biol. Sci. 364, 1733–1741 (2009)

    Article  Google Scholar 

  23. Kapferer, B.: Strategy and Transaction in an African Factory. Manchester University Press, Manchester (1972)

    Google Scholar 

  24. Kendall, M.: A new measure of rank correlation. Biometrika 30, 81–89 (1938)

    MathSciNet  MATH  Google Scholar 

  25. Klein, D., Randić, M.: Resistance distance. J. Math. Chem. 12, 81–95 (1993)

    Article  MathSciNet  Google Scholar 

  26. Lind, P., González, M., Herrmann, H.: Cycles and clustering in bipartite networks. Phys. Rev. E 72, 056127 (2005)

    Google Scholar 

  27. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  28. Soheilifard, R., Makarov, D., Rodin, G.: Critical evaluation of simple network models of protein dynamics and their comparison with crystallographic B-factors. Phys. Biol. 5, 1–13 (2008)

    Article  Google Scholar 

  29. Stephenson, K., Zelen, M.: Rethinking centrality: methods and examples. Soc. Netw. 11, 1–37 (1989)

    Article  MathSciNet  Google Scholar 

  30. Strogatz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)

    Article  Google Scholar 

  31. Trinajstić, N.: Chemical Graph Theory. CRC Press, Boca Raton (1992)

    Google Scholar 

  32. Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)

    Google Scholar 

  33. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  34. Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69, 17–20 (1947)

    Article  Google Scholar 

  35. Xiao, W., Gutman, I.: Resistance distance and Laplacian spectrum. Theor. Chem. Acc. 110, 284–289 (2003)

    Article  Google Scholar 

  36. Yang, Y.J., Zhang, H.P.: Some rules on resistance distance with applications. J. Phys. A, Math. Theor. 41, 445203 (2008)

    Article  Google Scholar 

  37. Yuan, Z., Bailey, T., Teasdale, R.: Prediction of protein B-factor profiles. Proteins 58, 905–912 (2005)

    Article  Google Scholar 

  38. Zhou, B., Trinajstić, N.: On resistance distance and Kirchhoff index. J. Math. Chem. 46, 283–289 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ernesto Estrada .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Estrada, E., Hatano, N. (2010). Resistance Distance, Information Centrality, Node Vulnerability and Vibrations in Complex Networks. In: Estrada, E., Fox, M., Higham, D., Oppo, GL. (eds) Network Science. Springer, London. https://doi.org/10.1007/978-1-84996-396-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-396-1_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-395-4

  • Online ISBN: 978-1-84996-396-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics