SearcharxivSearch

arXiv · 1712.03637

A Martingale Approach for Fractional Brownian Motions and Related Path Dependent PDEs

Abstract

In this paper we study dynamic backward problems, with the computation of conditional expectations as a main objective, in a framework where the (forward) state process satisfies a Volterra type SDE, with fractional Brownian motion as a typical example. Such processes are neither Markov processes nor semimartingales, and most notably, they feature a certain time inconsistency which makes any direct application of Markovian ideas, such as flow properties, impossible without passing to a path-dependent framework. Our main result is a functional It\^{o} formula, extending the seminal work of Dupire \cite{Dupire} to our more general framework. In particular, unlike in \cite{Dupire} where one needs only to consider the stopped paths, here we need to concatenate the observed path up to the current time with a certain smooth observable curve derived from the distribution of the future paths. This new feature is due to the time inconsistency involved in this paper. We then derive the path dependent PDEs for the backward problems. Finally, an application to option pricing in a financial market with rough volatility is presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Frederi Viens, Jianfeng Zhang. 2017-12-11. A Martingale Approach for Fractional Brownian Motions and Related Path Dependent PDEs. https://arxiv.org/abs/1712.03637

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