SearcharxivSearch

arXiv · 1308.2250

Weak reflection principle for Lévy processes

Abstract

In this paper, we develop a new mathematical technique which allows us to express the joint distribution of a Markov process and its running maximum (or minimum) through the marginal distribution of the process itself. This technique is an extension of the classical reflection principle for Brownian motion, and it is obtained by weakening the assumptions of symmetry required for the classical reflection principle to work. We call this method a weak reflection principle and show that it provides solutions to many problems for which the classical reflection principle is typically used. In addition, unlike the classical reflection principle, the new method works for a much larger class of stochastic processes which, in particular, do not possess any strong symmetries. Here, we review the existing results which establish the weak reflection principle for a large class of time-homogeneous diffusions on a real line and then proceed to extend this method to the Lévy processes with one-sided jumps (subject to some admissibility conditions). Finally, we demonstrate the applications of the weak reflection principle in financial mathematics, computational methods and inverse problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erhan Bayraktar, Sergey Nadtochiy. 2015-10-26. Weak reflection principle for Lévy processes. https://doi.org/10.1214/14-aap1073

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