SearcharxivSearch

arXiv · 2205.06865

Creeping of L\'evy processes through curves

Abstract

A L\'evy process is said to creep through a curve if, at its first passage time across this curve, the process reaches it with positive probability. We first study this property for bivariate subordinators. Given the graph $\{(t,f(t)):t\ge0\}$ of any continuous, non increasing function $f$ such that $f(0)>0$, we give an expression of the probability that a bivariate subordinator $(Y,Z)$ issued from 0 creeps through this graph in terms of its renewal function and the drifts of the components $Y$ and $Z$. We apply this result to the creeping probability of any real L\'evy process through the graph of any continuous, non increasing function at a time where the process also reaches its past supremum. This probability involves the density of the renewal function of the bivariate upward ladder process as well as its drift coefficients. We also investigate the case of L\'evy processes conditioned to stay positive creeping at their last passage time below the graph of a function. Then we provide some examples and we give an application to the probability of creeping through fixed levels by stable Ornstein-Uhlenbeck processes. We also raise a couple of open questions along the text.

Explore related subjects

Keep this discovery

BibTeXRIS

Loïc Chaumont, Thomas Pellas. 2022-05-13. Creeping of L\'evy processes through curves. https://arxiv.org/abs/2205.06865

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