A Combinatorial Central Limit Theorem
Springer series in statisticsPublished 1 January 1994
Wassily Hoeffding
Citations148
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Let (Y n1,…,Y nn be a random vector which takes on the n! permutations of (1,…, n) with equal probabilities. Let c n(i,j), i,j = 1, …, n, be n real numbers. Sufficient conditions for the asymptotic normality of $$ S_n = \sum\limits_{i - 1}^n {c_n \left( {i,Y_{ni} } \right)} $$ are given (Theorem 3). For the special case c n(i,j) = a n(i)b n(j) a stronger version of a theorem of Wald, Wolfowitz and Noether is obtained (Theorem 4). A condition of Noether is simplified (Theorem 1).
Keywords
Computer ScienceDecision SciencesMathematics
BiometrikaTHE RELATION BETWEEN MEASURES OF CORRELATION IN THE UNIVERSE OF SAMPLE PERMUTATIONS
156 Citations1944H. E. DANIELS Wool
The Annals of Mathematical StatisticsOn the Theory of Some Non-Parametric Hypotheses
146 Citations1949E. L. Lehmann, C. Stein
On the Theory of Some Non-Parametric Hypotheses
127 Citations2011E. L. Lehmann, C. Stein
The Annals of Mathematical StatisticsOn the Limiting Distributions of Estimates Based on Samples from Finite Universes
103 Citations1948William G. Madow
