Abstract
In this paper we suggest a method for studying complex networks vulnerability. This method takes into account the network topology, the node dynamics and the potential node interactions. It is based on the PageRank and VulnerabilityRank algorithms. We identify the problem with these algorithms, i.e. they tend towards zero for very large networks. Thus, we propose another method to evaluate the amount of hierarchy in a given complex network, by calculating the relative variance of the system vulnerability. This measure can be used to express how much one network is being hierarchical, thus revealing its vulnerability. We use the proposed method to discover the vulnerability and hierarchical properties of four characteristic types of complex networks: random, geometric random, scale-free and small-world. As expected, the results show that networks which display scale-free properties are the most hierarchical from the analyzed network types. Additionally, we investigate the hierarchy and vulnerability of three real-data networks: the US power grid, the human brain and the Erdös collaboration network. Our method points out the Erdös collaboration network as the most vulnerable one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ravasz, E.: Evolution, hierarchy and modular organization in complex networks.Ph. D. thesis, University of Notre Dame (2004)
Gol’dshtein, V., Koganov, G.A., Surdutovich, G.I.: Vulnerability and hierarchy of complex networks. cond-mat/0409298 (2004)
Latora, V., Marchiori, M.: Economic Small-World Behavior in Weighted Networks. The European Physics Journal B-Condensed Matter and Complex Systems 32(2), 249–263 (2002)
Trusina, A., Maslov, S., Minnhagen, P., Sneppen, K.: Hierarchy Measures in Complex Networks. Physical Review Letters 92(17), 178702 (2008)
Tangmunarunkit, H., Govinadan, R., Jamin, S., Shenker, S., Willinger, W.: Tech. Rep 01-746. Computer Science Department, University of Southern California (2001)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: Proceedings of the 7th International Conference on World Wide Web, vol. 7, pp. 107–120 (1998)
Kocarev, L., Zlatanov, N., Trajanov, D.: Vulnerability of networks of interacting Markov chains. Phylosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 368(2010), 2205–2219 (1918)
Kurant, M., Thiran, P., Hagmann, P.: Error and Attack Tolerance of Layered Complex Networks. Physical Review E76, 5 (2007)
US power grid, http://www.cs.helsinki.fi/u/tsaparas/MACN2006/data-code.html
Filiposka, S., Trajanov, D., Grnarov, A.: Survey of Social Networking and Applications in Ad Hoc Networks. In: ETAI VIII National Conference 2007 (2007)
Briggs, K.: Graph eigenvalues and connectivity, http://keithbriggs.info/documents/graph-eigenvalues.pdf
Karonski, M., Rucinski, A.: The Origins of the Theory of Random Graphs. In: The Mathematics of Paul Erdös I, pp. 311–336. Springer (1997)
Penrose, M.: Random Geometric Graphs. Oxford University Press (2004)
Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press (2003)
Hangmann, P., Kurant, M., Gigadent, X., Thiran, P., Weeden, V.J., Meuli, R., Thiran, J.P.: Mapping Human Whole-Brain Structural Networks with Diffusion MRI. PLoS One 2, e597 (2007)
UF Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices/Pajek/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Mishkovski, I. (2014). Hierarchy and Vulnerability of Complex Networks. In: Trajkovik, V., Anastas, M. (eds) ICT Innovations 2013. ICT Innovations 2013. Advances in Intelligent Systems and Computing, vol 231. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-01466-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-01466-1_26
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-01465-4
Online ISBN: 978-3-319-01466-1
eBook Packages: EngineeringEngineering (R0)