Synchronization of complex dynamical networks with fractional order

Complex dynamical networks (CDN) can be applied to many areas in real world, from medicine, biology, Internet to sociology. Study on CDNs has drawn great attention in recent years. Nodes in a CDN can be modelled as systems represented by differential equations. Study has shown that fractional order differential equations (DF) can better represent some real world systems than integer-order DFs. This research work focuses on synchronization in fractional CDNs.  A literature review on CDNs with fractional order has summarized the latest works in this area.  Fractional chaotic systems are studied in our initial investigation.  Fractional calculus is introduced and the relevant fundamentals to model, describe and analyse dynamical networks are presented. It is shown that the structure and topological characteristics of a network can have a big impact on its synchronizability. Synchronizability and its various interpretations in dynamical networks are studied. To synchronize a CDN efficiently, controllers are generally needed. Controller design is one of the main tasks in this research. Our first design is a new sliding mode control to synchronize a dynamical network with two nodes. Its stability has been proven and verified by simulations.  Its convergence speed outperforms Vaidyanathan's scheme, a well-recognized scheme in this area. The design can be generalized to CDNs with more nodes.  As many applications can be modelled as CDNs with node clustering, a different sliding mode control is designed for cluster synchronization of a CDN with fractional order. Its stability is proven by using Lyapunov method. Its convergence and efficiency is shown in a simulation. Besides these nonlinear methods mentioned, linear control is also studied intensively for the synchronization.  A novel linear method for synchronization of fractional CDNs using a new fractional Proportional-Integral (PI) pinning control is proposed.  Its stability is proven and the synchronization criteria are obtained. The criteria have been simplified using two corollaries so the right value for the variables can be easily assigned. The proposed method is compared with the conventional linear method which uses Proportional (P) controller. In the comparison, the mean squared error function is used. The function measures the average of the squared errors and it is an instant indicator of the synchronization efficiency. A numerical simulation is repeated 100 times to obtain the averages over these runs. Each simulation has different random initial values for both controllers. The average of the errors in all the 100 simulations is obtained and the area under the function curve is defined as an overall performance index (OPI), which indicates the controller's overall performance. In control, small overshoot is always desired. In our work, the error variation is also used as a measure.  The maximum variation from the average of 100 simulations is calculated and compared for both methods. With all the statistical comparisons, it is clear that with the same power consumption, the proposed method outperforms the conventional one and achieves faster and smoother synchronization. Communication constraints exist in most real world CDNs. Communication constraints and their impact on control and synchronization of CDNs with fractional order are investigated in our study. A new adaptive method for synchronizing fractional CDN with disturbance and uncertainty is designed. Its stability is proven and its synchronization criteria are obtained for both fractional CDN with known and unknown parameters. Random disturbance is also included in both cases. Our results show that the new method is efficient in synchronizing CDNs with presence of both disturbance and uncertainty

Coupling functions:universal insights into dynamical interaction mechanisms

The dynamical systems found in Nature are rarely isolated. Instead they interact and influence each other. The coupling functions that connect them contain detailed information about the functional mechanisms underlying the interactions and prescribe the physical rule specifying how an interaction occurs. Here, we aim to present a coherent and comprehensive review encompassing the rapid progress made recently in the analysis, understanding and applications of coupling functions. The basic concepts and characteristics of coupling functions are presented through demonstrative examples of different domains, revealing the mechanisms and emphasizing their multivariate nature. The theory of coupling functions is discussed through gradually increasing complexity from strong and weak interactions to globally-coupled systems and networks. A variety of methods that have been developed for the detection and reconstruction of coupling functions from measured data is described. These methods are based on different statistical techniques for dynamical inference. Stemming from physics, such methods are being applied in diverse areas of science and technology, including chemistry, biology, physiology, neuroscience, social sciences, mechanics and secure communications. This breadth of application illustrates the universality of coupling functions for studying the interaction mechanisms of coupled dynamical systems

Resilient Learning-Based Control for Synchronization of Passive Multi-Agent Systems under Attack

In this paper, we show synchronization for a group of output passive agents that communicate with each other according to an underlying communication graph to achieve a common goal. We propose a distributed event-triggered control framework that will guarantee synchronization and considerably decrease the required communication load on the band-limited network. We define a general Byzantine attack on the event-triggered multi-agent network system and characterize its negative effects on synchronization. The Byzantine agents are capable of intelligently falsifying their data and manipulating the underlying communication graph by altering their respective control feedback weights. We introduce a decentralized detection framework and analyze its steady-state and transient performances. We propose a way of identifying individual Byzantine neighbors and a learning-based method of estimating the attack parameters. Lastly, we propose learning-based control approaches to mitigate the negative effects of the adversarial attack

The Stability and Control of Stochastically Switching Dynamical Systems

Inherent randomness and unpredictability is an underlying property in most realistic phenomena. In this work, we present a new framework for introducing stochasticity into dynamical systems via intermittently switching between deterministic regimes. Extending the work by Belykh, Belykh, and Hasler, we provide analytical insight into how randomly switching network topologies behave with respect to their averaged, static counterparts (obtained by replacing the stochastic variables with their expectation) when switching is fast. Beyond fast switching, we uncover a highly nontrivial phenomenon by which a network can switch between two asynchronous regimes and synchronize against all odds. Then, we establish rigorous theory for this framework in discrete-time systems for arbitrary switching periods (not limited to switching at each time step). Using stability and ergodic theories, we are able to provide analytical criteria for the stability of synchronization for two coupled maps and the ability of a single map to control an arbitrary network of maps. This work not only presents new phenomena in stochastically switching dynamical systems, but also provides the first rigorous analysis of switching dynamical systems with an arbitrary switching period

18th IEEE Workshop on Nonlinear Dynamics of Electronic Systems: Proceedings

Proceedings of the 18th IEEE Workshop on Nonlinear Dynamics of Electronic Systems, which took place in Dresden, Germany, 26 – 28 May 2010.:Welcome Address ........................ Page I Table of Contents ........................ Page III Symposium Committees .............. Page IV Special Thanks ............................. Page V Conference program (incl. page numbers of papers) ................... Page VI Conference papers Invited talks ................................ Page 1 Regular Papers ........................... Page 14 Wednesday, May 26th, 2010 ......... Page 15 Thursday, May 27th, 2010 .......... Page 110 Friday, May 28th, 2010 ............... Page 210 Author index ............................... Page XII

The Kuramoto model in complex networks

181 pages, 48 figures. In Press, Accepted Manuscript, Physics Reports 2015 Acknowledgments We are indebted with B. Sonnenschein, E. R. dos Santos, P. Schultz, C. Grabow, M. Ha and C. Choi for insightful and helpful discussions. T.P. acknowledges FAPESP (No. 2012/22160-7 and No. 2015/02486-3) and IRTG 1740. P.J. thanks founding from the China Scholarship Council (CSC). F.A.R. acknowledges CNPq (Grant No. 305940/2010-4) and FAPESP (Grants No. 2011/50761-2 and No. 2013/26416-9) for financial support. J.K. would like to acknowledge IRTG 1740 (DFG and FAPESP).Peer reviewedPreprin