In:
Chaos: An Interdisciplinary Journal of Nonlinear Science, AIP Publishing, Vol. 15, No. 2 ( 2005-06-01)
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
1054-1500
,
1089-7682
Language:
English
Publisher:
AIP Publishing
Publication Date:
2005
detail.hit.zdb_id:
1472677-4
SSG:
11
Bookmarklink