On bounds for convergence rates in combinatorial strong limit theorems and its applications
DOI:
https://doi.org/10.21638/spbu01.2020.410Abstract
We find necessary and sufficient conditions for convergences of series of weighted probabilities of large deviations for combinatorial sums i Xniπn(i), where Xnij is a matrix of order n of independent random variables and (πn(1), πn(2), . . . , πn(n)) is a random permutation with the uniform distribution on the set of permutations of numbers 1, 2, . . . , n, independent with Xnij. We obtain combinatorial variants of results on convergence rates in the strong law of large numbers and the law of the iterated logarithm under conditions closed to optimal ones. We discuss applications to rank statistics.Keywords:
combinatorial sums, convergence rate, law of the iterated logarithm, strong law of large numbers, Baum — Katz bounds, combinatorial strong law of large numbers, combinatorial law of the iterated logarithm, rank statistics, Spearman’s coefficient of rank correlation
Downloads
References
Литература
References
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.