The author had earlier obtained a strong law of large numbers for combinatorial sums Σi Xniπn (i), where ||Xnij|| is a matrix of order n from random variables with finite fourth moments and (πn(1), πn (2), . . . , πn(n)) is a random permutation having the uniform distribution on the set of all permutations of numbers 1, 2, . . . , n and being independent from random variables Xnij. The mutual independence for entries of the matrix has not been assumed. In the present paper, we derive the combinatorial SLLN under more general assumptions and discuss the behaviour of rank statistics.
Original languageRussian
Pages (from-to)490-499
JournalВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. МАТЕМАТИКА. МЕХАНИКА. АСТРОНОМИЯ
Volume7
Issue number3
StatePublished - 2020
Externally publishedYes

    Research areas

  • combinatorial strong law of large numbers, combinatorial sums, Rank statistics, Spearman’s coefficient of rank correlation, strong law of large numbers, комбинаторные суммы, комбинаторный усиленный закон больших чиcел, коэффициент ранговой корреляции Спирмена, ранговые статистики, усиленный закон больших чисел

ID: 78423181