Vulnerability and Hierarchy of Complex Networks
| dc.creator | Gol'dshtein, V. | |
| dc.creator | Koganov, G. A. | |
| dc.creator | Surdutovich, G. I. | |
| dc.date | 2004-09-13 | |
| dc.date.accessioned | 2026-07-07T03:00:34Z | |
| dc.date.available | 2026-07-07T03:00:34Z | |
| dc.description | We suggest an approach to study hierarchy, especially hidden one, of complex networks based on the analysis of their vulnerability. Two quantities are proposed as a measure of network hierarchy. The first one is the system vulnerability V. We show that being quite suitable for regular networks this characteristic does not allow one to estimate the hierarchy of large random networks. The second quantity is a relative variance h of the system vulnerability that allows us to characterize a "natural" hierarchy level of random networks. We find that hierarchical properties of random networks depend crucially on a ratio between the number of nodes and the number of edges. We note that any graph with a transitive isometry group action (i.e. an absolutely symmetric graph) is not hierarchical. Breaking such a symmetry leads to appearance of hierarchy. | |
| dc.description | 4 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0409298 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0409298 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/24844 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Vulnerability and Hierarchy of Complex Networks | |
| dc.type | text |