Search arXiv⌕ Search

arXiv · 2610.10252

Limit theorems for one-dimensional diffusions: reflected, skew, sticky, skew-sticky, and snapping-out limits

Abstract

We establish general conditions for the weak convergence of regular one-dimensional diffusion processes when their scale functions, speed measures, state spaces and boundary conditions may substantially vary. Our approach is based on the classical Itô--McKean representation of regular diffusions via time changes and scale transformations of a single Brownian motion. This reduces many stochastic convergence problems to deterministic questions concerning the convergence of integrals, monotone functions, compositions, and generalized inverses. As a main application, we investigate various homogenization regimes for diffusions in media with closely spaced semipermeable membranes, where the resulting limiting processes include not only reflected and skew Brownian motions, but also skew-sticky Brownian motions and snapping-out diffusions. This yields a representation of a snapping-out diffusion as a function of a single Brownian motion, without introducing an auxiliary sequence of independent exponential random variables.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrey Pilipenko, Gilles Vilmart. 2026-10-07. Limit theorems for one-dimensional diffusions: reflected, skew, sticky, skew-sticky, and snapping-out limits. https://arxiv.org/abs/2610.10252

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

KEEP EXPLORING

Related papers

Uniqueness and tube property for the Swiss cheese large deviations

We consider the simple random walk on the Euclidean lattice, in three dimensions and higher, conditioned to visit fewer sites than expected, when the deviation from the mean scales like the mean. The associated large deviation principle was first derived in 2001 by van den Berg, Bolthausen and den Hollander in the continuous setting, that is for the volume of a Wiener sausage, and later taken up by Phetpradap in the discrete setting. One of the key ideas in their work is to condition the range of the random walk to a certain skeleton, that is a sub-sequence of the random walk path taken along an appropriate mesoscopic scale. In this paper we prove that (i) the rate function obtained by van den Berg, Bolthausen and den Hollander has a unique minimizer over the set of probability measures modulo shifts, at least for deviations of the range well below the mean, and (ii) the empirical measure of the skeleton converges under the conditioned law, in a certain manner, to this minimizer. To this end we use an adaptation of the topology recently introduced by Mukherjee and Varadhan to compactify the space of probability measures.

math.PR↗

Variational representation and estimates for the free energy of a quenched charged polymer model

Random walks with a disordered self-interaction potential may be used to model charged polymers. In this paper we consider a one-dimensional and directed version of the charged polymer model that was introduced by Derrida, Griffiths and Higgs. We prove new results for the associated quenched free energy, including a variational formula based on a quenched large deviation principle established by Birkner, Greven and den Hollander. We also take the occasion to (i) provide detailed proofs for state-of-the-art results pointing towards the existence of a freezing transition and (ii) proceed with minor corrections for two results previously obtained by the present author with Caravenna, den Hollander and P{é}tr{é}lis for the undirected model.

math.PR↗

Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph

We study pairwise negative correlation for three families of uniform spanning-subgraph measures on the complete graph. In Part~I, we consider the uniform probability measure on connected spanning subgraphs and prove pairwise negative correlation for all sufficiently large complete graphs. In Part~II, we study the uniform measure on spanning forests with a prescribed number of connected components and prove pairwise negative correlation for every fixed number of components when the number of vertices is sufficiently large. In Part~III, we consider connected spanning subgraphs with prescribed excess and establish the analogous result for every fixed excess. The three parts are self-contained and are intended as separate manuscripts.

math.PR↗