Synchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design

Abstract

In these notes we study synchronizability of dynamical processes defined on complex networks as well as its interplay with network topology. Building from a recent work by Barahona and Pecora [Phys. Rev. Lett. 89, 054101 (2002)], we use a simulated annealing algorithm to construct optimally-synchronizable networks. The resulting structures, known as entangled networks, are characterized by an extremely homogeneous and interwoven topology: degree, distance, and betweenness distributions are all very narrow, with short average distances, large loops, and small modularity. Entangled networks exhibit an excellent (almost optimal) performance with respect to other flow or connectivity properties such as robustness, random walk minimal first-passage times, and good searchability. All this converts entangled networks in a powerful concept with optimal properties in many respects.

8 pages, 3 figs., to appear in Lecture Notes in Computer Science

References in corpus (6)

• Evolution of networks
• Synchronization in small-world systems
• Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
• Optimal network topologies for local search with congestion
• Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
• Network Structures from Selection Principles