Synchronization in power-law networks.
We consider realistic power-law graphs, for which the power-law holds only for a certain range of degrees. We show that synchronizability of such networks depends on the expected average and expected maximum degree. In particular, we find that networks with realistic power-law graphs are less synchronizable than classical random networks. Finally, we consider hybrid graphs, which consist of two parts: a global graph and a local graph. We show that hybrid networks, for which the number of global edges is proportional to the number of total edges, almost surely synchronize.
Kocarev
Ljupco
L
Institute for Nonlinear Science, University of California-San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0402, USA. lkocarev@ucsd.edu
Amato
Paolo
P
D000465:Algorithms; D015233:Models, Statistical; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D010825:Physics / Q000379:methods*; D011336:Probability; D013597:Systems Analysis; D013598:Systems Theory