Synchronization of networks with prescribed degree distributions

Simple item page
dc.creatorAtay, Fatihcan M.
dc.creatorBiyikoglu, Tuerker
dc.creatorJost, Juergen
dc.date2004-07-09
dc.date2005-05-29
dc.date.accessioned2026-07-07T08:26:33Z
dc.date.available2026-07-07T08:26:33Z
dc.descriptionWe show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, there exists a connected graph having that degree sequence for which the first nontrivial eigenvalue of the graph Laplacian is arbitrarily close to zero. Consequently, complex dynamical systems defined on such graphs have poor synchronization properties. The result holds under quite mild assumptions, and shows that there exists classes of random, scale-free, regular, small-world, and other common network architectures which impede synchronization. The proof is based on a construction that also serves as an algorithm for building non-synchronizing networks having a prescribed degree distribution.
dc.descriptionv2: A new theorem and a numerical example added. To appear in IEEE Trans. Circuits and Systems I: Fundamental Theory and Applications
dc.identifierhttps://arxiv.org/abs/nlin/0407024
dc.identifierhttp://arxiv.org/abs/nlin/0407024
dc.identifierIEEE Transactions on Circuits and Systems-I, Vol. 53 (1): 92-98, 2006
dc.identifierdoi:10.1109/TCSI.2005.854604
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136980
dc.subjectAdaptation and Self-Organizing Systems
dc.subjectCombinatorics
dc.titleSynchronization of networks with prescribed degree distributions
dc.typetext

Files

Collections

arXiv