SearcharxivSearch

arXiv · 1704.00173

Iterated stochastic processes : simulation and relationship with high order partial differential equations

Abstract

In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler scheme to simulate the trajectories of the corresponding iterated processes on a fixed time interval. This algorithm is natural and can be implemented easily. We show that it converges almost surely, uniformly in time, with a rate of convergence of order 1/4 and propose an estimation of the error. We then extend the well known Feynman- Kac formula which gives a probabilistic representation of partial differential equations (PDEs), to its higher order version using iterated processes. In particular we consider general position processes which are not necessarily Markovian or are indexed by the real line but real valued. We also weaken some assumptions from previous works. We show that intertwining diffusions are related to transformations of high order PDEs. Combining our numerical scheme with the Feynman-Kac formula, we simulate functionals of the trajectories and solutions to fourth order PDEs that are naturally associated to a general class of iterated processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Michèle Thieullen, Alexis Vigot. 2017-05-01. Iterated stochastic processes : simulation and relationship with high order partial differential equations. https://arxiv.org/abs/1704.00173

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