Ultimate boundary estimations and topological horseshoe analysis of a new 4D hyper-chaotic system

In this paper, we first estimate the boundedness of a new proposed 4-dimensional (4D) hyper-chaotic system with complex dynamical behaviors. For this system, the ultimate bound set Ω1 and globally exponentially attractive set Ω2 are derived based on the optimization method, Lyapunov stability theory and comparison principle. Numerical simulations are presented to show the effectiveness of the method and the boundary regions. Then, to prove the existence of hyper-chaos, the hyper-chaotic dynamics of the 4D nonlinear system is investigated by means of topological horseshoe theory and numerical computation. Based on the algorithm for finding horseshoes in three-dimensional hyper-chaotic maps, we finally find a horseshoe with two-directional expansions in the 4D hyper-chaotic system, which can rigorously prove the existence of the hyper-chaos in theory

Synchronization in networks with multiple interaction layers

The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rössler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network

Synchrony and bifurcations in coupled dynamical systems and effects of time delay

Dynamik auf Netzwerken ist ein mathematisches Feld, das in den letzten Jahrzehnten schnell gewachsen ist und Anwendungen in zahlreichen Disziplinen wie z.B. Physik, Biologie und Soziologie findet. Die Funktion vieler Netzwerke hängt von der Fähigkeit ab, die Elemente des Netzwerkes zu synchronisieren. Mit anderen Worten, die Existenz und die transversale Stabilität der synchronen Mannigfaltigkeit sind zentrale Eigenschaften. Erst seit einigen Jahren wird versucht, den verwickelten Zusammenhang zwischen der Kopplungsstruktur und den Stabilitätseigenschaften synchroner Zustände zu verstehen. Genau das ist das zentrale Thema dieser Arbeit. Zunächst präsentiere ich erste Ergebnisse zur Klassifizierung der Kanten eines gerichteten Netzwerks bezüglich ihrer Bedeutung für die Stabilität des synchronen Zustands. Folgend untersuche ich ein komplexes Verzweigungsszenario in einem gerichteten Ring von Stuart-Landau Oszillatoren und zeige, dass das Szenario persistent ist, wenn dem Netzwerk eine schwach gewichtete Kante hinzugefügt wird. Daraufhin untersuche ich synchrone Zustände in Ringen von Phasenoszillatoren die mit Zeitverzögerung gekoppelt sind. Ich bespreche die Koexistenz synchroner Lösungen und analysiere deren Stabilität und Verzweigungen. Weiter zeige ich, dass eine Zeitverschiebung genutzt werden kann, um Muster im Ring zu speichern und wiederzuerkennen. Diese Zeitverschiebung untersuche ich daraufhin für beliebige Kopplungsstrukturen. Ich zeige, dass invariante Mannigfaltigkeiten des Flusses sowie ihre Stabilität unter der Zeitverschiebung erhalten bleiben. Darüber hinaus bestimme ich die minimale Anzahl von Zeitverzögerungen, die gebraucht werden, um das System äquivalent zu beschreiben. Schließlich untersuche ich das auffällige Phänomen eines nichtstetigen Übergangs zu Synchronizität in Klassen großer Zufallsnetzwerke indem ich einen kürzlich eingeführten Zugang zur Beschreibung großer Zufallsnetzwerke auf den Fall zeitverzögerter Kopplungen verallgemeinere.Since a couple of decades, dynamics on networks is a rapidly growing branch of mathematics with applications in various disciplines such as physics, biology or sociology. The functioning of many networks heavily relies on the ability to synchronize the network’s nodes. More precisely, the existence and the transverse stability of the synchronous manifold are essential properties. It was only in the last few years that people tried to understand the entangled relation between the coupling structure of a network, given by a (di-)graph, and the stability properties of synchronous states. This is the central theme of this dissertation. I first present results towards a classification of the links in a directed, diffusive network according to their impact on the stability of synchronization. Then I investigate a complex bifurcation scenario observed in a directed ring of Stuart-Landau oscillators. I show that under the addition of a single weak link, this scenario is persistent. Subsequently, I investigate synchronous patterns in a directed ring of phase oscillators coupled with time delay. I discuss the coexistence of multiple of synchronous solutions and investigate their stability and bifurcations. I apply these results by showing that a certain time-shift transformation can be used in order to employ the ring as a pattern recognition device. Next, I investigate the same time-shift transformation for arbitrary coupling structures in a very general setting. I show that invariant manifolds of the flow together with their stability properties are conserved under the time-shift transformation. Furthermore, I determine the minimal number of delays needed to equivalently describe the system’s dynamics. Finally, I investigate a peculiar phenomenon of non-continuous transition to synchrony observed in certain classes of large random networks, generalizing a recently introduced approach for the description of large random networks to the case of delayed couplings

Information-Theoretic Privacy through Chaos Synchronization and Optimal Additive Noise

We study the problem of maximizing privacy of data sets by adding random vectors generated via synchronized chaotic oscillators. In particular, we consider the setup where information about data sets, queries, is sent through public (unsecured) communication channels to a remote station. To hide private features (specific entries) within the data set, we corrupt the response to queries by adding random vectors. We send the distorted query (the sum of the requested query and the random vector) through the public channel. The distribution of the additive random vector is designed to minimize the mutual information (our privacy metric) between private entries of the data set and the distorted query. We cast the synthesis of this distribution as a convex program in the probabilities of the additive random vector. Once we have the optimal distribution, we propose an algorithm to generate pseudo-random realizations from this distribution using trajectories of a chaotic oscillator. At the other end of the channel, we have a second chaotic oscillator, which we use to generate realizations from the same distribution. Note that if we obtain the same realizations on both sides of the channel, we can simply subtract the realization from the distorted query to recover the requested query. To generate equal realizations, we need the two chaotic oscillators to be synchronized, i.e., we need them to generate exactly the same trajectories on both sides of the channel synchronously in time. We force the two chaotic oscillators into exponential synchronization using a driving signal. Simulations are presented to illustrate our results.Comment: arXiv admin note: text overlap with arXiv:1809.03133 by other author

Hybrid Chaos Synchronization of 3-Cells Cellular Neural Network Attractors via Adaptive Control Method

Abstract: In this research work, we first discuss the properties of the 3-cells cellular neural network (CNN) attractor discovered b

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

Complexity, Emergent Systems and Complex Biological Systems:\ud Complex Systems Theory and Biodynamics. [Edited book by I.C. Baianu, with listed contributors (2011)]

An overview is presented of System dynamics, the study of the behaviour of complex systems, Dynamical system in mathematics Dynamic programming in computer science and control theory, Complex systems biology, Neurodynamics and Psychodynamics.\u

Causality and synchronisation in complex systems with applications to neuroscience

This thesis presents an investigation, of synchronisation and causality, motivated by problems in computational neuroscience. The thesis addresses both theoretical and practical signal processing issues regarding the estimation of interdependence from a set of multivariate data generated by a complex underlying dynamical system. This topic is driven by a series of problems in neuroscience, which represents the principal background motive behind the material in this work. The underlying system is the human brain and the generative process of the data is based on modern electromagnetic neuroimaging methods . In this thesis, the underlying functional of the brain mechanisms are derived from the recent mathematical formalism of dynamical systems in complex networks. This is justified principally on the grounds of the complex hierarchical and multiscale nature of the brain and it offers new methods of analysis to model its emergent phenomena. A fundamental approach to study the neural activity is to investigate the connectivity pattern developed by the brain’s complex network. Three types of connectivity are important to study: 1) anatomical connectivity refering to the physical links forming the topology of the brain network; 2) effective connectivity concerning with the way the neural elements communicate with each other using the brain’s anatomical structure, through phenomena of synchronisation and information transfer; 3) functional connectivity, presenting an epistemic concept which alludes to the interdependence between data measured from the brain network. The main contribution of this thesis is to present, apply and discuss novel algorithms of functional connectivities, which are designed to extract different specific aspects of interaction between the underlying generators of the data. Firstly, a univariate statistic is developed to allow for indirect assessment of synchronisation in the local network from a single time series. This approach is useful in inferring the coupling as in a local cortical area as observed by a single measurement electrode. Secondly, different existing methods of phase synchronisation are considered from the perspective of experimental data analysis and inference of coupling from observed data. These methods are designed to address the estimation of medium to long range connectivity and their differences are particularly relevant in the context of volume conduction, that is known to produce spurious detections of connectivity. Finally, an asymmetric temporal metric is introduced in order to detect the direction of the coupling between different regions of the brain. The method developed in this thesis is based on a machine learning extensions of the well known concept of Granger causality. The thesis discussion is developed alongside examples of synthetic and experimental real data. The synthetic data are simulations of complex dynamical systems with the intention to mimic the behaviour of simple cortical neural assemblies. They are helpful to test the techniques developed in this thesis. The real datasets are provided to illustrate the problem of brain connectivity in the case of important neurological disorders such as Epilepsy and Parkinson’s disease. The methods of functional connectivity in this thesis are applied to intracranial EEG recordings in order to extract features, which characterize underlying spatiotemporal dynamics before during and after an epileptic seizure and predict seizure location and onset prior to conventional electrographic signs. The methodology is also applied to a MEG dataset containing healthy, Parkinson’s and dementia subjects with the scope of distinguishing patterns of pathological from physiological connectivity

Synchronization in Complex Networks Under Uncertainty

La sincronització en xarxes és la música dels sistemes complexes. Els ritmes col·lectius que emergeixen de molts oscil·ladors acoblats expliquen el batec constant del cor, els patrons recurrents d'activitat neuronal i la sincronia descentralitzada a les xarxes elèctriques. Els models matemàtics són sòlids i han avançat significativament, especialment en el problema del camp mitjà, on tots els oscil·ladors estan connectats mútuament. Tanmateix, les xarxes reals tenen interaccions complexes que dificulten el tractament analític. Falta un marc general i les soluciones existents en caixes negres numèriques i espectrals dificulten la interpretació. A més, la informació obtinguda en mesures empíriques sol ser incompleta. Motivats per aquestes limitacions, en aquesta tesi proposem un estudi teòric dels oscil·ladors acoblats en xarxes sota incertesa. Apliquem propagació d'errors per predir com una estructura complexa amplifica el soroll des dels pesos microscòpics fins al punt crític de sincronització, estudiem l'efecte d'equilibrar les interaccions de parelles i d'ordre superior en l'optimització de la sincronia i derivem esquemes d'ajust de pesos per mapejar el comportament de sincronització en xarxes diferents. A més, un desplegament geomètric rigorós de l'estat sincronitzat ens permet abordar escenaris descentralitzats i descobrir regles locals òptimes que indueixen transicions globals abruptes. Finalment, suggerim dreceres espectrals per predir punts crítics amb àlgebra lineal i representacions aproximades de xarxa. En general, proporcionem eines analítiques per tractar les xarxes d'oscil·ladors en condicions sorolloses i demostrem que darrere els supòsits predominants d'informació completa s'amaguen explicacions mecanicistes clares. Troballes rellevants inclouen xarxes particulars que maximitzen el ventall de comportaments i el desplegament exitós del binomi estructura-dinàmica des d'una perspectiva local. Aquesta tesi avança la recerca d'una teoria general de la sincronització en xarxes a partir de principis mecanicistes i geomètrics, una peça clau que manca en l'anàlisi, disseny i control de xarxes neuronals biològiques i artificials i sistemes d'enginyeria complexos.La sincronización en redes es la música de los sistemas complejos. Los ritmos colectivos que emergen de muchos osciladores acoplados explican el latido constante del corazón, los patrones recurrentes de actividad neuronal y la sincronía descentralizada de las redes eléctricas. Los modelos matemáticos son sólidos y han avanzado significativamente, especialmente en el problema del campo medio, donde todos los osciladores están conectados entre sí. Sin embargo, las redes reales tienen interacciones complejas que dificultan el tratamiento analítico. Falta un marco general y las soluciones en cajas negras numéricas y espectrales dificultan la interpretación. Además, las mediciones empíricas suelen ser incompletas. Motivados por estas limitaciones, en esta tesis proponemos un estudio teórico de osciladores acoplados en redes bajo incertidumbre. Aplicamos propagación de errores para predecir cómo una estructura compleja amplifica el ruido desde las conexiones microscópicas hasta puntos críticos macroscópicos, estudiamos el efecto de equilibrar interacciones por pares y de orden superior en la optimización de la sincronía y derivamos esquemas de ajuste de pesos para mapear el comportamiento en estructuras distintas. Una expansión geométrica del estado sincronizado nos permite abordar escenarios descentralizados y descubrir reglas locales que inducen transiciones abruptas globales. Por último, sugerimos atajos espectrales para predecir puntos críticos usando álgebra lineal y representaciones aproximadas de red. En general, proporcionamos herramientas analíticas para manejar redes de osciladores en condiciones ruidosas y demostramos que detrás de las suposiciones predominantes de información completa se ocultaban claras explicaciones mecanicistas. Hallazgos relevantes incluyen redes particulares que maximizan el rango de comportamientos y la explicación del binomio estructura-dinámica desde una perspectiva local. Esta tesis avanza en la búsqueda de una teoría general de sincronización en redes desde principios mecánicos y geométricos, una pieza clave que falta en el análisis, diseño y control de redes neuronales biológicas y artificiales y sistemas de ingeniería complejos.Synchronization in networks is the music of complex systems. Collective rhythms emerging from many interacting oscillators appear across all scales of nature, from the steady heartbeat and the recurrent patterns in neuronal activity to the decentralized synchrony in power-grids. The mathematics behind these processes are solid and have significantly advanced lately, especially in the mean-field problem, where oscillators are all mutually connected. However, real networks have complex interactions that difficult the analytical treatment. A general framework is missing and most existing results rely on numerical and spectral black-boxes that hinder interpretation. Also, the information obtained from measurements is usually incomplete. Motivated by these limitations, in this thesis we propose a theoretical study of network-coupled oscillators under uncertainty. We apply error propagation to predict how a complex structure amplifies noise from the link weights to the synchronization onset, study the effect of balancing pair-wise and higher-order interactions in synchrony optimization, and derive weight-tuning schemes to map the synchronization behavior of different structures. Also, we develop a rigorous geometric unfolding of the synchronized state to tackle decentralized scenarios and to discover optimal local rules that induce global abrupt transitions. Last, we suggest spectral shortcuts to predict critical points using linear algebra and network representations with limited information. Overall, we provide analytical tools to deal with oscillator networks under noisy conditions and prove that mechanistic explanations were hidden behind the prevalent assumptions of complete information. Relevant finding include particular networks that maximize the range of behaviors and the successful unfolding of the structure-dynamics interplay from a local perspective. This thesis advances the quest of a general theory of network synchronization built from mechanistic and geometric principles, a key missing piece in the analysis, design and control of biological and artificial neural networks and complex engineering systems

Control of chaos in nonlinear circuits and systems

Nonlinear circuits and systems, such as electronic circuits (Chapter 5), power converters (Chapter 6), human brains (Chapter 7), phase lock loops (Chapter 8), sigma delta modulators (Chapter 9), etc, are found almost everywhere. Understanding nonlinear behaviours as well as control of these circuits and systems are important for real practical engineering applications. Control theories for linear circuits and systems are well developed and almost complete. However, different nonlinear circuits and systems could exhibit very different behaviours. Hence, it is difficult to unify a general control theory for general nonlinear circuits and systems. Up to now, control theories for nonlinear circuits and systems are still very limited. The objective of this book is to review the state of the art chaos control methods for some common nonlinear circuits and systems, such as those listed in the above, and stimulate further research and development in chaos control for nonlinear circuits and systems. This book consists of three parts. The first part of the book consists of reviews on general chaos control methods. In particular, a time-delayed approach written by H. Huang and G. Feng is reviewed in Chapter 1. A master slave synchronization problem for chaotic Lur’e systems is considered. A delay independent and delay dependent synchronization criteria are derived based on the H performance. The design of the time delayed feedback controller can be accomplished by means of the feasibility of linear matrix inequalities. In Chapter 2, a fuzzy model based approach written by H.K. Lam and F.H.F. Leung is reviewed. The synchronization of chaotic systems subject to parameter uncertainties is considered. A chaotic system is first represented by the fuzzy model. A switching controller is then employed to synchronize the systems. The stability conditions in terms of linear matrix inequalities are derived based on the Lyapunov stability theory. The tracking performance and parameter design of the controller are formulated as a generalized eigenvalue minimization problem which is solved numerically via some convex programming techniques. In Chapter 3, a sliding mode control approach written by Y. Feng and X. Yu is reviewed. Three kinds of sliding mode control methods, traditional sliding mode control, terminal sliding mode control and non-singular terminal sliding mode control, are employed for the control of a chaotic system to realize two different control objectives, namely to force the system states to converge to zero or to track desired trajectories. Observer based chaos synchronizations for chaotic systems with single nonlinearity and multi-nonlinearities are also presented. In Chapter 4, an optimal control approach written by C.Z. Wu, C.M. Liu, K.L. Teo and Q.X. Shao is reviewed. Systems with nonparametric regression with jump points are considered. The rough locations of all the possible jump points are identified using existing kernel methods. A smooth spline function is used to approximate each segment of the regression function. A time scaling transformation is derived so as to map the undecided jump points to fixed points. The approximation problem is formulated as an optimization problem and solved via existing optimization tools. The second part of the book consists of reviews on general chaos controls for continuous-time systems. In particular, chaos controls for Chua’s circuits written by L.A.B. Tôrres, L.A. Aguirre, R.M. Palhares and E.M.A.M. Mendes are discussed in Chapter 5. An inductorless Chua’s circuit realization is presented, as well as some practical issues, such as data analysis, mathematical modelling and dynamical characterization, are discussed. The tradeoff among the control objective, the control energy and the model complexity is derived. In Chapter 6, chaos controls for pulse width modulation current mode single phase H-bridge inverters written by B. Robert, M. Feki and H.H.C. Iu are discussed. A time delayed feedback controller is used in conjunction with the proportional controller in its simple form as well as in its extended form to stabilize the desired periodic orbit for larger values of the proportional controller gain. This method is very robust and easy to implement. In Chapter 7, chaos controls for epileptiform bursting in the brain written by M.W. Slutzky, P. Cvitanovic and D.J. Mogul are discussed. Chaos analysis and chaos control algorithms for manipulating the seizure like behaviour in a brain slice model are discussed. The techniques provide a nonlinear control pathway for terminating or potentially preventing epileptic seizures in the whole brain. The third part of the book consists of reviews on general chaos controls for discrete-time systems. In particular, chaos controls for phase lock loops written by A.M. Harb and B.A. Harb are discussed in Chapter 8. A nonlinear controller based on the theory of backstepping is designed so that the phase lock loops will not be out of lock. Also, the phase lock loops will not exhibit Hopf bifurcation and chaotic behaviours. In Chapter 9, chaos controls for sigma delta modulators written by B.W.K. Ling, C.Y.F. Ho and J.D. Reiss are discussed. A fuzzy impulsive control approach is employed for the control of the sigma delta modulators. The local stability criterion and the condition for the occurrence of limit cycle behaviours are derived. Based on the derived conditions, a fuzzy impulsive control law is formulated so that the occurrence of the limit cycle behaviours, the effect of the audio clicks and the distance between the state vectors and an invariant set are minimized supposing that the invariant set is nonempty. The state vectors can be bounded within any arbitrary nonempty region no matter what the input step size, the initial condition and the filter parameters are. The editors are much indebted to the editor of the World Scientific Series on Nonlinear Science, Prof. Leon Chua, and to Senior Editor Miss Lakshmi Narayan for their help and congenial processing of the edition