اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPinning Complex Networks by a Single Controller
125
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, without assuming symmetry, irreducibility, or linearity of the couplings, we prove that a single controller can pin a coupled complex network to a homogenous solution. Sufficient conditions are presented to guarantee the convergence of the pinning process locally and globally. An effective approach to adapt the coupling strength is proposed. Several numerical simulations are given to verify our theoretical analysis.
قيم البحث
اقرأ أيضاً
This paper investigates epidemic control behavioral synchronization for a class of complex networks resulting from spread of epidemic diseases via pinning feedback control strategy. Based on the quenched mean field theory, epidemic control synchroniz
ation models with inhibition of contact behavior is constructed, combining with the epidemic transmission system and the complex dynamical network carrying extra controllers. By the properties of convex functions and Gerschgorin theorem, the epidemic threshold of the model is obtained, and the global stability of disease-free equilibrium is analyzed. For individuals infected situation, when epidemic spreads, two types of feedback control strategies depended on the diseases information are designed: the one only adds controllers to infected individuals, the other adds controllers both to infected and susceptible ones. And by using Lyapunov stability theory, under designed controllers, some criteria that guarantee epidemic control synchronization system achieving behavior synchronization are also derived. Several numerical simulations are performed to show the effectiveness of our theoretical results. As far as we know, this is the first work to address the controlling behavioral synchronization induced by epidemic spreading under the pinning feedback mechanism. It is hopeful that we may have more deeper insight into the essence between diseases spreading and collective behavior controlling in complex dynamical networks.
How do local topological changes affect the global operation and stability of complex supply networks? Studying supply networks on various levels of abstraction, we demonstrate that and how adding new links may not only promote but also degrade stabl
e operation of a network. Intriguingly, the resulting overloads may emerge remotely from where such a link is added, thus resulting in nonlocal failure. We link this counter-intuitive phenomenon to Braess paradox originally discovered in traffic networks. We use elementary network topologies to explain its underlying mechanism for different types of supply networks and find that it generically occurs across these systems. As an important consequence, upgrading supply networks such as communication networks, biological supply networks or power grids requires particular care because even adding only single connections may destabilize normal network operation and induce disturbances remotely from the location of structural change and even global cascades of failures.
We study traveling waves for reaction diffusion equations on the spatially discrete domain $Z^2$. The phenomenon of crystallographic pinning occurs when traveling waves become pinned in certain directions despite moving with non-zero wave speed in ne
arby directions. Mallet-Paret has shown that crystallographic pinning occurs for all rational directions, so long as the nonlinearity is close to the sawtooth. In this paper we show that crystallographic pinning holds in the horizontal and vertical directions for bistable nonlinearities which satisfy a specific computable generic condition. The proof is based on dynamical systems. In particular, it relies on an examination of the heteroclinic chains which occur as singular limits of wave profiles on the boundary of the pinning region.
When multiple model predictive controllers are implemented on a shared control area network (CAN), their performance may degrade due to the inhomogeneous timing and delays among messages. The priority based real-time scheduling of messages on the CAN
introduces complex timing of events, especially when the types and number of messages change at runtime. This paper introduces a novel hybrid timing model to make runtime predictions on the timing of the messages for a finite time window. Controllers can be designed using the optimization algorithms for model predictive control by considering the timing as optimization constraints. This timing model allows multiple controllers to share a CAN without significant degradation in the controller performance. The timing model also provides a convenient way to check the schedulability of messages on the CAN at runtime. Simulation results demonstrate that the timing model is accurate and computationally efficient to meet the needs of real-time implementation. Simulation results also demonstrate that model predictive controllers designed when considering the timing constraints have superior performance than the controllers designed without considering the timing constraints.
The well-known plastic number substitution gives rise to a ternary inflation tiling of the real line whose inflation factor is the smallest Pisot-Vijayaraghavan number. The corresponding dynamical system has pure point spectrum, and the associated co
ntrol point sets can be described as regular model sets whose windows in two-dimensional internal space are Rauzy fractals with a complicated structure. Here, we calculate the resulting pure point diffraction measure via a Fourier matrix cocycle, which admits a closed formula for the Fourier transform of the Rauzy fractals, via a rapidly converging infinite product.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
