On combinatorial strong law of large numbers and rank statistics

DOI10.1134/S1063454120030073zbMath1460.62091OpenAlexW3087356055MaRDI QIDQ2227909

Andrei N. Frolov

Publication date: 16 February 2021

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1063454120030073

zbMATH Keywords

strong law of large numbersrank statisticscombinatorial sumscombinatorial strong law of large numbersSpearman's coefficient of rank correlation

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Strong limit theorems (60F15) Combinatorial probability (60C05) Characterization and structure theory of statistical distributions (62E10)

Related Items (1)

On the bounds for convergence rates in combinatorial strong limit theorems and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds of the remainder in a combinatorial central limit theorem
• An \(L_p\) bound for the remainder in a combinatorial central limit theorem
• On the error bound in a combinatorial central limit theorem
• On the probabilities of moderate deviations for combinatorial sums
• Esseen type bounds of the remainder in a combinatorial CLT
• Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
• An estimate of the remainder in a combinatorial central limit theorem
• Remainder term estimate in a combinatorial limit theorem
• A Uniform Bound on a Combinatorial Central Limit Theorem
• On Esseen type inequalities for combinatorial random sums

This page was built for publication: On combinatorial strong law of large numbers and rank statistics