The author previously obtained a strong law of large numbers for combinatorial sums ∑iXniπn(i), where ∥Xnij∥ is an n-order matrix of random variables with finite fourth moments and (πn(1), πn(2), …, πn(n)) is a random permutation uniformly distributed on the set of all permutations of numbers 1, 2, …, n, independent from the random variables Xnij. No mutual independence of elements of the matrix is assumed. We derive the combinatorial SLLN under more general assumptions in the present paper and discuss the behavior of rank statistics.
Original languageEnglish
Pages (from-to)336-343
Number of pages8
JournalVestnik St. Petersburg University: Mathematics
Volume53
Issue number3
DOIs
StatePublished - 1 Jul 2020

    Research areas

  • combinatorial sums, strong law of large numbers, combinatorial strong law of large numbers, rank statistics, Spearman’s coefficient of rank correlation

    Scopus subject areas

  • Mathematics(all)

ID: 62203461