Publication

Comment on Rewiring networks for synchronization

Ali Ajdari Rad, Mahdi Jalili
2009
Journal paper
Abstract

This is a comment on a recent paper by A. Hagberg and D. A. Schult [Chaos 18, 037105 (2008)]. By taking the eigenratio of the Laplacian of an undirected and unweighted network as its synchronizability measure, they proposed a greedy rewiring algorithm for enhancing the synchronizability of the network. The algorithm is not capable of avoiding local minima, and as a consequence, for each initial network, different optimized networks with different synchronizabilities are obtained. Here, we show that by employing a simulated annealing based optimization method, it is possible to further enhance the synchronizability of the network. Moreover, using this approach, the optimized network is not biased by the initial network and regardless of the initial networks, the final optimized networks have similar synchronization properties

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.