LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A heuristic algorithm for enhancing the robustness of scale-free networks based on edge classification

Photo from wikipedia

Abstract The essential of existing methods for promoting network robustness is randomly exchanging the edges of networks. Without considering the network structure, the performance of these algorithms is limited. Therefore,… Click to show full abstract

Abstract The essential of existing methods for promoting network robustness is randomly exchanging the edges of networks. Without considering the network structure, the performance of these algorithms is limited. Therefore, we put forward a way for classifying the edges of networks into three types, which are valid edges, invalid edges and flexible edges. Then, a heuristic optimization algorithm, which is designed based on the edge classification (EC) against malicious attacks (MA), is proposed to improve the robustness of scale-free (RSF) network termed as EC-RS F MA . EC-RS F MA improves the robustness of scale-free networks by adjusting the number of edges of each type and changing the connection relation of the same type of edges under the constraint that the degree distribution remains to be unchanged. In the experiments, the performance of EC-RS F MA is validated on both synthetic and real-world networks. The results show that EC-RS F MA outperforms the existing algorithms.

Keywords: scale free; free networks; robustness scale; based edge; edge classification

Journal Title: Physica A: Statistical Mechanics and its Applications
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.