SearcharxivSearch

arXiv · 1208.0620

Excursions and path functionals for stochastic processes with asymptotically zero drifts

Abstract

We study discrete-time stochastic processes $(X_t)$ on $[0,\infty)$ with asymptotically zero mean drifts. Specifically, we consider the critical (Lamperti-type) situation in which the mean drift at $x$ is about $c/x$. Our focus is the recurrent case (when $c$ is not too large). We give sharp asymptotics for various functionals associated with the process and its excursions, including results on maxima and return times. These results include improvements on existing results in the literature in several respects, and also include new results on excursion sums and additive functionals of the form $\sum_{s \leq t} X_s^α$, $α>0$. We make minimal moments assumptions on the increments of the process. Recently there has been renewed interest in Lamperti-type process in the context of random polymers and interfaces, particularly nearest-neighbour random walks on the integers; some of our results are new even in that setting. We give applications of our results to processes on the whole of $\R$ and to a class of multidimensional `centrally biased' random walks on $\R^d$; we also apply our results to the simple harmonic urn, allowing us to sharpen existing results and to verify a conjecture of Crane et al.

Explore related subjects

Keep this discovery

BibTeXRIS

Ostap Hryniv, Mikhail V. Menshikov, Andrew R. Wade. 2012-08-02. Excursions and path functionals for stochastic processes with asymptotically zero drifts. https://doi.org/10.1016/j.spa.2013.02.001

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