We consider a class of Langevin diffusions with state-dependent volatility. The volatility of the diffusion is chosen so as to make the stationary distribution of the diffusion with respect to its natural clock, a heated version of the stationary density of interest. The motivation behind this construction is the desire to construct uniformly ergodic diffusions with required stationary densities. Discrete time algorithms constructed by Hastings accept reject mechanisms are constructed from discretisations of the algorithms, and the properties of these algorithms are investigated
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
Recent work incorporating geometric ideas in Markov chain Monte Carlo is reviewed in order to highli...
We describe a Langevin diffusion with a target stationary density with respect to Lebesgue measure, ...
We consider the optimal scaling problem for proposal distributions in Hastings–Metropolis algorithms...
Abstract. We present explicit methods for simulating diffusions whose generator is self-adjoint with...
Abstract. We present explicit methods for simulating diffusions whose generator is self-adjoint with...
In our work we propose new Exact Algorithms for simulation of diffusions with discontinuous drift an...
The paper considers high dimensional Metropolis and Langevin algorithms in their initial transient p...
It has been shown that the nonreversible overdamped Langevin dynamics enjoy better convergence prope...
A broad class of implicit or partially implicit time discretizations for the Langevin diffusion are ...
Abstract. This paper considers high-dimensional Metropolis and Langevin algorithms in their initial ...
The dimension and the complexity of inference problems have dramatically increased in statistical si...
The Metropolis-adjusted Langevin (MALA) algorithm is a sampling algorithm which makes local moves by...
42 pages, 6 figuresInternational audienceWe consider the Random Walk Metropolis algorithm on $\R^n$ ...
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
Recent work incorporating geometric ideas in Markov chain Monte Carlo is reviewed in order to highli...
We describe a Langevin diffusion with a target stationary density with respect to Lebesgue measure, ...
We consider the optimal scaling problem for proposal distributions in Hastings–Metropolis algorithms...
Abstract. We present explicit methods for simulating diffusions whose generator is self-adjoint with...
Abstract. We present explicit methods for simulating diffusions whose generator is self-adjoint with...
In our work we propose new Exact Algorithms for simulation of diffusions with discontinuous drift an...
The paper considers high dimensional Metropolis and Langevin algorithms in their initial transient p...
It has been shown that the nonreversible overdamped Langevin dynamics enjoy better convergence prope...
A broad class of implicit or partially implicit time discretizations for the Langevin diffusion are ...
Abstract. This paper considers high-dimensional Metropolis and Langevin algorithms in their initial ...
The dimension and the complexity of inference problems have dramatically increased in statistical si...
The Metropolis-adjusted Langevin (MALA) algorithm is a sampling algorithm which makes local moves by...
42 pages, 6 figuresInternational audienceWe consider the Random Walk Metropolis algorithm on $\R^n$ ...
Recent optimal scaling theory has produced a condition for the asymptotically optimal acceptance rat...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
Recent work incorporating geometric ideas in Markov chain Monte Carlo is reviewed in order to highli...