On combinatorial strong law of large numbers and rank statistics

Abstract

The author had earlier obtained a strong law of large numbers P for combinatorial sums i Xniπn(i) , where kXnijk 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.