PubMed Health⌕ Search

Biomedical subjects

Kongqing Yang

Publications and source records attributed to Kongqing Yang.

4 recordsLinked to original sources

Abnormal synchronization in complex clustered networks.

Recent research has revealed that complex networks with a smaller average distance and more homogeneous degree distribution are more synchronizable. We find, however, that synchronization in complex, clustered networks tends to obey a different set of rules. In particular, the synchronizability of such a network is determined by the interplay between intercluster and intracluster links. The network is most synchronizable when the numbers of the two types of links are approximately equal. In the presence of a mismatch, increasing the number of intracluster links, while making the network distance smaller, can counterintuitively suppress or even destroy the synchronization. We provide theory and numerical evidence to establish this phenomenon.

Journal Article↗

Geographical effects on cascading breakdowns of scale-free networks.

Cascading breakdowns of real networks have resulted in severe accidents in recent years. In this paper, we study the effects of geographical structure on the cascading phenomena of load-carrying scale-free networks. Our essential finding is that when networks are more geographically constrained, i.e., more locally interconnected, they tend to have larger cascading breakdowns. Explanations are provided in terms of the effects of cycles and the distributions of betweenness over degrees.

Journal Article↗

Synchronization on Erdös-Rényi networks.

In this Brief Report, by analyzing the spectral properties of the Laplacian matrix of Erdös-Rényi networks, we obtained the critical coupling strength of the complete synchronization analytically. In particular, for any size of the networks, when the average degree is greater than a threshold and the coupling strength is large enough, the networks can synchronize. Here, the threshold is determined by the value of the maximal Lyapunov exponent of each dynamical unit.

Journal Article↗

Lattice scale-free networks with weighted linking.

Recently, models of the scale-free (SF) networks on lattices were investigated, which consider the influence of the embedded space on the networks. Since a lot of real networks exist on the 2D global surface, it is helpful to discuss these models. In this paper, based on the lattice SF networks model, a linking weight is added, thus an additional parameter which can control the clustering coefficient is introduced. Depending on the linking weight, the properties of the model change smoothly from the lattice SF model to the SF random graphs.

Journal Article↗