Author
Louis M. Pecora
Other affiliations: United States Department of the Navy
Bio: Louis M. Pecora is an academic researcher from United States Naval Research Laboratory. The author has contributed to research in topics: Synchronization of chaos & Chaotic. The author has an hindex of 37, co-authored 116 publications receiving 20778 citations. Previous affiliations of Louis M. Pecora include United States Department of the Navy.
Papers published on a yearly basis
Papers
More filters
TL;DR: This chapter describes the linking of two chaotic systems with a common signal or signals and highlights that when the signs of the Lyapunov exponents for the subsystems are all negative the systems are synchronized.
Abstract: Certain subsystems of nonlinear, chaotic systems can be made to synchronize by linking them with common signals. The criterion for this is the sign of the sub-Lyapunov exponents. We apply these ideas to a real set of synchronizing chaotic circuits.
9,201 citations
TL;DR: In this paper, the authors show that many coupled oscillator array configurations considered in the literature can be put into a simple form so that determining the stability of the synchronous state can be done by a master stability function, which can be tailored to one's choice of stability requirement.
Abstract: We show that many coupled oscillator array configurations considered in the literature can be put into a simple form so that determining the stability of the synchronous state can be done by a master stability function, which can be tailored to one's choice of stability requirement. This solves, once and for all, the problem of synchronous stability for any linear coupling of that oscillator.
2,209 citations
TL;DR: Applied to networks of low redundancy, the small-world route produces synchronizability more efficiently than standard deterministic graphs, purely random graphs, and ideal constructive schemes.
Abstract: We quantify the dynamical implications of the small-world phenomenon by considering the generic synchronization of oscillator networks of arbitrary topology. The linear stability of the synchronous state is linked to an algebraic condition of the Laplacian matrix of the network. Through numerics and analysis, we show how the addition of random shortcuts translates into improved network synchronizability. Applied to networks of low redundancy, the small-world route produces synchronizability more efficiently than standard deterministic graphs, purely random graphs, and ideal constructive schemes. However, the small-world property does not guarantee synchronizability: the synchronization threshold lies within the boundaries, but linked to the end of the small-world region.
1,483 citations
TL;DR: The authors describe the conditions necessary for synchronizing a subsystem of one chaotic system with a separate chaotic system by sending a signal from the chaotic system to the subsystem by sending signals from the Chaos Junction.
Abstract: The authors describe the conditions necessary for synchronizing a subsystem of one chaotic system with a separate chaotic system by sending a signal from the chaotic system to the subsystem. The general scheme for creating synchronizing systems is to take a nonlinear system, duplicate some subsystem of this system, and drive the duplicate and the original subsystem with signals from the unduplicated part. This is a generalization of driving or forcing a system. The process can be visualized with ordinary differential equations. The authors have build a simple circuit based on chaotic circuits described by R. W. Newcomb et al. (1983, 1986), and they use this circuit to demonstrate this chaotic synchronization. >
1,234 citations
TL;DR: The historical timeline of this topic back to the earliest known paper is established and it is shown that building synchronizing systems leads naturally to engineering more complex systems whose constituents are chaotic, but which can be tuned to output various chaotic signals.
Abstract: We review some of the history and early work in the area of synchronization in chaotic systems. We start with our own discovery of the phenomenon, but go on to establish the historical timeline of this topic back to the earliest known paper. The topic of synchronization of chaotic systems has always been intriguing, since chaotic systems are known to resist synchronization because of their positive Lyapunov exponents. The convergence of the two systems to identical trajectories is a surprise. We show how people originally thought about this process and how the concept of synchronization changed over the years to a more geometric view using synchronization manifolds. We also show that building synchronizing systems leads naturally to engineering more complex systems whose constituents are chaotic, but which can be tuned to output various chaotic signals. We finally end up at a topic that is still in very active exploration today and that is synchronization of dynamical systems in networks of oscillators.
1,139 citations
Cited by
More filters
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Abstract: Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
17,647 citations
TL;DR: This article reviews studies investigating complex brain networks in diverse experimental modalities and provides an accessible introduction to the basic principles of graph theory and highlights the technical challenges and key questions to be addressed by future developments in this rapidly moving field.
Abstract: Recent developments in the quantitative analysis of complex networks, based largely on graph theory, have been rapidly translated to studies of brain network organization. The brain's structural and functional systems have features of complex networks--such as small-world topology, highly connected hubs and modularity--both at the whole-brain scale of human neuroimaging and at a cellular scale in non-human animals. In this article, we review studies investigating complex brain networks in diverse experimental modalities (including structural and functional MRI, diffusion tensor imaging, magnetoencephalography and electroencephalography in humans) and provide an accessible introduction to the basic principles of graph theory. We also highlight some of the technical challenges and key questions to be addressed by future developments in this rapidly moving field.
9,700 citations
TL;DR: The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.
9,441 citations
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
Abstract: The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
9,057 citations
TL;DR: A thorough exposition of the main elements of the clustering problem can be found in this paper, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
8,432 citations