Jeremie Fish
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jeremie Fish has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Erik M. Bollt
Clarkson University
7 shared publications Erik Bollt
Department of Electrical and Computer Engineering, Clarkson University, Potsdam, USA
3 shared publications- Abd AlRahman R. AlMomani
Clarkson University
2 shared publications Alexander DeWitt
Department of Electrical and Computer Engineering, Clarkson University 1 , Potsdam, New York 13699, USA
2 shared publicationsJie Sun
Department of Electrical and Computer Engineering, Clarkson University, Potsdam, USA
2 shared publications- Paul J. Laurienti
Wake Forest University School of Medicine, Winston-Salem, NC, USA
2 shared publications
Latest Publications
- Open Access
CausationEntropy: Pythonic Optimal Causation Entropy
Optimal Causation Entropy (oCSE) is a robust causal network modeling technique that reveals causal networks from dynamical systems and coupled oscillators, distinguishing direct from indirect paths. CausationEntropy is a Python package that implements oCSE and several of its significant optimizations and methodological extensions. In this paper, we introduce the version 1.1 release of CausationEntropy, which includes new synthetic data generators, plotting tools, and several advanced information-theoretical causal network discovery algorithms with criteria for estimating Gaussian, k-nearest neighbors (kNN), geometric k-nearest neighbors (geometric-kNN), kernel density (KDE) and Poisson entropic estimators. The package is easy to install from the PyPi software repository, is thoroughly documented, supplemented with extensive code examples, and is modularly structured to support future additions. The entire codebase is released under the MIT license and is available on GitHub and through PyPi Repository. We expect this package to serve as a benchmark tool for causal discovery in complex dynamical systems.
Open AccessCausationEntropy: Pythonic Optimal Causation Entropy
Optimal Causation Entropy (oCSE) is a robust causal network modeling technique that reveals causal networks from dynamical systems and coupled oscillators, distinguishing direct from indirect paths. CausationEntropy is a Python package that implements oCSE and several of its significant optimizations and methodological extensions. In this paper, we introduce the version 1.1 release of CausationEntropy, which includes new synthetic data generators, plotting tools, and several advanced information-theoretical causal network discovery algorithms with criteria for estimating Gaussian, k-nearest neighbors (kNN), geometric k-nearest neighbors (geometric-kNN), kernel density (KDE) and Poisson entropic estimators. The package is easy to install from the PyPi software repository, is thoroughly documented, supplemented with extensive code examples, and is modularly structured to support future additions. The entire codebase is released under the MIT license and is available on GitHub and through PyPi Repository. We expect this package to serve as a benchmark tool for causal discovery in complex dynamical systems.
- Open Access
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Learning transfer operators by kernel density estimation
Inference of transfer operators from data is often formulated as a classical problem that hinges on the Ulam method. The conventional description, known as the Ulam–Galerkin method, involves projecting onto basis functions represented as characteristic functions supported over a fine grid of rectangles. From this perspective, the Ulam–Galerkin approach can be interpreted as density estimation using the histogram method. In this study, we recast the problem within the framework of statistical density estimation. This alternative perspective allows for an explicit and rigorous analysis of bias and variance, thereby facilitating a discussion on the mean square error. Through comprehensive examples utilizing the logistic map and a Markov map, we demonstrate the validity and effectiveness of this approach in estimating the eigenvectors of the Frobenius–Perron operator. We compare the performance of histogram density estimation (HDE) and kernel density estimation (KDE) methods and find that KDE generally outperforms HDE in terms of accuracy. However, it is important to note that KDE exhibits limitations around boundary points and jumps. Based on our research findings, we suggest the possibility of incorporating other density estimation methods into this field and propose future investigations into the application of KDE-based estimation for high-dimensional maps. These findings provide valuable insights for researchers and practitioners working on estimating the Frobenius–Perron operator and highlight the potential of density estimation techniques in this area of study.
- 1 February 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (2)
Open AccessLearning transfer operators by kernel density estimation
Inference of transfer operators from data is often formulated as a classical problem that hinges on the Ulam method. The conventional description, known as the Ulam–Galerkin method, involves projecting onto basis functions represented as characteristic functions supported over a fine grid of rectangles. From this perspective, the Ulam–Galerkin approach can be interpreted as density estimation using the histogram method. In this study, we recast the problem within the framework of statistical density estimation. This alternative perspective allows for an explicit and rigorous analysis of bias and variance, thereby facilitating a discussion on the mean square error. Through comprehensive examples utilizing the logistic map and a Markov map, we demonstrate the validity and effectiveness of this approach in estimating the eigenvectors of the Frobenius–Perron operator. We compare the performance of histogram density estimation (HDE) and kernel density estimation (KDE) methods and find that KDE generally outperforms HDE in terms of accuracy. However, it is important to note that KDE exhibits limitations around boundary points and jumps. Based on our research findings, we suggest the possibility of incorporating other density estimation methods into this field and propose future investigations into the application of KDE-based estimation for high-dimensional maps. These findings provide valuable insights for researchers and practitioners working on estimating the Frobenius–Perron operator and highlight the potential of density estimation techniques in this area of study.
- Open Access
Fractal Basins as a Mechanism for the Nimble Brain
An interesting feature of the brain is its ability to respond to disparate sensory signals from the environment in unique ways depending on the environmental context or current brain state. In dynamical systems, this is an example of multi-stability, the ability to switch between multiple stable states corresponding to specific patterns of brain activity/connectivity. In this article, we describe chimera states, which are patterns consisting of mixed synchrony and incoherence, in a brain-inspired dynamical systems model composed of a network with weak individual interactions and chaotic/periodic local dynamics. We illustrate the mechanism using synthetic time series interacting on a realistic anatomical brain network derived from human diffusion tensor imaging (DTI). We introduce the so-called Vector Pattern State (VPS) as an efficient way of identifying chimera states and mapping basin structures. Clustering similar VPSs for different initial conditions, we show that coexisting attractors of such states reveal intricately "mingled" fractal basin boundaries that are immediately reachable. This could explain the nimble brain's ability to rapidly switch patterns between coexisting attractors.
Open AccessFractal Basins as a Mechanism for the Nimble Brain
An interesting feature of the brain is its ability to respond to disparate sensory signals from the environment in unique ways depending on the environmental context or current brain state. In dynamical systems, this is an example of multi-stability, the ability to switch between multiple stable states corresponding to specific patterns of brain activity/connectivity. In this article, we describe chimera states, which are patterns consisting of mixed synchrony and incoherence, in a brain-inspired dynamical systems model composed of a network with weak individual interactions and chaotic/periodic local dynamics. We illustrate the mechanism using synthetic time series interacting on a realistic anatomical brain network derived from human diffusion tensor imaging (DTI). We introduce the so-called Vector Pattern State (VPS) as an efficient way of identifying chimera states and mapping basin structures. Clustering similar VPSs for different initial conditions, we show that coexisting attractors of such states reveal intricately "mingled" fractal basin boundaries that are immediately reachable. This could explain the nimble brain's ability to rapidly switch patterns between coexisting attractors.
- Open Access
Learning Transfer Operators by Kernel Density Estimation
Inference of transfer operators from data is often formulated as a classical problem that hinges on the Ulam method. The conventional description, known as the Ulam-Galerkin method, involves projecting onto basis functions represented as characteristic functions supported over a fine grid of rectangles. From this perspective, the Ulam-Galerkin approach can be interpreted as density estimation using the histogram method. In this study, we recast the problem within the framework of statistical density estimation. This alternative perspective allows for an explicit and rigorous analysis of bias and variance, thereby facilitating a discussion on the mean square error. Through comprehensive examples utilizing the logistic map and a Markov map, we demonstrate the validity and effectiveness of this approach in estimating the eigenvectors of the Frobenius-Perron operator. We compare the performance of Histogram Density Estimation(HDE) and Kernel Density Estimation(KDE) methods and find that KDE generally outperforms HDE in terms of accuracy. However, it is important to note that KDE exhibits limitations around boundary points and jumps. Based on our research findings, we suggest the possibility of incorporating other density estimation methods into this field and propose future investigations into the application of KDE-based estimation for high-dimensional maps. These findings provide valuable insights for researchers and practitioners working on estimating the Frobenius-Perron operator and highlight the potential of density estimation techniques in this area of study. Keywords: Transfer Operators; Frobenius-Perron operator; probability density estimation; Ulam-Galerkin method; Kernel Density Estimation; Histogram Density Estimation.
Open AccessLearning Transfer Operators by Kernel Density Estimation
Inference of transfer operators from data is often formulated as a classical problem that hinges on the Ulam method. The conventional description, known as the Ulam-Galerkin method, involves projecting onto basis functions represented as characteristic functions supported over a fine grid of rectangles. From this perspective, the Ulam-Galerkin approach can be interpreted as density estimation using the histogram method. In this study, we recast the problem within the framework of statistical density estimation. This alternative perspective allows for an explicit and rigorous analysis of bias and variance, thereby facilitating a discussion on the mean square error. Through comprehensive examples utilizing the logistic map and a Markov map, we demonstrate the validity and effectiveness of this approach in estimating the eigenvectors of the Frobenius-Perron operator. We compare the performance of Histogram Density Estimation(HDE) and Kernel Density Estimation(KDE) methods and find that KDE generally outperforms HDE in terms of accuracy. However, it is important to note that KDE exhibits limitations around boundary points and jumps. Based on our research findings, we suggest the possibility of incorporating other density estimation methods into this field and propose future investigations into the application of KDE-based estimation for high-dimensional maps. These findings provide valuable insights for researchers and practitioners working on estimating the Frobenius-Perron operator and highlight the potential of density estimation techniques in this area of study. Keywords: Transfer Operators; Frobenius-Perron operator; probability density estimation; Ulam-Galerkin method; Kernel Density Estimation; Histogram Density Estimation.
- Open Access
Non-normality, optimality and synchronization
It has been recognized for quite some time that for some matrices the spectra are not enough to tell the complete story of the dynamics of the system, even for linear ODEs. While it is true that the eigenvalues control the asymptotic behavior of the system, if the matrix representing the system is non-normal, short term transients may appear in the linear system. Recently it has been recognized that since the matrices representing directed networks are non-normal, analysis based on spectra alone may be misleading. Both a normal and a non-normal system may be stable according to the master stability paradigm, but the non-normal system may have an arbitrarily small attraction basin to the synchronous state whereas an equivalent normal system may have a significantly larger sync basin. This points to the need to study synchronization in non-normal networks more closely. In this work, various tools will be utilized to examine synchronization in directed networks, including pseudospectra, an adaption of pseudospectra that we will call Laplacian pseudospectra. We define a resulting concept that we call Laplacian pseudospectral resilience (LPR). It will be shown that LPR outperforms other scalar measures for estimating the stability of the synchronous state to finite perturbations in a class of networks known as optimal networks. Finally we find that the ideal choice of optimal network, with an eye toward synchronization, is the one which minimizes LPR
Open AccessNon-normality, optimality and synchronization
It has been recognized for quite some time that for some matrices the spectra are not enough to tell the complete story of the dynamics of the system, even for linear ODEs. While it is true that the eigenvalues control the asymptotic behavior of the system, if the matrix representing the system is non-normal, short term transients may appear in the linear system. Recently it has been recognized that since the matrices representing directed networks are non-normal, analysis based on spectra alone may be misleading. Both a normal and a non-normal system may be stable according to the master stability paradigm, but the non-normal system may have an arbitrarily small attraction basin to the synchronous state whereas an equivalent normal system may have a significantly larger sync basin. This points to the need to study synchronization in non-normal networks more closely. In this work, various tools will be utilized to examine synchronization in directed networks, including pseudospectra, an adaption of pseudospectra that we will call Laplacian pseudospectra. We define a resulting concept that we call Laplacian pseudospectral resilience (LPR). It will be shown that LPR outperforms other scalar measures for estimating the stability of the synchronous state to finite perturbations in a class of networks known as optimal networks. Finally we find that the ideal choice of optimal network, with an eye toward synchronization, is the one which minimizes LPR
- Open Access
- 11 October 2022
- Published by Springer Nature in Applied Network Science
- Vol. 7 (1) , 1-22
Interaction networks from discrete event data by Poisson multivariate mutual information estimation and information flow with applications from gene expression data
In this work, we introduce a new methodology for inferring the interaction structure of discrete valued time series which are Poisson distributed. While most related methods are premised on continuous state stochastic processes, in fact, discrete and counting event oriented stochastic process are natural and common, so called time-point processes. An important application that we focus on here is gene expression, where it is often assumed that the data is generated from a multivariate Poisson distribution. Nonparameteric methods such as the popular k-nearest neighbors are slow converging for discrete processes, and thus data hungry. Now, with the new multi-variate Poisson estimator developed here as the core computational engine, the causation entropy (CSE) principle, together with the associated greedy search algorithm optimal CSE (oCSE) allows us to efficiently infer the true network structure for this class of stochastic processes that were previously not practical. We illustrate the power of our method, first in benchmarking with synthetic datum, and then by inferring the genetic factors network from a breast cancer micro-ribonucleic acid sequence count data set. We show the Poisson oCSE gives the best performance among the tested methods and discovers previously known interactions on the breast cancer data set.
- 11 October 2022
- Published by Springer Nature in Applied Network Science
- Vol. 7 (1) , 1-22
Open AccessInteraction networks from discrete event data by Poisson multivariate mutual information estimation and information flow with applications from gene expression data
In this work, we introduce a new methodology for inferring the interaction structure of discrete valued time series which are Poisson distributed. While most related methods are premised on continuous state stochastic processes, in fact, discrete and counting event oriented stochastic process are natural and common, so called time-point processes. An important application that we focus on here is gene expression, where it is often assumed that the data is generated from a multivariate Poisson distribution. Nonparameteric methods such as the popular k-nearest neighbors are slow converging for discrete processes, and thus data hungry. Now, with the new multi-variate Poisson estimator developed here as the core computational engine, the causation entropy (CSE) principle, together with the associated greedy search algorithm optimal CSE (oCSE) allows us to efficiently infer the true network structure for this class of stochastic processes that were previously not practical. We illustrate the power of our method, first in benchmarking with synthetic datum, and then by inferring the genetic factors network from a breast cancer micro-ribonucleic acid sequence count data set. We show the Poisson oCSE gives the best performance among the tested methods and discovers previously known interactions on the breast cancer data set.
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113142
The essential synchronization backbone problem
Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to (1) expand the range of coupling strengths that achieve synchronization, (2) expand the basin of attraction for the synchronization manifold, or (3) lower the average time to synchronization. A new optimization goal is proposed in seeking the minimum subset of the edge set of the original network that enables the same essential ability to synchronize in that the synchronization manifolds have conjugate stability. We call this type of minimal spanning subgraph an essential synchronization backbone of the original system, and we present two algorithms: one is a strategy for an exhaustive search for a true solution, while the other is a method of approximation for this combinatorial problem. The solution spaces that result from different choices of dynamical systems and coupling schemes vary with the level of a hierarchical structure present and also the number of interwoven central cycles. Applications can include the important problem in civil engineering of power grid hardening, where new link creation may be costly, and the defense of certain key links to the functional process may be prioritized.
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113142
The essential synchronization backbone problem
Network optimization strategies for the process of synchronization have generally focused on the re-wiring or re-weighting of links in order to (1) expand the range of coupling strengths that achieve synchronization, (2) expand the basin of attraction for the synchronization manifold, or (3) lower the average time to synchronization. A new optimization goal is proposed in seeking the minimum subset of the edge set of the original network that enables the same essential ability to synchronize in that the synchronization manifolds have conjugate stability. We call this type of minimal spanning subgraph an essential synchronization backbone of the original system, and we present two algorithms: one is a strategy for an exhaustive search for a true solution, while the other is a method of approximation for this combinatorial problem. The solution spaces that result from different choices of dynamical systems and coupling schemes vary with the level of a hierarchical structure present and also the number of interwoven central cycles. Applications can include the important problem in civil engineering of power grid hardening, where new link creation may be costly, and the defense of certain key links to the functional process may be prioritized.
- Open Access
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113105
Entropic regression with neurologically motivated applications
The ultimate goal of cognitive neuroscience is to understand the mechanistic neural processes underlying the functional organization of the brain. The key to this study is understanding the structure of both the structural and functional connectivity between anatomical regions. In this paper, we use an information theoretic approach, which defines direct information flow in terms of causation entropy, to improve upon the accuracy of the recovery of the true network structure over popularly used methods for this task such as correlation and least absolute shrinkage and selection operator regression. The method outlined above is tested on synthetic data, which is produced by following previous work in which a simple dynamical model of the brain is used, simulated on top of a real network of anatomical brain regions reconstructed from diffusion tensor imaging. We demonstrate the effectiveness of the method of AlMomani et al. [Chaos 30, 013107 (2020)] when applied to data simulated on the realistic diffusion tensor imaging network, as well as on randomly generated small-world and Erdös–Rényi networks.
- 1 November 2021
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 31 (11) , 113105
Open AccessEntropic regression with neurologically motivated applications
The ultimate goal of cognitive neuroscience is to understand the mechanistic neural processes underlying the functional organization of the brain. The key to this study is understanding the structure of both the structural and functional connectivity between anatomical regions. In this paper, we use an information theoretic approach, which defines direct information flow in terms of causation entropy, to improve upon the accuracy of the recovery of the true network structure over popularly used methods for this task such as correlation and least absolute shrinkage and selection operator regression. The method outlined above is tested on synthetic data, which is produced by following previous work in which a simple dynamical model of the brain is used, simulated on top of a real network of anatomical brain regions reconstructed from diffusion tensor imaging. We demonstrate the effectiveness of the method of AlMomani et al. [Chaos 30, 013107 (2020)] when applied to data simulated on the realistic diffusion tensor imaging network, as well as on randomly generated small-world and Erdös–Rényi networks.
- Open Access
Interaction Networks from Discrete Event Data by Poisson Multivariate Mutual Information Estimation and Information Flow with Applications from Gene Expression Data
In this work, we introduce a new methodology for inferring the interaction structure of discrete valued time series which are Poisson distributed. While most related methods are premised on continuous state stochastic processes, in fact, discrete and counting event oriented stochastic process are natural and common, so called time-point processes (TPP). An important application that we focus on here is gene expression. Nonparameteric methods such as the popular k-nearest neighbors (KNN) are slow converging for discrete processes, and thus data hungry. Now, with the new multi-variate Poisson estimator developed here as the core computational engine, the causation entropy (CSE) principle, together with the associated greedy search algorithm optimal CSE (oCSE) allows us to efficiently infer the true network structure for this class of stochastic processes that were previously not practical. We illustrate the power of our method, first in benchmarking with synthetic datum, and then by inferring the genetic factors network from a breast cancer micro-RNA (miRNA) sequence count data set. We show the Poisson oCSE gives the best performance among the tested methods anfmatlabd discovers previously known interactions on the breast cancer data set.
Open AccessInteraction Networks from Discrete Event Data by Poisson Multivariate Mutual Information Estimation and Information Flow with Applications from Gene Expression Data
In this work, we introduce a new methodology for inferring the interaction structure of discrete valued time series which are Poisson distributed. While most related methods are premised on continuous state stochastic processes, in fact, discrete and counting event oriented stochastic process are natural and common, so called time-point processes (TPP). An important application that we focus on here is gene expression. Nonparameteric methods such as the popular k-nearest neighbors (KNN) are slow converging for discrete processes, and thus data hungry. Now, with the new multi-variate Poisson estimator developed here as the core computational engine, the causation entropy (CSE) principle, together with the associated greedy search algorithm optimal CSE (oCSE) allows us to efficiently infer the true network structure for this class of stochastic processes that were previously not practical. We illustrate the power of our method, first in benchmarking with synthetic datum, and then by inferring the genetic factors network from a breast cancer micro-RNA (miRNA) sequence count data set. We show the Poisson oCSE gives the best performance among the tested methods anfmatlabd discovers previously known interactions on the breast cancer data set.
- Open Access
Entropic Causal Inference for Neurological Applications
The ultimate goal of cognitive neuroscience is to understand the mechanistic neural processes underlying the functional organization of the brain. Key to this study is understanding structure of both the structural and functional connectivity between anatomical regions. In this paper we follow previous work in developing a simple dynamical model of the brain by simulating its various regions as Kuramoto oscillators whose coupling structure is described by a complex network. However in our simulations rather than generating synthetic networks, we simulate our synthetic model but coupled by a real network of the anatomical brain regions which has been reconstructed from diffusion tensor imaging (DTI) data. By using an information theoretic approach that defines direct information flow in terms of causation entropy (CSE), we show that we can more accurately recover the true structural network than either of the popular correlation or LASSO regression techniques. We demonstrate the effectiveness of our method when applied to data simulated on the realistic DTI network, as well as on randomly generated small-world and Erd\"os-R\'enyi (ER) networks.
Open AccessEntropic Causal Inference for Neurological Applications
The ultimate goal of cognitive neuroscience is to understand the mechanistic neural processes underlying the functional organization of the brain. Key to this study is understanding structure of both the structural and functional connectivity between anatomical regions. In this paper we follow previous work in developing a simple dynamical model of the brain by simulating its various regions as Kuramoto oscillators whose coupling structure is described by a complex network. However in our simulations rather than generating synthetic networks, we simulate our synthetic model but coupled by a real network of the anatomical brain regions which has been reconstructed from diffusion tensor imaging (DTI) data. By using an information theoretic approach that defines direct information flow in terms of causation entropy (CSE), we show that we can more accurately recover the true structural network than either of the popular correlation or LASSO regression techniques. We demonstrate the effectiveness of our method when applied to data simulated on the realistic DTI network, as well as on randomly generated small-world and Erd\"os-R\'enyi (ER) networks.