相关论文: Entropic multipliers method for langevin diffusion…

We develop a new method for proving hypocoercivity for a large class of linear kinetic equations with only one conservation law. Local mass conservation is assumed at the level of the collision kernel, while transport involves a confining…

The exponential ergodicity of partially dissipative McKean-Vlasov SDEs in the \(L^1\)-Wasserstein distance has been extensively studied using asymptotic reflection coupling. However, the reflection coupling method is not applicable for the…

We revisit entropy methods to prove new sharp trace logarithmic Sobolev and sharp Gagliardo-Nirenberg-Sobolev inequalities on the half space, with a focus on the entropy inequality itself and not the actual flow, allowing for somewhat…

We investigate a weighted Multilevel Richardson-Romberg extrapolation for the ergodic approximation of invariant distributions of diffusions adapted from the one introduced in~[Lemaire-Pag\`es, 2013] for regular Monte Carlo simulation. In a…

This paper studies convergence to equilibrium for the spatially inhomogeneous linear relaxation Boltzmann equation in Boltzmann entropy and related entropy functionals the $p$-entropies. Villani proved in \cite{V09} entropic hypocoercivity…

For sampling from a log-concave density, we study implicit integrators resulting from $\theta$-method discretization of the overdamped Langevin diffusion stochastic differential equation. Theoretical and algorithmic properties of the…

We study Langevin-type algorithms for sampling from Gibbs distributions such that the potentials are dissipative and their weak gradients have finite moduli of continuity not necessarily convergent to zero. Our main result is a…

We show the relation between processes which are modeled by a Langevin equation with multiplicative noise and infinite ergodic theory. We concentrate on a spatially dependent diffusion coefficient that behaves as ${D(x)}\sim…

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Classically, the continuous-time Langevin diffusion converges exponentially fast to its stationary distribution $\pi$ under the sole assumption that $\pi$ satisfies a Poincar\'e inequality. Using this fact to provide guarantees for the…

Quantitative long-time entropic convergence and short-time regularization are established for an idealized Hamiltonian Monte Carlo chain which alternatively follows an Hamiltonian dynamics for a fixed time and then partially or totally…

In this paper, we establish hypocoercivity for the semiconductor Boltzmann equation with the presence of an external electrical potential under the Maxwell boundary condition. We will construct a modified entropy Lyapunov functional, which…

We study the Riemannian Langevin Algorithm for the problem of sampling from a distribution with density $\nu$ with respect to the natural measure on a manifold with metric $g$. We assume that the target density satisfies a log-Sobolev…

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…

We study the boundedness and convergence to equilibrium of weak solutions to reaction-diffusion systems with nonlinear diffusion. The nonlinear diffusion is of porous medium type and the nonlinear reaction terms are assumed to grow…

General hyperbolic systems of balance laws with inhomogeneity in space and time in all constitutive functions are studied in the context of relative entropy. A framework is developed in this setting that contributes to a measure-valued weak…

We propose a Langevin diffusion-based algorithm for non-convex optimization and sampling on a product manifold of spheres. Under a logarithmic Sobolev inequality, we establish a guarantee for finite iteration convergence to the Gibbs…

Understanding the dimension dependency of computational complexity in high-dimensional sampling problem is a fundamental problem, both from a practical and theoretical perspective. Compared with samplers with unbiased stationary…

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

This paper is devoted to results on the Moser-Trudinger-Onofri inequality, or Onofri inequality for brevity. In dimension two this inequality plays a role similar to the Sobolev inequality in higher dimensions. After justifying this…