Search arXivSearch

arXiv · 2409.14212

Convergence rate for random walk approximations of mean field BSDEs

Abstract

We study the rate of convergence w.r.t.~a Wasserstein type distance for random walk approximations of mean field BSDEs. Our method does not use the particle method but instead a freezing technique. We extend results by Briand, Ch. Geiss, S. Geiss, and Labart [Bernoulli, 27(2) 2021] about the rate of convergence of a Donsker-type theorem for BSDEs from the classical setting to the mean field setting. In this connection the mean field setting leads to new phenomena and requires new techniques that should be of independent interest: The Hölder continuous terminal condition causes a singularity in time of the generator when seen as a generator in the non-mean field setting. To handle this singularity we introduce a concept of modified Hölder continuity by which we are able to achieve, up to a logarithmic term, the same polynomial approximation rates as in the classical non-mean field setting (in fact, already when approximating the Brownian motion itself a logarithmic term is necessary). Moreover, the exploited freezing technique of the mean field terms yields to the problem to handle the quantitative behavior of several different generators. Using BMO-techniques we obtain the rate of convergence for the integrated gradient process in the scale of Lorentz (type) spaces of exponential type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Boualem Djehiche, Hannah Geiss, Stefan Geiss, Céline Labart, Jani Nykänen. 2025-05-20. Convergence rate for random walk approximations of mean field BSDEs. https://arxiv.org/abs/2409.14212

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

KEEP EXPLORING

Related papers

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR