Noise-driven neuromorphic tuned amplifier

Efficient communication over complex dynamical networks: The role of matrix non-normality

In both natural and engineered systems, communication often occurs dynamically over networks ranging from highly structured grids to largely disordered graphs. To use, or comprehend the use of, networks as efficient communication media requires understanding of how they propagate and transform information in the face of noise. Here, we develop a framework that enables us to examine how network structure, noise, and interference between consecutive packets jointly determine transmission performance in complex networks governed by linear dynamics. Mathematically, normal networks, which can be decomposed into separate low-dimensional information channels, suffer greatly from readout noise. Most details of their wiring have no impact on transmission quality. Non-normal networks, however, can largely cancel the effect of noise by transiently amplifying select input dimensions while ignoring others, resulting in higher net information throughput. Our theory could inform the design of new communication networks, as well as the optimal use of existing ones.

Resilience for stochastic systems interacting via a quasi-degenerate network

A stochastic reaction-diffusion model is studied on a networked support. In each patch of the network, two species are assumed to interact following a non-normal reaction scheme. When the interaction unit is replicated on a directed linear lattice, noise gets amplified via a self-consistent process, which we trace back to the degenerate spectrum of the embedding support. The same phenomenon holds when the system is bound to explore a quasidegenerate network. In this case, the eigenvalues of the Laplacian operator, which governs species diffusion, accumulate over a limited portion of the complex plane. The larger the network, the more pronounced the amplification. Beyond a critical network size, a system deemed deterministically stable, hence resilient, can develop seemingly regular patterns in the concentration amount. Non-normality and quasidegenerate networks may, therefore, amplify the inherent stochasticity and so contribute to altering the perception of resilience, as quantified via conventional deterministic methods.

Desynchronization and pattern formation in a noisy feed-forward oscillator network

We consider a one-dimensional directional array of diffusively coupled oscillators. They are perturbed by the injection of small additive noise, typically orders of magnitude smaller than the oscillation amplitude, and the system is studied in a region of the parameters that would yield deterministic synchronization. Non-normal directed couplings seed a coherent amplification of the perturbation: this latter manifests as a modulation, transversal to the limit cycle, which gains in potency node after node. If the lattice extends long enough, the initial synchrony gets eventually lost, and the system moves toward a nontrivial attractor, which can be analytically characterized as an asymptotic splay state. The noise assisted instability, ultimately vehiculated and amplified by the non-normal nature of the imposed couplings, eventually destabilizes also this second attractor. This phenomenon yields spatiotemporal patterns, which cannot be anticipated by a conventional linear stability analysis.

Construction of quasipotentials for stochastic dynamical systems: An optimization approach

The construction of effective and informative landscapes for stochastic dynamical systems has proven a long-standing and complex problem. In many situations, the dynamics may be described by a Langevin equation while constructing a landscape comes down to obtaining the quasipotential, a scalar function that quantifies the likelihood of reaching each point in the state space. In this work we provide a novel method for constructing such landscapes by extending a tool from control theory: the sum-of-squares method for generating Lyapunov functions. Applicable to any system described by polynomials, this method provides an analytical polynomial expression for the potential landscape, in which the coefficients of the polynomial are obtained via a convex optimization problem. The resulting landscapes are based on a decomposition of the deterministic dynamics of the original system, formed in terms of the gradient of the potential and a remaining "curl" component. By satisfying the condition that the inner product of the gradient of the potential and the remaining dynamics is everywhere negative, our derived landscapes provide both upper and lower bounds on the true quasipotential; these bounds becoming tight if the decomposition is orthogonal. The method is demonstrated to correctly compute the quasipotential for high-dimensional linear systems and also for a number of nonlinear examples.