SearcharxivSearch

arXiv · 1706.06184

On heavy-tail phenomena in some large deviations problems

Abstract

In this paper, we revisit the proof of the large deviations principle of Wiener chaoses partially given by Borel, and then by Ledoux in its full form. We show that some heavy-tail phenomena observed in large deviations can be explained by the same mechanism as for the Wiener chaoses, meaning that the deviations are created, in a sense, by translations. More precisely, we prove a general large deviations principle for a certain class of functionals $f_n : \mathbb{R}^n \to \mathcal{X}$, where $\mathcal{X}$ is some metric space, under the $n$-fold probability measure $\nu_{\alpha}^n$, where $\nu_{\alpha} =Y_{\alpha}^{-1}e^{-|x|^{\alpha}}dx$, $\alpha \in (0,2]$, for which the large deviations are due to translations. We retrieve, as an application, the large deviations principles known for the Wigner matrices without Gaussian tails, of the empirical spectral measure by Bordenave and Caputo, the largest eigenvalue and traces of polynomials by the author. We also apply our large deviations result to the last-passage time, which yields a large deviations principle when the weights have the density $Z_{\alpha}^{-1} e^{-x^{\alpha}}$ with respect to Lebesgue measure on $\mathbb{R}_+$, with $\alpha \in (0,1)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Fanny Augeri. 2017-06-19. On heavy-tail phenomena in some large deviations problems. https://arxiv.org/abs/1706.06184

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