SearcharxivSearch

arXiv · 2004.14315

Large deviation principles for non-elementary random walks on hyperbolic spaces

Abstract

We show that the displacement and translation distance of non-elementary random walks on isometry groups of hyperbolic spaces satisfy large deviation principles with the same rate function $I$. Roughly, this means that there exists function $I(t)$ which accurately predicts the exponential decay rate of the probability that the translation distance of a random product of length $n$ is $tn$, and similarly for the displacement. This settles a special case of a conjecture concerning the large deviation principle for the spectral radius of random matrix products. In a second part, we give a characterization of the effective support of the rate function only in terms of the deterministic notion of joint stable length. Finally, as a by-product of our techniques, we deduce some further deterministic results on the asymptotics of a bounded set of isometries. Some of the results in this paper were obtained simultaneously and independently by Boulanger--Mathieu as we discuss in the introduction.

Explore related subjects

Keep this discovery

BibTeXRIS

Cagri Sert, Alessandro Sisto. 2020-04-29. Large deviation principles for non-elementary random walks on hyperbolic spaces. https://arxiv.org/abs/2004.14315

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