Jeffrey Emenheiser
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jeffrey Emenheiser has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- James P. Crutchfield
Complexity Sciences Center and Physics Department, University of California at Davis, One Shields Avenue, Davis, CA 95616, USA
7 shared publications - Raissa M. D'Souza
Department of Computer Science and Department of Mechanical and Aerospace Engineering, University of California, Davis 2 , Davis, California 95616
3 shared publications - Ryan G. James
Complexity Sciences Center and Physics Department, University of California at Davis, One Shields Avenue, Davis, CA 95616, USA
3 shared publications - Anastasiya Salova
Complexity Sciences Center and Physics Mathematics, and Computer Science Departments University of California Davis One Shields Avenue 95616 Davis California
2 shared publications - Jordan Snyder
Department of Science and Environment, Centre for Mathematical Modeling - Human Health and Disease, IMFUFA, Roskilde University
2 shared publications - Adam Rupe
Pacific Northwest National Laboratory 1 , Richland, Washington 99352
1 shared publication
Latest Publications
- Open Access
Network and Phase Symmetries Reveal That Amplitude Dynamics Stabilize Decoupled Oscillator Clusters
Oscillator networks display intricate synchronization patterns. Determining their stability typically requires incorporating the symmetries of the network coupling. Going beyond analyses that appeal only to a network’s automorphism group, we explore synchronization patterns that emerge from the phase-shift invariance of the dynamical equations and symmetries in the nodes. We show that these nonstructural symmetries simplify stability calculations. We analyze a ring-network of phase–amplitude oscillators that exhibits a “decoupled” state in which physically-coupled nodes appear to act independently due to emergent cancellations in the equations of dynamical evolution. We establish that this state can be linearly stable for a ring of phase–amplitude oscillators, but not for a ring of phase-only oscillators that otherwise require explicit long-range, nonpairwise, or nonphase coupling. In short, amplitude–phase interactions are key to stable synchronization at a distance.
Open AccessNetwork and Phase Symmetries Reveal That Amplitude Dynamics Stabilize Decoupled Oscillator Clusters
Oscillator networks display intricate synchronization patterns. Determining their stability typically requires incorporating the symmetries of the network coupling. Going beyond analyses that appeal only to a network’s automorphism group, we explore synchronization patterns that emerge from the phase-shift invariance of the dynamical equations and symmetries in the nodes. We show that these nonstructural symmetries simplify stability calculations. We analyze a ring-network of phase–amplitude oscillators that exhibits a “decoupled” state in which physically-coupled nodes appear to act independently due to emergent cancellations in the equations of dynamical evolution. We establish that this state can be linearly stable for a ring of phase–amplitude oscillators, but not for a ring of phase-only oscillators that otherwise require explicit long-range, nonpairwise, or nonphase coupling. In short, amplitude–phase interactions are key to stable synchronization at a distance.
- Open Access
Network and Phase Symmetries Reveal That Amplitude Dynamics Stabilize Decoupled Oscillator Clusters
Oscillator networks display intricate synchronization patterns. Determining their stability typically requires incorporating the symmetries of the network coupling. Going beyond analyses that appeal only to a network's automorphism group, we explore synchronization patterns that emerge from the phase-shift invariance of the dynamical equations and symmetries in the nodes. We show that these nonstructural symmetries simplify stability calculations. We analyze a ring-network of phase-amplitude oscillators that exhibits a "decoupled" state in which physically-coupled nodes appear to act independently due to emergent cancellations in the equations of dynamical evolution. We establish that this state can be linearly stable for a ring of phase-amplitude oscillators, but not for a ring of phase-only oscillators that otherwise require explicit long-range, nonpairwise, or nonphase coupling. In short, amplitude-phase interactions are key to stable synchronization at a distance.
Open AccessNetwork and Phase Symmetries Reveal That Amplitude Dynamics Stabilize Decoupled Oscillator Clusters
Oscillator networks display intricate synchronization patterns. Determining their stability typically requires incorporating the symmetries of the network coupling. Going beyond analyses that appeal only to a network's automorphism group, we explore synchronization patterns that emerge from the phase-shift invariance of the dynamical equations and symmetries in the nodes. We show that these nonstructural symmetries simplify stability calculations. We analyze a ring-network of phase-amplitude oscillators that exhibits a "decoupled" state in which physically-coupled nodes appear to act independently due to emergent cancellations in the equations of dynamical evolution. We establish that this state can be linearly stable for a ring of phase-amplitude oscillators, but not for a ring of phase-only oscillators that otherwise require explicit long-range, nonpairwise, or nonphase coupling. In short, amplitude-phase interactions are key to stable synchronization at a distance.
- Open Access
- 1 September 2019
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 29 (9) , 093128
Koopman operator and its approximations for systems with symmetries
Nonlinear dynamical systems with symmetries exhibit a rich variety of behaviors, often described by complex attractor-basin portraits and enhanced and suppressed bifurcations. Symmetry arguments provide a way to study these collective behaviors and to simplify their analysis. The Koopman operator is an infinite dimensional linear operator that fully captures a system’s nonlinear dynamics through the linear evolution of functions of the state space. Importantly, in contrast with local linearization, it preserves a system’s global nonlinear features. We demonstrate how the presence of symmetries affects the Koopman operator structure and its spectral properties. In fact, we show that symmetry considerations can also simplify finding the Koopman operator approximations using the extended and kernel dynamic mode decomposition methods (EDMD and kernel DMD). Specifically, representation theory allows us to demonstrate that an isotypic component basis induces a block diagonal structure in operator approximations, revealing hidden organization. Practically, if the symmetries are known, the EDMD and kernel DMD methods can be modified to give more efficient computation of the Koopman operator approximation and its eigenvalues, eigenfunctions, and eigenmodes. Rounding out the development, we discuss the effect of measurement noise.
- 1 September 2019
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 29 (9) , 093128
Open AccessKoopman operator and its approximations for systems with symmetries
Nonlinear dynamical systems with symmetries exhibit a rich variety of behaviors, often described by complex attractor-basin portraits and enhanced and suppressed bifurcations. Symmetry arguments provide a way to study these collective behaviors and to simplify their analysis. The Koopman operator is an infinite dimensional linear operator that fully captures a system’s nonlinear dynamics through the linear evolution of functions of the state space. Importantly, in contrast with local linearization, it preserves a system’s global nonlinear features. We demonstrate how the presence of symmetries affects the Koopman operator structure and its spectral properties. In fact, we show that symmetry considerations can also simplify finding the Koopman operator approximations using the extended and kernel dynamic mode decomposition methods (EDMD and kernel DMD). Specifically, representation theory allows us to demonstrate that an isotypic component basis induces a block diagonal structure in operator approximations, revealing hidden organization. Practically, if the symmetries are known, the EDMD and kernel DMD methods can be modified to give more efficient computation of the Koopman operator approximation and its eigenvalues, eigenfunctions, and eigenmodes. Rounding out the development, we discuss the effect of measurement noise.
- Top Cited Papers
- 8 March 2019
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 363 (6431) , 1057-+
Exotic states in a simple network of nanoelectromechanical oscillators
Quickly exploring weakly coupled oscillators: Synchronizing oscillators have been useful models for exploring coupling in dynamic systems. However, many macroscopic platforms such as pendula evolve on slow time scales, which can limit the observation of states that emerge after many cycles. Matheny et al. fabricated a ring of eight nanoelectromechanical oscillators resonating at ∼2.2 megahertz with quality factors of ∼4000 that could be rapidly controlled and read out. Analysis of these large datasets revealed exotic synchronization states with complex dynamics and broken symmetries. Theoretical modeling showed that emergent higher-order interactions (such as biharmonic and next-nearest neighbor) stabilized complex dynamics, despite the network having weak nearest-neighbor coupling. Science , this issue p. eaav7932
- 8 March 2019
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 363 (6431) , 1057-+
Top Cited PapersExotic states in a simple network of nanoelectromechanical oscillators
Quickly exploring weakly coupled oscillators: Synchronizing oscillators have been useful models for exploring coupling in dynamic systems. However, many macroscopic platforms such as pendula evolve on slow time scales, which can limit the observation of states that emerge after many cycles. Matheny et al. fabricated a ring of eight nanoelectromechanical oscillators resonating at ∼2.2 megahertz with quality factors of ∼4000 that could be rapidly controlled and read out. Analysis of these large datasets revealed exotic synchronization states with complex dynamics and broken symmetries. Theoretical modeling showed that emergent higher-order interactions (such as biharmonic and next-nearest neighbor) stabilized complex dynamics, despite the network having weak nearest-neighbor coupling. Science , this issue p. eaav7932
- Open Access
Unique Information and Secret Key Agreement
The partial information decomposition (PID) is a promising framework for decomposing a joint random variable into the amount of influence each source variable has on a target variable Y, relative to the other sources. For two sources, influence breaks down into the information that both and redundantly share with Y, what uniquely shares with Y, what uniquely shares with Y, and finally what and synergistically share with Y. Unfortunately, considerable disagreement has arisen as to how these four components should be quantified. Drawing from cryptography, we consider the secret key agreement rate as an operational method of quantifying unique information. Secret key agreement rate comes in several forms, depending upon which parties are permitted to communicate. We demonstrate that three of these four forms are inconsistent with the PID. The remaining form implies certain interpretations as to the PID’s meaning—interpretations not present in PID’s definition but that, we argue, need to be explicit. Specifically, the use of a consistent PID quantified using a secret key agreement rate naturally induces a directional interpretation of the PID. We further reveal a surprising connection between third-order connected information, two-way secret key agreement rate, and synergy. We also consider difficulties which arise with a popular PID measure in light of the results here as well as from a maximum entropy viewpoint. We close by reviewing the challenges facing the PID.Open AccessUnique Information and Secret Key Agreement
The partial information decomposition (PID) is a promising framework for decomposing a joint random variable into the amount of influence each source variable has on a target variable Y, relative to the other sources. For two sources, influence breaks down into the information that both and redundantly share with Y, what uniquely shares with Y, what uniquely shares with Y, and finally what and synergistically share with Y. Unfortunately, considerable disagreement has arisen as to how these four components should be quantified. Drawing from cryptography, we consider the secret key agreement rate as an operational method of quantifying unique information. Secret key agreement rate comes in several forms, depending upon which parties are permitted to communicate. We demonstrate that three of these four forms are inconsistent with the PID. The remaining form implies certain interpretations as to the PID’s meaning—interpretations not present in PID’s definition but that, we argue, need to be explicit. Specifically, the use of a consistent PID quantified using a secret key agreement rate naturally induces a directional interpretation of the PID. We further reveal a surprising connection between third-order connected information, two-way secret key agreement rate, and synergy. We also consider difficulties which arise with a popular PID measure in light of the results here as well as from a maximum entropy viewpoint. We close by reviewing the challenges facing the PID. - Open Access
Unique Information and Secret Key Agreement
The partial information decomposition (PID) is a promising framework for decomposing a joint random variable into the amount of influence each source variable Xi has on a target variable Y, relative to the other sources. For two sources, influence breaks down into the information that both X0 and X1 redundantly share with Y, what X0 uniquely shares with Y, what X1 uniquely shares with Y, and finally what X0 and X1 synergistically share with Y. Unfortunately, considerable disagreement has arisen as to how these four components should be quantified. Drawing from cryptography, we consider the secret key agreement rate as an operational method of quantifying unique informations. Secret key agreement rate comes in several forms, depending upon which parties are permitted to communicate. We demonstrate that three of these four forms are inconsistent with the PID. The remaining form implies certain interpretations as to the PID's meaning---interpretations not present in PID's definition but that, we argue, need to be explicit. These reveal an inconsistency between third-order connected information, two-way secret key agreement rate, and synergy. Similar difficulties arise with a popular PID measure in light the results here as well as from a maximum entropy viewpoint. We close by reviewing the challenges facing the PID.
Open AccessUnique Information and Secret Key Agreement
The partial information decomposition (PID) is a promising framework for decomposing a joint random variable into the amount of influence each source variable Xi has on a target variable Y, relative to the other sources. For two sources, influence breaks down into the information that both X0 and X1 redundantly share with Y, what X0 uniquely shares with Y, what X1 uniquely shares with Y, and finally what X0 and X1 synergistically share with Y. Unfortunately, considerable disagreement has arisen as to how these four components should be quantified. Drawing from cryptography, we consider the secret key agreement rate as an operational method of quantifying unique informations. Secret key agreement rate comes in several forms, depending upon which parties are permitted to communicate. We demonstrate that three of these four forms are inconsistent with the PID. The remaining form implies certain interpretations as to the PID's meaning---interpretations not present in PID's definition but that, we argue, need to be explicit. These reveal an inconsistency between third-order connected information, two-way secret key agreement rate, and synergy. Similar difficulties arise with a popular PID measure in light the results here as well as from a maximum entropy viewpoint. We close by reviewing the challenges facing the PID.
- Open Access
Unique Information via Dependency Constraints
The partial information decomposition (PID) is perhaps the leading proposal for resolving information shared between a set of sources and a target into redundant, synergistic, and unique constituents. Unfortunately, the PID framework has been hindered by a lack of a generally agreed-upon, multivariate method of quantifying the constituents. Here, we take a step toward rectifying this by developing a decomposition based on a new method that quantifies unique information. We first develop a broadly applicable method---the dependency decomposition---that delineates how statistical dependencies influence the structure of a joint distribution. The dependency decomposition then allows us to define a measure of the information about a target that can be uniquely attributed to a particular source as the least amount which the source-target statistical dependency can influence the information shared between the sources and the target. The result is the first measure that satisfies the core axioms of the PID framework while not satisfying the Blackwell relation, which depends on a particular interpretation of how the variables are related. This makes a key step forward to a practical PID.
Open AccessUnique Information via Dependency Constraints
The partial information decomposition (PID) is perhaps the leading proposal for resolving information shared between a set of sources and a target into redundant, synergistic, and unique constituents. Unfortunately, the PID framework has been hindered by a lack of a generally agreed-upon, multivariate method of quantifying the constituents. Here, we take a step toward rectifying this by developing a decomposition based on a new method that quantifies unique information. We first develop a broadly applicable method---the dependency decomposition---that delineates how statistical dependencies influence the structure of a joint distribution. The dependency decomposition then allows us to define a measure of the information about a target that can be uniquely attributed to a particular source as the least amount which the source-target statistical dependency can influence the information shared between the sources and the target. The result is the first measure that satisfies the core axioms of the PID framework while not satisfying the Blackwell relation, which depends on a particular interpretation of how the variables are related. This makes a key step forward to a practical PID.