2005
DOI: 10.1007/s10852-005-9006-1
|View full text |Cite
|
Sign up to set email alerts
|

Effective measurement of network vulnerability under random and intentional attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0
1

Year Published

2006
2006
2016
2016

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 52 publications
(34 citation statements)
references
References 13 publications
0
33
0
1
Order By: Relevance
“…See Refs. [33][34][35] for some recent applications of the efficiency, and Refs. [32,36] for some extensions of formula (2.6).…”
Section: Shortest Path Lengths Diameter and Betweennessmentioning
confidence: 99%
“…See Refs. [33][34][35] for some recent applications of the efficiency, and Refs. [32,36] for some extensions of formula (2.6).…”
Section: Shortest Path Lengths Diameter and Betweennessmentioning
confidence: 99%
“…In more recent studies, either the importance of a link is recalculated at each stage, or links and nodes are simply eliminated at random (Albert et al, 2004;Holme et al, 2002). Optimisation techniques and games theory have also been used in transport network studies to identify the worst scenarios and formulate a response (see, for example, Bell, 2000;Bell et al, 2008;Criado et al, 2004;Lou and Zhang, 2011). Alderson et al (2013) show how to evaluate the criticality of sets of components, how to assess the worst-case set of components that might be lost to a given number of simultaneous hostile attacks (or engineering failures, or losses to Mother Nature), and how to allocate limited defensive resources to minimize the maximum damage from a subsequent attack.…”
Section: Approaches Adoptedmentioning
confidence: 99%
“…Determinados estudios de la vulnerabilidad (así como de su término contrario, la robustez) de las redes de metro, consideran a la misma como un grafo con sus vértices y sus arcos (Criado, R. et al, 2004(Criado, R. et al, , 2006(Criado, R. et al, , 2008Dragu, V. et al, 2011;Han, S. et al, 2009;Kwan, K. et al, 2003;Latora, V. et al, 2002Latora, V. et al, , 2005, lo cual permitiría verificar el número de componentes que se mantienen conectados a la red o el número de trayectos disponibles que conectan cada par de vértices restantes después de una eliminación de nodos o tramos (Criado, R. et al, 2004), a través de una función de Vulnerabilidad (V), definida sólo por grafos conectados, y reconocer así sus elementos críticos para mejorar su seguridad. Este concepto está relacionado con el descenso del rendimiento de la red a causa de la eliminación de vértices y arcos o de la eficiencia de la red cuando alguno de sus elementos (nodos o arcos) se colapsa (Criado, R. et al, 2006).…”
Section: Antecedentesunclassified