SearcharxivSearch

arXiv · math/0306015

Small deviations in p-variation for stable processes

Abstract

Let $\{Z_t, t\geq 0\}$ be a strictly stable process on $\R$ with index $α\in (0,2]$. We prove that for every $p > α$, there exists $γ= γ(α, p)$ and $\k = \k (α, p)\in (0, +\infty)$ such that $$\lim_{\ee\downarrow 0}\ee^γ\log\pb\lcr ||Z||_{p}\leq \ee \rcr = - \k,$$ where $||Z||_{p}$ stands for the strong $p$-variation of $Z$ on $[0,1]$. The critical exponent $γ(α, p)$ takes a different shape according as $|Z|$ is a subordinator and $p >1$, or not. The small ball constant $\k (α, p)$ is explicitly computed when $p \leq 1$, and a lower bound on $\k (α, p)$ is easily obtained in the general case. In the symmetric case and when $p > 2$, we can also give an upper bound on $\k (α, p)$ in terms of the Brownian small ball constant under the $(1/p)$-Hölder semi-norm. Along the way, we remark that the positive random variable $||Z||^p_{p}$ is not necessarily stable when $p > 1$, which gives a negative answer to an old question of P.~E.~Greenwood.

Explore related subjects

Keep this discovery

BibTeXRIS

T. Simon. 2003-05-31. Small deviations in p-variation for stable processes. https://arxiv.org/abs/math/0306015

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