The resilience of complex network: An approach for relevant nodes extraction

In this paper, a new algorithm to select the relevant nodes-those that maintain the cohesion of the network-of the complex network is presented. The experiments on most of the real complex networks show that the proposed approach outperforms centrality measures as node degree, PageRank algorithm and betweenness centrality. The rationale of the algorithm for extracting relevant nodes is to discover the self-similarity of the network. As seen in the algorithm, throughout the extraction sequence of relevant nodes, differences are advised with node degree, PageRank algorithm and betweenness centrality. Finally, empirical evidence is considered to show that complex network robustness is a nonlinear function of the small-worldness measure.