SearcharxivSearch

arXiv · 1106.2245

L\'evy processes conditioned on having a large height process

Abstract

In the present work, we consider spectrally positive L\'evy processes $(X_t,t\geq0)$ not drifting to $+\infty$ and we are interested in conditioning these processes to reach arbitrarily large heights (in the sense of the height process associated with $X$) before hitting 0. This way we obtain a new conditioning of L\'evy processes to stay positive. The (honest) law $\pfl$ of this conditioned process is defined as a Doob $h$-transform via a martingale. For L\'evy processes with infinite variation paths, this martingale is $(\int\tilde\rt(\mathrm{d}z)e^{\alpha z}+I_t)\2{t\leq T_0}$ for some $\alpha$ and where $(I_t,t\geq0)$ is the past infimum process of $X$, where $(\tilde\rt,t\geq0)$ is the so-called \emph{exploration process} defined in Duquesne, 2002, and where $T_0$ is the hitting time of 0 for $X$. Under $\pfl$, we also obtain a path decomposition of $X$ at its minimum, which enables us to prove the convergence of $\pfl$ as $x\to0$. When the process $X$ is a compensated compound Poisson process, the previous martingale is defined through the jumps of the future infimum process of $X$. The computations are easier in this case because $X$ can be viewed as the contour process of a (sub)critical \emph{splitting tree}. We also can give an alternative characterization of our conditioned process in the vein of spine decompositions.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathieu Richard. 2011-06-11. L\'evy processes conditioned on having a large height process. https://arxiv.org/abs/1106.2245

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