Abstract
We develop a method to generate robust networks against malicious attacks, aswell as to substantially improve the robustness of a given network by swappingedges and keeping the degree distribution fixed. The method, based on persistenceof the size of the largest cluster during attacks, was applied to several types ofnetworks with broad degree distributions, including a real network—the Internet. Wefind that our method can improve the robustness significantly. Our results showthat robust networks have a novel ‘onion-like’ topology consisting of a core ofhighly connected nodes hierarchically surrounded by rings of nodes with decreasingdegree.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Statistical Mechanics: Theory and Experiment
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.