اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOnset of Synchronization in Weighted Complex Networks: the Effect of Weight-Degree Correlation
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
By numerical simulations, we investigate the onset of synchronization of networked phase oscillators under two different weighting schemes. In scheme-I, the link weights are correlated to the product of the degrees of the connected nodes, so this kind of networks is named as the weight-degree correlated (WDC) network. In scheme-II, the link weights are randomly assigned to each link regardless of the node degrees, so this kind of networks is named as the weight-degree uncorrelated (WDU) network. Interestingly, it is found that by increasing a parameter that governs the weight distribution, the onset of synchronization in WDC network is monotonically enhanced, while in WDU network there is a reverse in the synchronization performance. We investigate this phenomenon from the viewpoint of gradient network, and explain the contrary roles of coupling gradient on network synchronization: gradient promotes synchronization in WDC network, while deteriorates synchronization in WDU network. The findings highlight the fact that, besides the link weight, the correlation between the weight and node degree is also important to the network dynamics.
قيم البحث
اقرأ أيضاً
Network topology plays an important role in governing the collective dynamics. Partial synchronization (PaS) on regular networks with a few non-local links is explored. Different PaS patterns out of the symmetry breaking are observed for different wa
ys of non-local couplings. The criterion for the emergence of PaS is studied. The emergence of PaS is related to the loss of degeneration in Lyapunov exponent spectrum. Theoretical and numerical analysis indicate that non-local coupling may drastically change the dynamical feature of the network, emphasizing the important topological dependence of collective dynamics on complex networks.
The behavior of two unidirectionally coupled chaotic oscillators near the generalized synchronization onset has been considered. The character of the boundaries of the generalized synchronization regime has been explained by means of the modified system
We show that subsets of interacting oscillators may synchronize in different ways within a single network. This diversity of synchronization patterns is promoted by increasing the heterogeneous distribution of coupling weights and/or asymmetries in s
mall networks. We also analyze consistency, defined as the persistence of coexistent synchronization patterns regardless of the initial conditions. Our results show that complex weighted networks display richer consistency than regular networks, suggesting why certain functional network topologies are often constructed when experimental data are analyzed.
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent $gamma$ of power-law degree distribution $P(k)si
m k^{-gamma}$, which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent $gamma$ in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number $N$, which is obviously independent of $gamma$ and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where $gamma$ influences qualitatively the MFPT of trapping problem.
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coeffici
ent, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduced in the literature, and point out their advantages and limitations. The concepts are illustrated by simple examples as well as by empirical data of the world trade and weighted coauthorship networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
