Building synchronizable and robust networks

In this paper we present a simple, fast, novel algorithm for building networks whose topology has high synchronizability, is robust against failures, and supports efficient communication. We show that the algorithm is able to build these networks in a small number of steps that scales with the networks density. In addition, we track the evolution of different topological properties in the process of generating these networks. The results show that the topological properties are homogeneously distributed and the topology is less authoritative. Furthermore, we show that the networks we generate are more robust than random, geometric random, small-world or scale-free networks with similar average connectivity. Finally, all of the results indicate that the topology of these networks is entangled, which in many cases represents an optimal topology.