ترغب بنشر مسار تعليمي؟ اضغط هنا

Turbulence in small-world networks

57   0   0.0 ( 0 )
 نشر من قبل Mario Cosenza
 تاريخ النشر 2001
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

The transition to turbulence via spatiotemporal intermittency is investigated in the context of coupled maps defined on small-world networks. The local dynamics is given by the Chate-Manneville minimal map previously used in studies of spatiotemporal intermittency in ordered lattices. The critical boundary separating laminar and turbulent regimes is calculated on the parameter space of the system, given by the coupling strength and the rewiring probability of the network. Windows of relaminarization are present in some regions of the parameter space. New features arise in small-world networks; for instance, the character of the transition to turbulence changes from second order to a first order phase transition at some critical value of the rewiring probability. A linear relation characterizing the change in the order of the phase transition is found. The global quantity used as order parameter for the transition also exhibits nontrivial collective behavior for some values of the parameters. These models may describe several processes occurring in nonuniform media where the degree of disorder can be continuously varied through a parameter.



قيم البحث

اقرأ أيضاً

226 - Yu Qian , Xiaodong Huang , Gang Hu 2010
Small-world networks describe many important practical systems among which neural networks consisting of excitable nodes are the most typical ones. In this paper we study self-sustained oscillations of target waves in excitable small-world networks. A novel dominant phase-advanced driving (DPAD) method, which is generally applicable for analyzing all oscillatory complex networks consisting of nonoscillatory nodes, is proposed to reveal the self-organized structures supporting this type of oscillations. The DPAD method explicitly explores the oscillation sources and wave propagation paths of the systems, which are otherwise deeply hidden in the complicated patterns of randomly distributed target groups. Based on the understanding of the self-organized structure, the oscillatory patterns can be controlled with extremely high efficiency.
We study the effective resistance of small-world resistor networks. Utilizing recent analytic results for the propagator of the Edwards-Wilkinson process on small-world networks, we obtain the asymptotic behavior of the disorder-averaged two-point re sistance in the large system-size limit. We find that the small-world structure suppresses large network resistances: both the average resistance and its standard deviation approaches a finite value in the large system-size limit for any non-zero density of random links. We also consider a scenario where the link conductance decays as a power of the length of the random links, $l^{-alpha}$. In this case we find that the average effective system resistance diverges for any non-zero value of $alpha$.
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical sequence of long-distance links. Both types of networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular networks are planar, have a diameter growing as sqrt{N} with the system size N, and lead to super-diffusion with an exact, anomalous exponent d_w=1.3057581..., but possesses only a trivial fixed point T_c=0 for the Ising ferromagnet. In turn, the 4-regular networks are non-planar, have a diameter growing as ~2^[sqrt(log_2 N^2)], exhibit ballistic diffusion (d_w=1), and a non-trivial ferromagnetic transition, T_c>0. It suggest that the 3-regular networks are still quite geometric, while the 4-regular networks qualify as true small-world networks with mean-field properties. As an example of an application we discuss synchronization of processors on these networks.
The small-world transition is a first-order transition at zero density $p$ of shortcuts, whereby the normalized shortest-path distance undergoes a discontinuity in the thermodynamic limit. On finite systems the apparent transition is shifted by $Delt a p sim L^{-d}$. Equivalently a ``persistence size $L^* sim p^{-1/d}$ can be defined in connection with finite-size effects. Assuming $L^* sim p^{-tau}$, simple rescaling arguments imply that $tau=1/d$. We confirm this result by extensive numerical simulation in one to four dimensions, and argue that $tau=1/d$ implies that this transition is first-order.
131 - D. Simard , L. Nadeau , H. Kroger 2004
We investigate supervised learning in neural networks. We consider a multi-layered feed-forward network with back propagation. We find that the network of small-world connectivity reduces the learning error and learning time when compared to the netw orks of regular or random connectivity. Our study has potential applications in the domain of data-mining, image processing, speech recognition, and pattern recognition.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا