Vulnerability of Complex Networks under Approximate Longest Chain Attack Strategies

Publisher： Edp Sciences

E-ISSN： 2271-2097|7|issue|01011-01011

ISSN： 2271-2097

Source： ITM Web of conferences, Vol.7, Iss.issue, 2016-11, pp. : 01011-01011

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

We proposed three approximate longest chain-attack strategies and studied the vulnerability of complex networks under these intentional attack strategies. Experimental results indicate that when random network and small-world network are under any one of the three chain-attacks, the larger the <k> is, the smaller the iterative step T is. However, scale-free network shows different characteristics: the larger the <k> is, the larger the T is. These findings supplement and extend the previous attack results on nodes and edges, and can thus help us better explain the vulnerability of different complex networks.

Related content

Approximate location of relevant variables under the crossover distribution

By Damaschke P.  

Discrete Applied Mathematics, Vol. 137, Iss. 1, 2004-02 ,pp. : 47-67 (21)

Elsevier

Access to resources Recommend Favorite

On the approximate controllability of Stackelberg–Nash strategies for linear heat equations in ℜN with potentials

By  

Applicable Analysis, Vol. 94, Iss. 4, 2015-04 ,pp. : 780-799 (20)

Taylor & Francis Ltd

Access to resources Recommend Favorite

TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS

By  

Bulletin of the Australian Mathematical Society, Vol. 95, Iss. 2, 2017-04 ,pp. : 347-349 (3)

Cambridge University Press

Access to resources Recommend Favorite

Detached Eddy Simulation of Complex Separation Flows Over a Modern Fighter Model at High Angle of Attack

By  

Communications in Computational Physics, Vol. 22, Iss. 5, 2017-10 ,pp. : 1309-1332 (24)

Cambridge University Press

Access to resources Recommend Favorite

On Delivery Times in Packet Networks under Adversarial Traffic

By Rosen Adi  

Theory of Computing Systems, Vol. 39, Iss. 6, 2006-11 ,pp. : 805-827 (23)

Springer Publishing Company

Access to resources Recommend Favorite