SearcharxivSearch

arXiv · math/0505245

Accelerating diffusions

Abstract

Let U be a given function defined on R^d and π(x) be a density function proportional to \exp -U(x). The following diffusion X(t) is often used to sample from π(x), dX(t)=-\nabla U(X(t)) dt+\sqrt2 dW(t),\qquad X(0)=x_0. To accelerate the convergence, a family of diffusions with π(x) as their common equilibrium is considered, dX(t)=\bigl(-\nabla U(X(t))+C(X(t))\bigr) dt+\sqrt2 dW(t),\qquad X(0)=x_0. Let L_C be the corresponding infinitesimal generator. The spectral gap of L_C in L^2(π) (λ(C)), and the convergence exponent of X(t) to πin variational norm (ρ(C)), are used to describe the convergence rate, where λ(C)= Sup{real part of μ\dvtxμis in the spectrum of L_C, μis not zero}, {-2.8cm}ρ(C) = Inf\biggl{ρ\dvtx\int | p(t,x,y) -π(y)| dy \le g(x) e^{ρt}\biggr}.Roughly speaking, L_C is a perturbation of the self-adjoint L_0 by an antisymmetric operator C\cdot\nabla, where C is weighted divergence free. We prove that λ(C)\le λ(0) and equality holds only in some rare situations. Furthermore, ρ(C)\le λ(C) and equality holds for C=0. In other words, adding an extra drift, C(x), accelerates convergence. Related problems are also discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Chii-Ruey Hwang, Shu-Yin Hwang-Ma, Shuenn-Jyi Sheu. 2005-05-12. Accelerating diffusions. https://doi.org/10.1214/105051605000000025

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR