SearcharxivSearch

arXiv · 2503.20487

On asymptotic behavior of almost surely extreme values of independent random variables

Abstract

The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this topic is related to the law of the iterated logarithm for the lim sup (LIL) and a law of the triple logarithm for the lim inf (LTL). But, taking into account the specifics of the discrete case, necessary and sufficient conditions are established for $\mathbf{P}(\bar{\xi}_n = a_n +l \quad\mbox{infinitely often} ) =1$, where $a_n$ is some given increasing sequence of integers and $l$ is a fixed integer. Note that in the case of discrete random variables whose distribution tails are close to the tails of the Poisson distribution or fall off even faster, Theorems 1-3 of this article are significantly more informative than LIL and LTL. For the geometric distribution (or discrete random variables whose tails fall off even more slowly), the results are given in Theorem 3 and Theorem B, which are an important complement to LIL and LTL.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kateryna Akbash, Ivan Matsak. 2025-03-26. On asymptotic behavior of almost surely extreme values of independent random variables. https://arxiv.org/abs/2503.20487

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