%0 Journal Article %1 NIS06a %A Nishikawa, Takashi %A Motter, Adilson E. %D 2006 %J Physica~D %K Complex Optimization Synchronization, networks, %N 1-2 %P 77--89 %T Maximum performance at minimum cost in network synchronization %V 224 %X We consider two optimization problems on synchronization of oscillator networks: maximization of synchronizability and minimization of synchronization cost. We first develop an extension of the well-known master stability framework to the case of non-diagonalizable Laplacian matrices. We then show that the solution sets of the two optimization problems coincide and are simultaneously characterized by a simple condition on the Laplacian eigenvalues. Among the optimal networks, we identify a subclass of hierarchical networks, characterized by the absence of feedback loops and the normalization of inputs. We show that most optimal networks are directed and non-diagonalizable, necessitating the extension of the framework. We also show how oriented spanning trees can be used to explicitly and systematically construct optimal networks under network topological constraints. Our results may provide insights into the evolutionary origin of structures in complex networks for which synchronization plays a significant role.

@article{NIS06a, abstract = {We consider two optimization problems on synchronization of oscillator networks: maximization of synchronizability and minimization of synchronization cost. We first develop an extension of the well-known master stability framework to the case of non-diagonalizable Laplacian matrices. We then show that the solution sets of the two optimization problems coincide and are simultaneously characterized by a simple condition on the Laplacian eigenvalues. Among the optimal networks, we identify a subclass of hierarchical networks, characterized by the absence of feedback loops and the normalization of inputs. We show that most optimal networks are directed and non-diagonalizable, necessitating the extension of the framework. We also show how oriented spanning trees can be used to explicitly and systematically construct optimal networks under network topological constraints. Our results may provide insights into the evolutionary origin of structures in complex networks for which synchronization plays a significant role.}, added-at = {2009-03-03T17:19:04.000+0100}, author = {Nishikawa, Takashi and Motter, Adilson E.}, biburl = {https://www.bibsonomy.org/bibtex/2477c114e239f89e57c91db01b3ec40bf/bronckobuster}, interhash = {c3aab485cb4d645a10cf86a3c98983da}, intrahash = {477c114e239f89e57c91db01b3ec40bf}, journal = {Physica~D}, keywords = {Complex Optimization Synchronization, networks,}, month = {December}, number = {1-2}, pages = {77--89}, timestamp = {2009-03-03T17:20:04.000+0100}, title = {Maximum performance at minimum cost in network synchronization}, volume = 224, year = 2006 }