Related papers: Transition path theory for Langevin dynamics on ma…
We study the convergence to equilibrium of an underdamped Langevin equation that is controlled by a linear feedback force. Specifically, we are interested in sampling the possibly multimodal invariant probability distribution of a Langevin…
A sharp change in apparent mobility at a characteristic temperature that depends on the observation time has been reported in experiments and simulations of hydrated proteins. Such behavior is often discussed in the context of the protein…
Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…
In this work, we seek to simulate rare transitions between metastable states using score-based generative models. An efficient method for generating high-quality transition paths is valuable for the study of molecular systems since data is…
By monitoring the sampling of states with different magnetizations in transition matrix procedures a family of accurate and easily implemented techniques are constructed that automatically control the variation of the temperature or energy…
Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain…
Cross-Correlation random matrices have emerged as a promising indicator of phase transitions in spin systems. The core concept is that the evolution of magnetization encapsulates thermodynamic information [R. da Silva, Int. J. Mod. Phys. C,…
Finding representative reaction pathways is necessary for understanding mechanisms of molecular processes, but is considered to be extremely challenging. We propose a new method to construct reaction paths based on mean first-passage times.…
Optimal designs minimize the number of experimental runs (samples) needed to accurately estimate model parameters, resulting in algorithms that, for instance, efficiently minimize parameter estimate variance. Governed by knowledge of past…
Among various rare events, the effective computation of transition paths connecting metastable states in a stochastic model is an important problem. This paper proposes a stochastic optimal control formulation for transition path problems…
We have shown recently that a Markov process conditioned on rare events involving time-integrated random variables can be described in the long-time limit by an effective Markov process, called the driven process, which is given…
Many natural systems exhibit phase transition where external environmental conditions spark a shift to a new and sometimes quite different state. Therefore, detecting the behavior of a stochastic dynamic system such as the most probable…
MeanFlow enables one-step generation in continuous spaces by learning an average velocity over a time interval rather than the instantaneous velocity field of flow matching. However, discrete state spaces do not have smooth trajectories or…
Probably one of the most striking examples of the close connections between global optimization processes and statistical physics is the simulated annealing method, inspired by the famous Monte Carlo algorithm devised by Metropolis et al.…
The contribution of this paper is to introduce change of measure based techniques for the rare-event analysis of heavy-tailed stochastic processes. Our changes-of-measure are parameterized by a family of distributions admitting a mixture…
We present a comparative study of Langevin dynamics and a Metropolis random walk model applied to thermal neutron-induced fission of $^{229}$Th, $^{235}$U, $^{239}$Pu, $^{245}$Cm, $^{249}$Cf, and $^{255}$Fm. Both methods are implemented…
State aggregation is a popular model reduction method rooted in optimal control. It reduces the complexity of engineering systems by mapping the system's states into a small number of meta-states. The choice of aggregation map often depends…
Sampling the parameter space of artificial neural networks according to a Boltzmann distribution provides insight into the geometry of low-loss solutions and offers an alternative to conventional loss minimization for training. However,…
We introduce a constructive framework to learn effective Langevin equations from stationary time series. Unlike conventional approaches that require iterative calibration to match target statistics, our construction guarantees the observed…
In a recent article, Krapivsky and Redner (J. Stat. Mech. 093208 (2018)) established that the distribution of the first hitting times for a diffusing particle subject to hitting an absorber is independent of the direction of the external…