Kocarev Ljupco, Amato Paolo
Institute for Nonlinear Science, University of California-San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0402, USA.
Chaos. 2005 Jun;15(2):24101. doi: 10.1063/1.1899283.
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.
我们考虑实际的幂律图，对于这类图，幂律仅在一定的度范围内成立。我们表明，此类网络的同步性取决于预期平均度和预期最大度。特别地，我们发现具有实际幂律图的网络比经典随机网络的同步性更差。最后，我们考虑混合图，它由两部分组成：一个全局图和一个局部图。我们表明，对于全局边的数量与总边的数量成比例的混合网络，几乎肯定会同步。
