SearcharxivSearch

arXiv · 0902.1328

On Az\'ema-Yor processes, their optimal properties and the Bachelier-drawdown equation

Abstract

We study the class of Az\'ema-Yor processes defined from a general semimartingale with a continuous running maximum process. We show that they arise as unique strong solutions of the Bachelier stochastic differential equation which we prove is equivalent to the drawdown equation. Solutions of the latter have the drawdown property: they always stay above a given function of their past maximum. We then show that any process which satisfies the drawdown property is in fact an Az\'ema-Yor process. The proofs exploit group structure of the set of Az\'ema-Yor processes, indexed by functions, which we introduce. We investigate in detail Az\'ema-Yor martingales defined from a nonnegative local martingale converging to zero at infinity. We establish relations between average value at risk, drawdown function, Hardy-Littlewood transform and its inverse. In particular, we construct Az\'ema-Yor martingales with a given terminal law and this allows us to rediscover the Az\'ema-Yor solution to the Skorokhod embedding problem. Finally, we characterize Az\'ema-Yor martingales showing they are optimal relative to the concave ordering of terminal variables among martingales whose maximum dominates stochastically a given benchmark.

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Carraro, Nicole El Karoui, Jan Obłój. 2009-02-09. On Az\'ema-Yor processes, their optimal properties and the Bachelier-drawdown equation. https://doi.org/10.1214/10-aop614

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