SearcharxivSearch

arXiv · 1804.08903

Decoupled mild solutions of path-dependent PDEs and IPDEsrepresented by BSDEs driven by cadlag martingales

Abstract

We focus on a class of path-dependent problems which include path-dependent (possibly Integro) PDEs, and their representation via BSDEs driven by a cadlag martingale. For those equations we introduce the notion of decoupled mild solution for which, under general assumptions, we study existence and uniqueness and its representation via the afore mentioned BSDEs. This concept generalizes a similar notion introduced by the authors in previous papers in the framework of classical PDEs and IPDEs. For every initial condition (s, $\eta$), where s is an initial time and $\eta$ an initial path, the solution of such BSDE produces a couple of processes (Y s,$\eta$ , Z s,$\eta$). In the classical (Markovian or not) literature the function u(s, $\eta$) := Y s,$\eta$ s constitutes a viscosity type solution of an associated PDE (resp. IPDE); our approach allows not only to identify u as (in our language) the unique decoupled mild solution, but also to solve quite generally the so called identification problem, i.e. to also characterize the (Z s,$\eta$) s,$\eta$ processes in term of a deterministic function v associated to the (above decoupled mild) solution u. MSC 2010 Classification. 60H30; 60H10; 35D99; 35S05; 60J35; 60J75.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrien Barrasso, Francesco Russo. 2018-04-24. Decoupled mild solutions of path-dependent PDEs and IPDEsrepresented by BSDEs driven by cadlag martingales. https://arxiv.org/abs/1804.08903

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