Related papers: Error analysis of coarse-grained kinetic Monte Car…
Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square…
Coarse-grained models are a core computational tool in theoretical chemistry and biophysics. A judicious choice of a coarse-grained model can yield physical insight by isolating the essential degrees of freedom that dictate the…
We present a theoretical framework to analyze the dynamics of gene expression with stochastic bursts. Beginning with an individual-based model which fully accounts for the messenger RNA (mRNA) and protein populations, we propose a novel…
Recent years have seen a growing interest in the thermodynamic cost of dissipative structures formed by active particles. Given the strong finite-size effects of such systems, it is essential to develop efficient numerical approaches that…
In recent years dynamical systems (of deterministic and stochastic nature), describing many models in mathematics, physics, engineering and finances, become more and more complex. Numerical analysis narrowed only to deterministic algorithms…
Stochastic kinetic models describe systems across biology, chemistry, and physics where discrete events and small populations render deterministic approximations inadequate. Parameter inference and inverse design in these systems require…
Atomistic or ab-initio molecular dynamics simulations are widely used to predict thermodynamics and kinetics and relate them to molecular structure. A common approach to go beyond the time- and length-scales accessible with such…
An approximate treatment of exchange in finite-temperature path integral Monte Carlo simulations for fermions has been proposed. In this method, some of the fine details of density matrix due to permutations have been smoothed over or…
Restricted Boltzmann Machines are simple and powerful generative models that can encode any complex dataset. Despite all their advantages, in practice the trainings are often unstable and it is difficult to assess their quality because the…
Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
The Kinetic Monte Carlo (KMC) method has become an important tool for examination of phenomena like surface diffusion and thin film growth because of its ability to carry out simulations for time scales that are relevant to experiments. But…
One of the most pressing issues for loop quantum gravity and spin foams is the construction of the continuum limit. In this paper, we propose a systematic coarse-graining scheme for three-dimensional lattice gauge models including spin…
We analyze the kinematics of multigrid Monte Carlo algorithms by investigating acceptance rates for nonlocal Metropolis updates. With the help of a simple criterion we can decide whether or not a multigrid algorithm will have a chance to…
The effectiveness of stochastic algorithms based on Monte Carlo dynamics in solving hard optimization problems is mostly unknown. Beyond the basic statement that at a dynamical phase transition the ergodicity breaks and a Monte Carlo…
Probabilistic models are conceptually powerful tools for finding structure in data, but their practical effectiveness is often limited by our ability to perform inference in them. Exact inference is frequently intractable, so approximate…
Kinetic Monte Carlo (kMC) simulations have emerged as a key tool for microkinetic modeling in heterogeneous catalysis and other materials applications. Systems, where site-specificity of all elementary reactions allows a mapping onto a…
We consider the problem of estimating the probability of a large loss from a financial portfolio, where the future loss is expressed as a conditional expectation. Since the conditional expectation is intractable in most cases, one may…
Properties of the self-adjusted Monte Carlo algorithm applied to 2d Ising ferromagnet are studied numerically. The endogenous feedback form expressed in terms of the instant running averages is suggested in order to generate a biased random…
We describe an adaptive importance sampling algorithm for rare events that is based on a dual stochastic control formulation of a path sampling problem. Specifically, we focus on path functionals that have the form of cumulate generating…