A new metric to find the most vulnerable node in complex networks

Moradiamani, A, Jalili, M, Yu, X and Stone, L 2018, 'A new metric to find the most vulnerable node in complex networks', in Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS), Florence, Italy, 27-30 May 2018, pp. 1-5.


Document type: Conference Paper
Collection: Conference Papers

Title A new metric to find the most vulnerable node in complex networks
Author(s) Moradiamani, A
Jalili, M
Yu, X
Stone, L
Year 2018
Conference name ISCAS 2018
Conference location Florence, Italy
Conference dates 27-30 May 2018
Proceedings title Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS)
Publisher IEEE
Place of publication United States
Start page 1
End page 5
Total pages 5
Abstract This paper addresses the problem of finding the most synchrony vulnerable node in complex networks, i.e. the node which removal has the maximum influence on synchronizability of the network. In large-scale networks, brute search techniques are often not computationally cost effective in identifying the most vulnerable node(s). Here, considering the eigenratio of the Laplacian matrix of a graph as the synchronizability metric, we propose a measure in order to approximately rank nodes based on their impact on the synchronizability. This metric is cost effective since it needs a single eigen-decomposition of the Laplacian matrix of the connection graph. Simulation results show that the proposed metric is accurate enough in predicting the most vulnerable node in synthetic networks with scale-free, Watts-Strogatz and Erdos-Rényi structures.
Subjects Dynamical Systems in Applications
Control Systems, Robotics and Automation
Keyword(s) Vulnerability
synchronisation
complex networks
eigen-decomposition
DOI - identifier 10.1109/ISCAS.2018.8351133
Copyright notice © 2018 IEEE
ISBN 9781538648810
Versions
Version Filter Type
Altmetric details:
Access Statistics: 18 Abstract Views  -  Detailed Statistics
Created: Wed, 19 Sep 2018, 13:35:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us