Uniform synchronous criticality of diversely random complex networks
نویسنده
چکیده
We investigate collective synchronous behaviors in random complex networks of limit-cycle oscillators with the non-identical asymmetric coupling scheme, and find a uniform coupling criticality of collective synchronization which is independent of complexity of network topologies. Numerically simulations on categories of random complex networks have verified this conclusion.
منابع مشابه
Sync in Complex Dynamical Networks : Stability , Evolution , Control , and Application ( Invited Paper )
In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the collective dynamics of complex networks. This paper reports recent progresses in the literature of synchronization of complex dynamical networks including stabili...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملبررسی پایداری حالت همگام در شبکهای از نگاشتهای آشوبناک با روش سنجه ماتریسی
Stability of synchronous state is a fundamental problem in synchronization. We study Matrix Measure as an approach for investigating of stability of synchronous states of chaotic maps on complex networks. Matrix Measure is a measure which depends on network structure. Using this measure and comparing with synchronization threshold which depends on the function of the map, show us how the synchr...
متن کاملOptimal system size for complex dynamics in random neural networks near criticality.
In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259-262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a nove...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کامل