Related papers: Simulating bridges using confluent diffusions

We describe parallel Markov chain Monte Carlo methods that propagate a collective ensemble of paths, with local covariance information calculated from neighboring replicas. The use of collective dynamics eliminates multiplicative noise and…

Performing Bayesian inference via Markov chain Monte Carlo (MCMC) can be exceedingly expensive when posterior evaluations invoke the evaluation of a computationally expensive model, such as a system of partial differential equations. In…

In this paper, we simulate diffusion bridges by using an approximation of the Wiener-chaos expansion (WCE), or a Fourier-Hermite expansion, for a related diffusion process. Indeed, we consider the solution of stochastic differential…

These lecture notes introduce the statistical analysis of continuous-time generative models built from Markov dynamics. We begin with the stochastic-calculus foundations of score-based diffusion models, including time reversal, score…

This article presents a Bayesian inferential method where the likelihood for a model is unknown but where data can easily be simulated from the model. We discretize simulated (continuous) data to estimate the implicit likelihood in a…

This paper introduces a Bayesian framework that combines Markov chain Monte Carlo (MCMC) sampling, dimensionality reduction, and neural density estimation to efficiently handle inverse problems that (i) must be solved multiple times, and…

This paper presents a new Metropolis-adjusted Langevin algorithm (MALA) that uses convex analysis to simulate efficiently from high-dimensional densities that are log-concave, a class of probability distributions that is widely used in…

We extend to Lipschitz continuous functionals either of the true paths or of the Euler scheme with decreasing step of a wide class of Brownian ergodic diffusions, the Central Limit Theorems formally established for their marginal empirical…

We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the…

Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin process whose friction coefficient depends on the state of a similar, unobserved process. Integrating out the latter, we derive the long…

We study the infinite-horizon average (ergodic) risk sensitive control problem for diffusion processes under a general structural hypothesis: there is a partition of state space into two subsets, where the controlled diffusion process…

Recently Whitaker et al. (2017) considered Bayesian estimation of diffusion driven mixed effects models using data-augmentation. The missing data, diffusion bridges connecting discrete time observations, are drawn using a "residual bridge…

We propose a new approach for estimating the finite dimensional transition matrix of a Markov chain using a large number of independent sample paths observed at random times. The sample paths may be observed as few as two times, and the…

Monte Carlo experiments produce samples in order to estimate features of a given distribution. However, simultaneous estimation of means and quantiles has received little attention, despite being common practice. In this setting we…

The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…

Many modern production and measurement facilities incorporate multiphase systems at low pressures. In this region of flows at small, non-zero Knudsen- and low Mach numbers the classical mesoscopic Monte Carlo methods become increasingly…

MCMC methods (Monte Carlo Markov Chain) are a class of methods used to perform simulations per a probability distribution $P$. These methods are often used when we have difficulties to directly sample per a given probability distribution…

We define two algorithms for propagating information in classification problems with pairwise relationships. The algorithms are based on contraction maps and are related to non-linear diffusion and random walks on graphs. The approach is…

Stochastic differential equations provide a powerful tool for modelling dynamic phenomena affected by random noise. In case of repeated observations of time series for several experimental units, it is often the case that some of the…

Sampling from distributions play a crucial role in aiding practitioners with statistical inference. However, in numerous situations, obtaining exact samples from complex distributions is infeasible. Consequently, researchers often turn to…