VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
2009 ◽
Vol 19
(02)
◽
pp. 727-735
◽
An efficient and computationally advantageous definition of vulnerability of a complex network is introduced, through which one is able to overcome a series of practical difficulties encountered by the measurements used so far to quantify a network's security and stability under the effects of failures, attacks or disfunctions. By means of this approach, we prove a series of theorems that allow to gather information on the ranking of the nodes of a network with respect to their strategic importance in order to preserve the functioning and performance of the network as a whole.
2007 ◽
Vol 21
(11)
◽
pp. 639-644
◽
Keyword(s):
2007 ◽
Vol 21
(06)
◽
pp. 321-326
◽
Keyword(s):
Keyword(s):
2009 ◽
pp. 578-588