SearcharxivSearch

arXiv · 2401.16617

Propagation of chaos for doubly mean reflected BSDEs

Abstract

In this paper, we establish propagation of chaos (POC) for doubly mean reflected backward stochastic differential equations (MRBSDEs). MRBSDEs differentiate the typical RBSDEs in that the constraint is not on the paths of the solution but on its law. This unique property has garnered significant attention since the inception of MRBSDEs. Rather than directly investigating these equations, we focus on approximating them by interacting particle systems (IPS). We propose two sets of IPS having mean-field Skorokhod problems, capturing the dynamics of IPS reflected in a mean-field way. As the dimension of the IPS tends to infinity, the POC phenomenon emerges, indicating that the system converges to a limit with independent particles, where each solves the MRBSDE. Beyond establishing the first POC result for doubly MRBSDEs, we achieve distinct convergence speeds under different scenarios.

Explore related subjects

Keep this discovery

BibTeXRIS

Hanwu Li, Ning Ning. 2024-01-29. Propagation of chaos for doubly mean reflected BSDEs. https://arxiv.org/abs/2401.16617

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR