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

Simple item page
dc.creatorDonetti, Luca
dc.creatorHurtado, Pablo I.
dc.creatorMunoz, Miguel A.
dc.date2006-02-15
dc.date.accessioned2026-07-07T07:01:44Z
dc.date.available2026-07-07T07:01:44Z
dc.descriptionIn 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.
dc.description8 pages, 3 figs., to appear in Lecture Notes in Computer Science
dc.identifierhttps://arxiv.org/abs/cond-mat/0602351
dc.identifierhttp://arxiv.org/abs/cond-mat/0602351
dc.identifierLecture Notes in Computer Science 3993, 1075 (2006)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108366
dc.subjectDisordered Systems and Neural Networks
dc.subjectNetworking and Internet Architecture
dc.titleSynchronization in Network Structures: Entangled Topology as Optimal Architecture for Network Design
dc.typetext

Files

Collections

arXiv