Archivio Istituzionale della RicercaSynchronization 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.
Synchronization in random networks with given expected degree sequences / Checco, P; Biey, Mario; Kocarev, L.. - In: CHAOS, SOLITONS AND FRACTALS. - ISSN 0960-0779. - 35:(2008), pp. 562-577.
Synchronization in random networks with given expected degree sequences
BIEY, MARIO;
2008
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
syn-in-networks-CSF.pdf
accesso aperto
Tipologia:
1. Preprint / submitted version [pre- review]
Licenza:
PUBBLICO - Tutti i diritti riservati
Dimensione
292.09 kB
Formato
Adobe PDF
|
292.09 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1801471
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo