pith. sign in

arxiv: 1205.2909 · v3 · pith:7WYXVS2Tnew · submitted 2012-05-13 · ⚛️ physics.soc-ph · cond-mat.stat-mech· cs.SI· physics.comp-ph

Evolution of robust network topologies: Emergence of central backbones

classification ⚛️ physics.soc-ph cond-mat.stat-mechcs.SIphysics.comp-ph
keywords degreefailurenetworksstructurearbitrarycentralcentralizedconnectivity
0
0 comments X
read the original abstract

We model the robustness against random failure or intentional attack of networks with arbitrary large-scale structure. We construct a block-based model which incorporates --- in a general fashion --- both connectivity and interdependence links, as well as arbitrary degree distributions and block correlations. By optimizing the percolation properties of this general class of networks, we identify a simple core-periphery structure as the topology most robust against random failure. In such networks, a distinct and small "core" of nodes with higher degree is responsible for most of the connectivity, functioning as a central "backbone" of the system. This centralized topology remains the optimal structure when other constraints are imposed, such as a given fraction of interdependence links and fixed degree distributions. This distinguishes simple centralized topologies as the most likely to emerge, when robustness against failure is the dominant evolutionary force.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.