Related papers: Variance reduction for irreversible Langevin sampl…
The Langevin dynamics is a diffusion process extensively used, in particular in molecular dynamics simulations, to sample Gibbs measures. Some alternatives based on (piecewise deterministic) kinetic velocity jump processes have gained…
It is known that the distribution of nonreversible Markov processes breaking the detailed balance condition converges faster to the stationary distribution compared to reversible processes having the same stationary distribution. This is…
We study statistical models for one-dimensional diffusions which are recurrent null. A first parameter in the drift is the principal one, and determines regular varying rates of convergence for the score and the information process. A…
We consider the extreme value statistics of correlated random variables that arise from a Langevin equation. Recently, it was shown that the extreme values of the Ornstein-Uhlenbeck process follow a different distribution than those…
We study maximum-likelihood-type estimation for diffusion processes when the coefficients are nonrandom and observation occurs in nonsynchronous manner. The problem of nonsynchronous observations is important when we consider the analysis…
Most existing graph diffusion models have significant bias problems. We observe that the forward diffusion's maximum perturbation distribution in most models deviates from the standard Gaussian distribution, while reverse sampling…
Many inverse problems arising in applications come from continuum models where the unknown parameter is a field. In practice the unknown field is discretized resulting in a problem in $\mathbb{R}^N$, with an understanding that refining the…
We study small perturbations of diffusion processes in $\mathbb{R}^d$ that leave invariant a finite collection of hypersurfaces. Each surface is assumed to be repelling for the unperturbed process, and the unperturbed motion on each of the…
In Monte-Carlo methods the Markov processes used to sample a given target distribution usually satisfy detailed balance, i.e. they are time-reversible. However, relatively recent results have demonstrated that appropriate reversible and…
The measured time series from complex systems are renowned for their intricate stochastic behavior, characterized by random fluctuations stemming from external influences and nonlinear interactions. These fluctuations take diverse forms,…
We consider the convergence of kinetic Langevin dynamics to its ergodic invariant measure, which is Gibbs distribution. Instead of the standard setup where the friction coefficient is a constant scalar, we investigate position-dependent…
We present a novel method for drawing samples from Gibbs distributions with densities of the form $\pi(x) \propto \exp(-U(x))$. The method accelerates the unadjusted Langevin algorithm by introducing an inertia term similar to Polyak's…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…
We propose and analyze a class of adaptive sampling algorithms for multimodal distributions on a bounded domain, which share a structural resemblance to the classic overdamped Langevin dynamics. We first demonstrate that this class of…
A systematic procedure for optimising the friction coefficient in underdamped Langevin dynamics as a sampling tool is given by taking the gradient of the associated asymptotic variance with respect to friction. We give an expression for…
Gibbs sampling repeatedly samples from the conditional distribution of one variable, x_i, given other variables, either choosing i randomly, or updating sequentially using some systematic or random order. When x_i is discrete, a Gibbs…
We consider the sampling problem from a composite distribution whose potential (negative log density) is $\sum_{i=1}^n f_i(x_i)+\sum_{j=1}^m g_j(y_j)+\sum_{i=1}^n\sum_{j=1}^m\frac{\sigma_{ij}}{2\eta} \Vert x_i-y_j \Vert^2_2$ where each of…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
In the case of diffusions on $\mathbb R^d$ with constant diffusion matrix, without assuming reversibility nor hypoellipticity, we prove that the contractivity of the deterministic drift is equivalent to the constant rate contraction of…