SearcharxivSearch

arXiv · 2501.04218

Asymptotics of survival probabilities and lower tail probability problem

Abstract

The present paper is an addendum to the paper ``L\'evy models amenable to efficient calculations", where we introduced a general class of Stieltjes-L\'evy processes (SL-processes) and signed SL processes defined in terms of certain Stieltjes-L\'evy measures. We demonstrated that SL-processes enjoyed all properties that we used earlier to develop efficient methods for evaluation of expectations of functions of a L\'evy process and its extremum processes, and proved that essentially all popular classes of L\'evy processes are SL-processes; sSL-processes fail to possess one important property. In the present paper, we use the properties of (s)SL-processes to derive new formulas for the Wiener-Hopf factors $\phi^\pm_q$ for small $q$ in terms of the absolute continuous components of SL-measures and their densities, and calculate the leading terms of the survival probability also in terms of the absolute continuous components of SL-measures and their densities. The lower tail probability is calculated for more general classes of SINH-regular processes constructed earlier.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Svetlana Boyarchenko, Sergei Levendorskiĭ. 2025-01-08. Asymptotics of survival probabilities and lower tail probability problem. https://arxiv.org/abs/2501.04218

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