相关论文: Speeding up Langevin Dynamics by Mixing

An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…

In this paper, we study systems of $N$ interacting particles described by the classical and relativistic Langevin dynamics with singular forces and multiplicative noises. For the classical model, we prove the ergodicity, obtaining an…

This paper provides an extended case study of the cutoff phenomenon for a prototypical class of nonlinear Langevin systems with a single stable state perturbed by an additive pure jump L\'evy noise of small amplitude $\varepsilon>0$, where…

The problem of sampling a target probability distribution on a constrained domain arises in many applications including machine learning. For constrained sampling, various Langevin algorithms such as projected Langevin Monte Carlo (PLMC),…

We consider a Markov jump process on a general state space to which we apply a time-dependent weak perturbation over a finite time interval. By martingale-based stochastic calculus, under a suitable exponential moment bound for the…

We examine the Langevin diffusion confined to a closed, convex domain $D\subset\mathbb{R}^d$, represented as a reflected stochastic differential equation. We introduce a sequence of penalized stochastic differential equations and prove that…

We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements,…

In an earlier joint work, we studied a sequential Monte Carlo algorithm to sample from the Gibbs measure supported on torus with a non-convex energy function at a low temperature, where we proved that the time complexity of the algorithm is…

We investigate entropy production in the small-mass (or overdamped) limit of Langevin-Kramers dynamics. The results generalize previous works to provide a rigorous derivation that covers systems with magnetic field as well as anisotropic…

We propose discrete Langevin proposal (DLP), a simple and scalable gradient-based proposal for sampling complex high-dimensional discrete distributions. In contrast to Gibbs sampling-based methods, DLP is able to update all coordinates in…

Motivated in part by a problem in simulated tempering (a form of Markov chain Monte Carlo) we seek to minimise, in a suitable sense, the time it takes a (regular) diffusion with instantaneous reflection at 0 and 1 to travel to $1$ and then…

This paper studies the mixing time of certain adaptive Markov Chain Monte Carlo algorithms. Under some regularity conditions, we show that the convergence rate of Importance Resampling MCMC (IRMCMC) algorithm, measured in terms of the total…

We prove an $\widetilde O(n^2)$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n+2)$-gon, implying a mixing time of $\widetilde O(n^2)$. The…

Everything you ever wanted to know about what has come to be known as ``chaotic mixing:'' This paper describes the evolution of localised ensembles of initial conditions in 2- and 3-D time-independent potentials which admit both regular and…

It is well known in many settings that reversible Langevin diffusions in confining potentials converge to equilibrium exponentially fast. Adding irreversible perturbations to the drift of a Langevin diffusion that maintain the same…

Karlin's (1982) Theorem 5.2 shows that linear systems alternating between growth and mixing phases have lower asymptotic growth with greater mixing. Here this result is extended to linear differential equations that combine site-specific…

We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive…

We consider stochastic spin-flip dynamics for: (i) monotone discrete surfaces in Z^3 with planar boundary height and (ii) the one-dimensional discrete Solid-on-Solid (SOS) model confined to a box. In both cases we show almost optimal bounds…

This note provides a simple derivation of the overdamped approximation for kinetic (or underdamped) equilibrium Langevin dynamics, in cases where certain coefficients depend on the position variable. The equivalent small-mass limit of these…

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…