Search arXivSearch

arXiv · 2512.00386

Convergence of Reflected Langevin Diffusion for Constrained Sampling

Abstract

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 their invariant measures converge, in Wasserstein-2 distance and with explicit polynomial rate, to the invariant measure of the reflected Langevin diffusion. We also analyze a time-discretization of the penalized process obtained via the Euler-Maruyama scheme and demonstrate the convergence to the original constrained measure. These results provide a rigorous approximation framework for reflected Langevin dynamics in both continuous and discrete time.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tarika Mane, Amine Boukardagha. 2026-01-21. Convergence of Reflected Langevin Diffusion for Constrained Sampling. https://arxiv.org/abs/2512.00386

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

KEEP EXPLORING

Related papers

Central Limit Theorems for Sample Fréchet Means of Manifold-Valued Markov Chains

In this article, we establish central limit theorems for sample Fréchet means of stationary ergodic Markov chains taking values in manifolds, extending the asymptotic theory previously developed for independent observations to a class of dependent manifold-valued processes. Our results derive the asymptotic normality of the sample Fréchet mean from a central limit condition at the population Fréchet mean, under suitable local regularity conditions. We further provide sufficient geometric and probabilistic conditions under which these assumptions hold, formulated in terms of curvature bounds and a Wasserstein mixing condition. As an application, we establish a central limit theorem for sample Fréchet means for a class of random dynamical systems generated by contractive random maps.

math.PR

Unbounded Dynamic Concave Utilities via BSDEs

The dynamic concave utility (or the dynamic convex risk measure) of an unbounded endowment is studied and represented as the value process in the unique solution of a backward stochastic differential equation (BSDE) with an unbounded terminal value, with the help of our recent existence and uniqueness results on unbounded solutions of scalar BSDEs whose generators have a linear, super-linear, sub-quadratic or quadratic growth. Moreover, the infimum in the dynamic concave utility is shown to be achieved in a well-chosen admissible set associated with the terminal value and the core function. The Fenchel-Legendre conjugates of convex functions, the de la Vallée-Poussin theorem, and Young's and Gronwall's inequalities constitute the main ingredients of the dual representation.

math.PR

Fluid Limits for Time-Varying Many-Server Loss Systems via Discontinuous Volterra Equations

This paper develops fluid limits for nonstationary many-server loss systems with general service-time distributions. For the zero-buffer $M_t/G/n/n$ queueing model, we prove a functional strong law of large numbers for the fraction of busy servers and characterize the limit by a nonlinear Volterra integral equation with discontinuous coefficients induced by instantaneous blocking. Well-posedness is established through an appropriate solution concept, yielding the time-varying acceptance probability without heuristic approximations. We then treat the finite-buffer $M_t/G/n/(n+b_n)$ regime, proving a functional strong law of large numbers for the triplet of fractions of busy servers, occupied buffers, and cumulative departures, whose limit satisfies a coupled system of three discontinuous Volterra equations capturing the interaction of service completions, buffer occupancy, and admission control at the capacity boundary. We establish well-posedness and convergence of the time-varying acceptance probability weakly in $L^1$ weighted by the arrival rate, and locally uniformly on the set of times at which the system is not full. Our theoretical results are supported by numerical simulations for both zero and finite-buffer regimes, illustrating the convergence of transient acceptance probabilities guaranteed by our theory. Finally, we use the fluid limits to derive optimal staffing and buffer-capacity for both time-varying loss systems.

math.PR