An Onsager-Machlup approach to the most probable transition pathway for a genetic regulatory network
We investigate a quantitative network of gene expression dynamics describing the competence development in Bacillus subtilis. First, we introduce an Onsager-Machlup approach to quantify the most probable transition pathway for both excitable and bistable dynamics. Then, we apply a machine learning method to calculate the most probable transition pathway via the Euler-Lagrangian equation. Finally, we analyze how the noise intensity affects the transition phenomena.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functional
Transition path sampling (TPS), which involves finding probable paths connecting two points on an energy landscape, remains a challenge due to the complexity of real-world atomistic systems. Current machine learning appr…
DenoisingA Machine Learning Framework for Computing the Most Probable Paths of Stochastic Dynamical Systems
The emergence of transition phenomena between metastable states induced by noise plays a fundamental role in a broad range of nonlinear systems. The computation of the most probable paths is a key issue to understand the…
BIG-bench Machine LearningThe most probable dynamics of receptor-ligand binding on cell membrane
We devise a method for predicting certain receptor-ligand binding behaviors, based on stochastic dynamical modelling. We consider the dynamics of a receptor binding to a ligand on the cell membrane, where the receptor an…
Early warning indicators via latent stochastic dynamical systems
Detecting early warning indicators for abrupt dynamical transitions in complex systems or high-dimensional observation data is essential in many real-world applications, such as brain diseases, natural disasters, and eng…
EEGElectroencephalogram (EEG)Time SeriesA Path-Space Formulation of Prediction in World Models: From a Single Action to Prediction, Planning, and Irreversibility
We propose a path-space formulation of prediction in AI world models. Rather than sequences of one-step conditional distributions, we argue that a world model implicitly defines a probability measure over future trajecto…