skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

Abstract

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Authors:
 [1];  [2];  [3]
  1. School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China)
  2. School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China)
  3. Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong (China)
Publication Date:
OSTI Identifier:
22250672
Resource Type:
Journal Article
Resource Relation:
Journal Name: Chaos (Woodbury, N. Y.); Journal Volume: 24; Journal Issue: 2; Other Information: (c) 2014 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; COMPUTERIZED SIMULATION; LENGTH; TOPOLOGY; VARIATIONS

Citation Formats

Zhang, Jianbao, Ma, Zhongjun, E-mail: mzj1234402@163.com, and Chen, Guanrong. Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance. United States: N. p., 2014. Web. doi:10.1063/1.4873524.
Zhang, Jianbao, Ma, Zhongjun, E-mail: mzj1234402@163.com, & Chen, Guanrong. Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance. United States. doi:10.1063/1.4873524.
Zhang, Jianbao, Ma, Zhongjun, E-mail: mzj1234402@163.com, and Chen, Guanrong. Sun . "Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance". United States. doi:10.1063/1.4873524.
@article{osti_22250672,
title = {Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance},
author = {Zhang, Jianbao and Ma, Zhongjun, E-mail: mzj1234402@163.com and Chen, Guanrong},
abstractNote = {All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.},
doi = {10.1063/1.4873524},
journal = {Chaos (Woodbury, N. Y.)},
number = 2,
volume = 24,
place = {United States},
year = {Sun Jun 15 00:00:00 EDT 2014},
month = {Sun Jun 15 00:00:00 EDT 2014}
}
  • Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very lowmore » connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.« less
  • The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities (more » $$\bar{K} \ll 1$$) and that the critical connectivity of stability $$K_s$$ changes compared to random networks. At higher $$\bar{K}$$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.« less
  • By extending a dynamical mean-field approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 67, 041903 (2003)], we have developed a semianalytical theory which takes into account a wide range of couplings in a small-world network. Our network consists of noisy N-unit FitzHugh-Nagumo neurons with couplings whose average coordination number Z may change from local (Z<<N) to global couplings (Z=N-1) and/or whose concentration of random couplings p is allowed to vary from regular (p=0) to completely random (p=1). We have taken into account three kinds of spatial correlations: the on-site correlation, the correlation for a coupled pair, andmore » that for a pair without direct couplings. The original 2N-dimensional stochastic differential equations are transformed to 13-dimensional deterministic differential equations expressed in terms of means, variances, and covariances of state variables. The synchronization ratio and the firing-time precision for an applied single spike have been discussed as functions of Z and p. Our calculations have shown that with increasing p, the synchronization is worse because of increased heterogeneous couplings, although the average network distance becomes shorter. Results calculated by our theory are in good agreement with those by direct simulations.« less
  • By using a semianalytical dynamical mean-field approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 70, 066107 (2004)], we have studied the synchronization of stochastic, small-world (SW) networks of FitzHugh-Nagumo neurons with diffusive couplings. The difference and similarity between results for diffusive and sigmoid couplings have been discussed. It has been shown that with introducing the weak heterogeneity to regular networks, the synchronization may be slightly increased for diffusive couplings, while it is decreased for sigmoid couplings. This increase in the synchronization for diffusive couplings is shown to be due to their local, negative feedback contributions, but notmore » due to the short average distance in SW networks. Synchronization of SW networks depends not only on their structure but also on the type of couplings.« less
  • A navigation process is studied on a variant of the Watts-Strogatz small-world network model embedded on a square lattice. With probability p, each vertex sends out a long-range link, and the probability of the other end of this link falling on a vertex at lattice distance r away decays as r{sup -{alpha}}. Vertices on the network have knowledge of only their nearest neighbors. In a navigation process, messages are forwarded to a designated target. For {alpha}<3 and {alpha}{ne}2, a scaling relation is found between the average actual path length and pL, where L is the average length of the additionalmore » long range links. Given pL>1, a dynamic small world effect is observed, and the behavior of the scaling function at large enough pL is obtained. At {alpha}=2 and 3, this kind of scaling breaks down, and different functions of the average actual path length are obtained. For {alpha}>3, the average actual path length is nearly linear with network size.« less