skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: A universal description of stochastic oscillators
Many systems in physics, chemistry, and biology exhibit oscillations with a pronounced random component. Such stochastic oscillations can emerge via different mechanisms, for example, linear dynamics of a stable focus with fluctuations, limit-cycle systems perturbed by noise, or excitable systems in which random inputs lead to a train of pulses. Despite their diverse origins, the phenomenology of random oscillations can be strikingly similar. Here, we introduce a nonlinear transformation of stochastic oscillators to a complex-valued function Q 1 * ( x ) that greatly simplifies and unifies the mathematical description of the oscillator’s spontaneous activity, its response to an external time-dependent perturbation, and the correlation statistics of different oscillators that are weakly coupled. The function Q 1 * ( x ) is the eigenfunction of the Kolmogorov backward operator with the least negative (but nonvanishing) eigenvalue λ 1 = μ 1 + iω 1 . The resulting power spectrum of the complex-valued function is exactly given by a Lorentz spectrum with peak frequency ω 1 and half-width μ 1 ; its susceptibility with respect to a weak external forcing is given by a simple one-pole filter, centered around ω 1 ; and the cross-spectrum between two coupled oscillators can be easily expressed by a combination of the spontaneous power spectra of the uncoupled systems and their susceptibilities. Our approach makes qualitatively different stochastic oscillators comparable, provides simple characteristics for the coherence of the random oscillation, and gives a framework for the description of weakly coupled oscillators.  more » « less
Award ID(s):
2052109
PAR ID:
10433835
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Proceedings of the National Academy of Sciences
Volume:
120
Issue:
29
ISSN:
0027-8424
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Phase reduction is a well-established method to study weakly driven and weakly perturbed oscillators. Traditional phase-reduction approaches characterize the perturbed system dynamics solely in terms of the timing of the oscillations. In the case of large perturbations, the introduction of amplitude (isostable) coordinates improves the accuracy of the phase description by providing a sense of distance from the underlying limit cycle. Importantly, phase-amplitude coordinates allow for the study of both the timing and shape of system oscillations. A parallel tool is the infinitesimal shape response curve (iSRC), a variational method that characterizes the shape change of a limit-cycle oscillator under sustained perturbation. Despite the importance of oscillation amplitude in a wide range of physical systems, systematic studies on the shape change of oscillations remain scarce. Both phase-amplitude coordinates and the iSRC represent methods to analyze oscillation shape change, yet a relationship between the two has not been previously explored. In this work, we establish the iSRC and phase-amplitude coordinates as complementary tools to study oscillation amplitude. We extend existing iSRC theory and specify conditions under which a general class of systems can be analyzed by the joint iSRC phase-amplitude approach. We show that the iSRC takes on a dramatically simple form in phase-amplitude coordinates, and directly relate the phase and isostable response curves to the iSRC. We apply our theory to weakly perturbed single oscillators, and to study the synchronization and entrainment of coupled oscillators. 
    more » « less
  2. The synchronization of two groups of electrochemical oscillators is investigated during the electrodissolution of nickel in sulfuric acid. The oscillations are coupled through combined capacitance and resistance, so that in a single pair of oscillators (nearly) in-phase synchronization is obtained. The internal coupling within each group is relatively strong, but there is a phase difference between the fast and slow oscillators. The external coupling between the two groups is weak. The experiments show that the two groups can exhibit (nearly) anti-phase collective synchronization. Such synchronization occurs only when the external coupling is weak, and the interactions are delayed by the capacitance. When the external coupling is restricted to those between the fast and the slow elements, the anti-phase synchronization is more prominent. The results are interpreted with phase models. The theory predicts that, for anti-phase collective synchronization, there must be a minimum internal phase difference for a given shift in the phase coupling function. This condition is less stringent with external fast-to-slow coupling. The results provide a framework for applications of collective phase synchronization in modular networks where weak coupling between the groups can induce synchronization without rearrangements of the phase dynamics within the groups. This article is part of the theme issue ‘Coupling functions: dynamical interaction mechanisms in the physical, biological and social sciences’. 
    more » « less
  3. Abstract For a Brownian directed polymer in a Gaussian random environment, with q ( t , ⋅) denoting the quenched endpoint density and Q n ( t , x 1 , … , x n ) = E [ q ( t , x 1 ) … q ( t , x n ) ] , we derive a hierarchical PDE system satisfied by { Q n } n ⩾ 1 . We present two applications of the system: (i) we compute the generator of { μ t ( d x ) = q ( t , x ) d x } t ⩾ 0 for some special functionals, where { μ t ( d x ) } t ⩾ 0 is viewed as a Markov process taking values in the space of probability measures; (ii) in the high temperature regime with d ⩾ 3, we prove a quantitative central limit theorem for the annealed endpoint distribution of the diffusively rescaled polymer path. We also study a nonlocal diffusion-reaction equation motivated by the generator and establish a super-diffusive O ( t 2/3 ) scaling. 
    more » « less
  4. Symmetry-breaking in coupled, identical, fast–slow systems produces a rich, dramatic variety of dynamical behavior—such as amplitudes and frequencies differing by an order of magnitude or more and qualitatively different rhythms between oscillators, corresponding to different functional states. We present a novel method for analyzing these systems. It identifies the key geometric structures responsible for this new symmetry-breaking, and it shows that many different types of symmetry-breaking rhythms arise robustly. We find symmetry-breaking rhythms in which one oscillator exhibits small-amplitude oscillations, while the other exhibits phase-shifted small-amplitude oscillations, large-amplitude oscillations, mixed-mode oscillations, or even undergoes an explosion of limit cycle canards. Two prototypical fast–slow systems illustrate the method: the van der Pol equation that describes electrical circuits and the Lengyel–Epstein model of chemical oscillators. 
    more » « less
  5. We study transfer learning for estimation in latent variable network models. In our setting, the conditional edge probability matrices given the latent variables are represented by P for the source and Q for the target. We wish to estimate Q given two kinds of data: (1) edge data from a subgraph induced by an o(1) fraction of the nodes of Q, and (2) edge data from all of P. If the source P has no relation to the target Q, the estimation error must be Ω(1). However, we show that if the latent variables are shared, then vanishing error is possible. We give an efficient algorithm that utilizes the ordering of a suitably defined graph distance. Our algorithm achieves o(1) error and does not assume a parametric form on the source or target networks. Next, for the specific case of Stochastic Block Models we prove a minimax lower bound and show that a simple algorithm achieves this rate. Finally, we empirically demonstrate our algorithm's use on real-world and simulated graph transfer problems. 
    more » « less