Related papers: Maximal inequalities and a law of the iterated log…
Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov…
In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…
Classical Kolmogorov's and Rosenthal's inequalities for the maximum partial sums of random variables are basic tools for studying the strong laws of large numbers. In this paper, motived by the notion of independent and identically…
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…
In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…
Based on a law of the iterated logarithm for independent random variables sequences, an iterated logarithm theorem for NA sequences with non-identical distributions is obtained. The proof is based on a Kolmogrov-type exponential inequality.
We derive concentration inequalities for sums of independent and identically distributed random variables that yield non-asymptotic generalizations of several strong laws of large numbers including some of those due to Kolmogorov [1930],…
This paper develops Rio's method [C. R. Acad. Sci. Paris S\'{e}r. I Math., 1995] to prove the weak law of large numbers for maximal partial sums of pairwise independent random variables. The method allows us to avoid using the Kolmogorov…
For a sequence of identically distributed negatively associated random variables $\{X_n; n\geq 1\}$ with partial sums $S_n=\sum_{i=1}^nX_i, n\geq 1$, refinements are presented of the classical Baum-Katz and Lai complete convergence…
Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…
In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…
In this paper, based on the initiation of the notion of negatively associated random variables under nonlinear probability, a strong limit theorem for weighted sums of random variables within the same frame is achieved without assumptions…
Let $\{X_i,i\geq1\}$ be a sequence of negatively associated random variables, and let $\{X_i^\ast,i\geq 1\}$ be a sequence of independent random variables such that $X_i^\ast$ and $X_i$ have the same distribution for each $i$. Denote by…
In information theory, the well-known log-sum inequality is a fundamental tool which indicates the non-negativity for the relative entropy. In this article, we establish a set of inequalities which are similar to the log-sum inequality…
We consider the sum of squared logarithms inequality and investigate possible connections with the theory of majorization. We also discuss alternative sufficient conditions on two sets of vectors $a,b\in\mathbb{R}_+^n$ so that…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…
Based on a maximal inequality type result of Cuculescu, we establish some noncommutative maximal inequalities such as Haj\'ek--Penyi inequality and Etemadi inequality. In addition, we present a noncommutative Kolmogorov type inequality by…
The upper bound inequality for variance of weighted sum of correlated random variables is derived according to Cauchy-Schwarz's inequality, while the weights are non-negative with sum of 1. We also give a novel proof with positive…
There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…
We prove Kolmogorov's law of the iterated logarithm for noncommutative martingales. The commutative case was due to Stout. The key ingredient is an exponential inequality proved recently by Junge and the author.