SearcharxivSearch

arXiv · 1808.05816

Nonlinear predictable representation and $L^1$-solutions of backward SDEs and second-order backward SDEs

Abstract

The theory of backward SDEs extends the predictable representation property of Brownian motion to the nonlinear framework, thus providing a path-dependent analog of fully nonlinear parabolic PDEs. In this paper, we consider backward SDEs, their reflected version, and their second-order extension, in the context where the final data and the generator satisfy $L^1$-type of integrability condition. Our main objective is to provide the corresponding existence and uniqueness results for general Lipschitz generators. The uniqueness holds in the so-called Doob class of processes, simultaneously under an appropriate class of measures. We emphasize that the previous literature only deals with backward SDEs, and requires either that the generator is separable in $(y,z)$, see Peng [Pen97], or strictly sublinear in the gradient variable $z$, see [BDHPS03], or that the final data satisfies an $L\ln L$-integrability condition, see [HT18]. We by-pass these conditions by defining $L^1$-integrability under the nonlinear expectation operator induced by the previously mentioned class of measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhenjie Ren, Nizar Touzi, Junjian Yang. 2018-08-17. Nonlinear predictable representation and $L^1$-solutions of backward SDEs and second-order backward SDEs. https://arxiv.org/abs/1808.05816

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