arXiv subjects

Louis M. Pecora

Publications and source records attributed to Louis M. Pecora.

12 recordsLinked to original sources

arXiv2025

Introduction to Focus Issue: Topics in Nonlinear Science

Nonlinear science has evolved significantly over the 35 years since the launch of the journal Chaos. This Focus Issue, dedicated to the 80th Birthday of its founding editor-in-chief, David K. Campbell, brings together a selection of contributions on influential topics, many of which were advanced by Campbell's own research program and leadership role. The topics include new phenomena and method development in the realms of network dynamics, machine learning, quantum and material systems, chaos and fractals, localized states, and living systems, with a good balance of literature review, original contributions, and perspectives for future research.

nlin.AO↗

arXiv2021

Comment on "Synchronization dynamics in non-normal networks: the trade-off for optimality"

A recent paper by R. Muolo, T. Carletti, J. P. Gleeson, and M. Asllani [Entropy 23, 36 (2021)] presents a mainly numerical study on the role of non-normality in the synchronization of coupled periodic oscillators, deriving apparent contradictions with the existing literature. Here, we show that their conclusions are artifactual due to a misinterpretation of the master stability function formalism and confirm that the existing literature is correct. We also point to a broader existing literature in which research considered in this paper was correctly addressed numerically, analytically, and experimentally.

nlin.AO↗

arXiv2019

Network Structure Effects in Reservoir Computers

A reservoir computer is a complex nonlinear dynamical system that has been shown to be useful for solving certain problems, such as prediction of chaotic signals, speech recognition or control of robotic systems. Typically a reservoir computer is constructed by connecting a large number of nonlinear nodes in a network, driving the nodes with an input signal and using the node outputs to fit a training signal. In this work, we set up reservoirs where the edges (or connections) between all the network nodes are either +1 or 0, and proceed to alter the network structure by flipping some of these edges from +1 to -1. We use this simple network because it turns out to be easy to characterize; we may use the fraction of edges flipped as a measure of how much we have altered the network. In some cases, the network can be rearranged in a finite number of ways without changing its structure; these rearrangements are symmetries of the network, and the number of symmetries is also useful for characterizing the network. We find that changing the number of edges flipped in the network changes the rank of the covariance of a matrix consisting of the time series from the different nodes in the network, and speculate that this rank is important for understanding the reservoir computer performance.

cs.ET↗

arXiv2018

Symmetries in the time-averaged dynamics of networks: reducing unnecessary complexity through minimal network models

Complex networks are the subject of fundamental interest from the scientific community at large. Several metrics have been introduced to characterize the structure of these networks, such as the degree distribution, degree correlation, path length, clustering coefficient, centrality measures etc. Another important feature is the presence of network symmetries. In particular, the effect of these symmetries has been studied in the context of network synchronization, where they have been used to predict the emergence and stability of cluster synchronous states. Here we provide theoretical, numerical, and experimental evidence that network symmetries play a role in a substantially broader class of dynamical models on networks, including epidemics, game theory, communication, and coupled excitable systems. Namely, we see that in all these models, nodes that are related by a symmetry relation show the same time-averaged dynamical properties. This discovery leads us to propose reduction techniques for exact, yet minimal, simulation of complex networks dynamics, which we show are effective in order to optimize the use of computational resources, such as computation time and memory.

physics.soc-ph↗

arXiv2016

Introduction to Focus Issue: Patterns of Network Synchronization

The study of synchronization of coupled systems is currently undergoing a major surge fueled by recent discoveries of new forms of collective dynamics and the development of techniques to characterize a myriad of new patterns of network synchronization. This includes chimera states, phenomena determined by symmetry, remote synchronization, and asymmetry-induced synchronization. This Focus Issue presents a selection of contributions at the forefront of these developments, to which this introduction is intended to offer an up-to-date foundation.

cond-mat.dis-nn↗

arXiv2015

Complete Characterization of Stability of Cluster Synchronization in Complex Dynamical Networks

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted in order to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based upon the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. The understanding of how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe here a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically-equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an electro-optic experiment on a 5 node network that confirms the synchronization patterns predicted by the theory.

nlin.CD↗

arXiv2013

Symmetries, Cluster Synchronization, and Isolated Desynchronization in Complex Networks

Synchronization is of central importance in power distribution, telecommunication, neuronal, and biological networks. Many networks are observed to produce patterns of synchronized clusters, but it has been difficult to predict these clusters or understand the conditions under which they form, except for in the simplest of networks. In this article, we shed light on the intimate connection between network symmetry and cluster synchronization. We introduce general techniques that use network symmetries to reveal the patterns of synchronized clusters and determine the conditions under which they persist. The connection between symmetry and cluster synchronization is experimentally explored using an electro-optic network. We experimentally observe and theoretically predict a surprising phenomenon in which some clusters lose synchrony while leaving others synchronized. The results could guide the design of new power grid systems or lead to new understanding of the dynamical behavior of networks ranging from neural to social.

nlin.CD↗

arXiv2012

Regularization of Tunneling Rates with Quantum Chaos

We study tunneling in various shaped, closed, two-dimensional, flat potential, double wells by calculating the energy splitting between symmetric and anti-symmetric state pairs. For shapes that have regular or nearly regular classical behavior (e.g. rectangular or circular) the tunneling rates vary greatly over wide ranges often by several orders of magnitude. However, for well shapes that admit more classically chaotic behavior (e.g. the stadium, the Sinai billiard) the range of tunneling rates narrows, often by orders of magnitude. This dramatic narrowing appears to come from destabilization of periodic orbits in the regular wells that produce the largest and smallest tunneling rates and causes the splitting vs. energy relation to take on a possibly universal shape. It is in this sense that we say the quantum chaos regularizes the tunneling rates.

quant-ph↗

arXiv2011

"Weak Quantum Chaos" and its resistor network modeling

Weakly chaotic or weakly interacting systems have a wide regime where the common random matrix theory modeling does not apply. As an example we consider cold atoms in a nearly integrable optical billiard with displaceable wall ("piston"). The motion is completely chaotic but with small Lyapunov exponent. The Hamiltonian matrix does not look like one taken from a Gaussian ensemble, but rather it is very sparse and textured. This can be characterized by parameters $s$ and $g$ that reflect the percentage of large elements, and their connectivity, respectively. For $g$ we use a resistor network calculation that has a direct relation to the semi-linear response characteristics of the system, hence leading to a novel prediction regarding the rate of heating of cold atoms in optical billiards with vibrating walls.

quant-ph↗

arXiv2010

Quantum response of weakly chaotic systems

Chaotic systems, that have a small Lyapunov exponent, do not obey the common random matrix theory predictions within a wide "weak quantum chaos" regime. This leads to a novel prediction for the rate of heating for cold atoms in optical billiards with vibrating walls. The Hamiltonian matrix of the driven system does not look like one from a Gaussian ensemble, but rather it is very sparse. This sparsity can be characterized by parameters $s$ and $g$ that reflect the percentage of large elements, and their connectivity respectively. For $g$ we use a resistor network calculation that has direct relation to the semi-linear response characteristics of the system.

quant-ph↗

arXiv2006

A Unified Approach to Attractor Reconstruction

In the analysis of complex, nonlinear time series, scientists in a variety of disciplines have relied on a time delayed embedding of their data, i.e. attractor reconstruction. The process has focused primarily on heuristic and empirical arguments for selection of the key embedding parameters, delay and embedding dimension. This approach has left several long-standing, but common problems unresolved in which the standard approaches produce inferior results or give no guidance at all. We view the current reconstruction process as unnecessarily broken into separate problems. We propose an alternative approach that views the problem of choosing all embedding parameters as being one and the same problem addressable using a single statistical test formulated directly from the reconstruction theorems. This allows for varying time delays appropriate to the data and simultaneously helps decide on embedding dimension. A second new statistic, undersampling, acts as a check against overly long time delays and overly large embedding dimension. Our approach is more flexible than those currently used, but is more directly connected with the mathematical requirements of embedding. In addition, the statistics developed guide the user by allowing optimization and warning when embedding parameters are chosen beyond what the data can support. We demonstrate our approach on uni- and multivariate data, data possessing multiple time scales, and chaotic data. This unified approach resolves all the main issues in attractor reconstruction.

nlin.CD↗

arXiv2001

Synchronization in small-world systems

We quantify the dynamical implications of the small-world phenomenon. We consider the generic synchronization of oscillator networks of arbitrary topology, and link the linear stability of the synchronous state to an algebraic condition of the Laplacian of the graph. We show numerically that the addition of random shortcuts produces improved network synchronizability. Further, we use a perturbation analysis to place the synchronization threshold in relation to the boundaries of the small-world region. Our results also show that small-worlds synchronize as efficiently as random graphs and hypercubes, and more so than standard constructive graphs.

nlin.CD↗