A New Metric to Find the Most Vulnerable Node in Complex Networks

Ali Moradi Amani, Mahdi Jalili, Xinghuo Yu, Lewi Stone

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538648810
DOIs
StatePublished - 26 Apr 2018
Externally publishedYes
Event2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Florence, Italy
Duration: 27 May 201830 May 2018

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume2018-May
ISSN (Print)0271-4310

Conference

Conference2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018
Country/TerritoryItaly
CityFlorence
Period27/05/1830/05/18

Keywords

  • Vulnerability
  • complex networks
  • eigen-decomposition
  • synchronisation

Fingerprint

Dive into the research topics of 'A New Metric to Find the Most Vulnerable Node in Complex Networks'. Together they form a unique fingerprint.

Cite this