Synchronization in power-law networks
Synchronization in power-law networks
复制标题
作者：
Kocarev, L;Amato, P
我们考虑了现实的幂律图，该图仅适用于一定范围的程度。我们表明，此类网络的同步性取决于预期的平均水平和预期最大程度。特别是，我们发现具有现实幂律图的网络不如经典随机网络同步。最后，我们考虑由两个部分组成的混合图：全局图和局部图。我们表明，与总边数成正比的混合网络几乎可以肯定地同步。 （c）2005年美国物理研究所。
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. (C) 2005 American Institute of Physics.