Synchronization in random networks with given expected degree sequences is studied. We also investigate in details the synchronization in networks whose topology is described by classical random graphs, power-law random graphs and hybrid graphs when N goes to infinity. In particular, we show that random graphs almost surely synchronize. We also show that adding small number of global edges to a local graph makes the corresponding hybrid graph to synchronize.
|Titolo:||Synchronization in random networks with given expected degree sequences|
|Data di pubblicazione:||2008|
|Appare nelle tipologie:||1.1 Articolo in rivista|