SearcharxivSearch

arXiv · 2006.08171

On the convergence of series of dependent random variables

Abstract

Given a sequence $(X_n)$ of symmetrical random variables taking values in a Hilbert space, an interesting open problem is to determine the conditions under which the series $\sum_{n=1}^\infty X_n$ is almost surely convergent. For independent random variables, it is well-known that if $\sum_{n=1}^\infty \mathbb{E}(\|X_n\|^2) <\infty$, then $\sum_{n=1}^\infty X_n$ converges almost surely. This has been extended to some cases of dependent variables (namely negatively associated random variables) but in the general setting of dependent variables, the problem remains open. This paper considers the case where each variable $X_n$ is given as a linear combination $a_{n,1}Z_1+ \ldots +a_{n,n}Z_n$ where $(Z_n)$ is a sequence of independent symmetrical random variables of unit variance and $(a_{n,k})$ are constants. For Gaussian random variables, this is the general setting. We obtain a sufficient condition for the almost sure convergence of $\sum_{n=1}^\infty X_n$ which is also sufficient for the almost sure convergence of $\sum_{n=1}^\infty \pm X_n$ for all (non-random) changes of sign. The result is based on an important bound of the mean of the random variable $\sup(\|X_1 + \ldots +X_k\|: 1\leq k \leq n)$ which extends the classical L\'evy's inequality and has some independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Safari Mukeru. 2020-06-15. On the convergence of series of dependent random variables. https://arxiv.org/abs/2006.08171

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