SearcharxivSearch

arXiv · 0711.2162

Mean-field backward stochastic differential equations: A limit approach

Abstract

Mathematical mean-field approaches play an important role in different fields of Physics and Chemistry, but have found in recent works also their application in Economics, Finance and Game Theory. The objective of our paper is to investigate a special mean-field problem in a purely stochastic approach: for the solution $(Y,Z)$ of a mean-field backward stochastic differential equation driven by a forward stochastic differential of McKean--Vlasov type with solution $X$ we study a special approximation by the solution $(X^N,Y^N,Z^N)$ of some decoupled forward--backward equation which coefficients are governed by $N$ independent copies of $(X^N,Y^N,Z^N)$. We show that the convergence speed of this approximation is of order $1/\sqrt{N}$. Moreover, our special choice of the approximation allows to characterize the limit behavior of $\sqrt{N}(X^N-X,Y^N-Y,Z^N-Z)$. We prove that this triplet converges in law to the solution of some forward--backward stochastic differential equation of mean-field type, which is not only governed by a Brownian motion but also by an independent Gaussian field.

Explore related subjects

Keep this discovery

BibTeXRIS

Rainer Buckdahn, Boualem Djehiche, Juan Li, Shige Peng. 2009-08-28. Mean-field backward stochastic differential equations: A limit approach. https://doi.org/10.1214/08-aop442

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