A Combinatorial Central Limit Theorem

From MaRDI portal
Publication:5807206

DOI10.1214/aoms/1177729545zbMath0044.13702OpenAlexW4255170875WikidataQ105198139 ScholiaQ105198139MaRDI QIDQ5807206

Wassily Hoeffding

Publication date: 1951

Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177729545




Related Items (74)

Testing for Balance in Social NetworksDistribution-Free Consistent Independence Tests via Center-Outward Ranks and SignsOptimizing the JSM ProgramCombinatorial stochastic processesStein's method for concentration inequalitiesA short proof of Motoo's combinatorial central limit theorem using Stein's methodExact tables of Spearman's footrule for \(N=11(1)18\) with estimate of convergence and errors for the normal approximationStein's method, heat kernel, and linear functions on the orthogonal groupsCovariate adjustment in randomization-based causal inference for \(2^K\) factorial designsA general theory of hypothesis testing based on rankingsLimit theorems for sampling from finite populationsOn the Accuracy in a Combinatorial Central Limit Theorem: The Characteristic Function MethodA Uniform Bound on a Combinatorial Central Limit TheoremAn improvement of a non-uniform bound for combinatorial central limit theoremOn the probabilities of moderate deviations for combinatorial sumsOn the central limit theorem for the two-sided descent statistics in Coxeter groupsOn the probabilities of large deviations of combinatorial sums of independent random variables that satisfy the Linnik conditionBootstrap and permutation tests of independence for point processesBounds of the remainder in a combinatorial central limit theoremAnticoncentration and Berry-Esseen bounds for random tensorsConcentration inequalities using approximate zero bias couplings with applications to Hoeffding’s statistic under the Ewens distributionCramér-type moderate deviations under local dependenceLimit theorems for random sums of random summandsMax-sum test based on Spearman's footrule for high-dimensional independence testsLimiting distributions of graph-based test statistics on sparse and dense graphsApproximating symmetrized estimators of scatter via balanced incomplete \(U\)-statisticsRemembering Wassily HoeffdingAsymptotic normality of double-indexed linear permutation statisticsTesting equality of correlation coefficients in two populations via permutation methodsLinear functions on the classical matrix groupsMallows' models for imperfect ranking in ranked set samplingEsseen type bounds of the remainder in a combinatorial CLTMatrix concentration inequalities via the method of exchangeable pairsExponential inequality for chaos based on sampling without replacementIntersections of hypergraphsConcentration inequalities via zero bias couplingsRank correlation methods for missing dataMAX-plus objects to study the complexity of graphs\(L^1\) bounds in normal approximationAn approximation theorem for sums of certain randomly selected indicatorsError bounds in local limit theorems using Stein's methodSize biased couplings and the spectral gap for random regular graphsWeighted dependency graphsSome asymptotic results for a broad class of nonparametric statisticsThe use of spearman's footrule in testing for trend when the data are incompleteEmpirical likelihood block bootstrappingOn regression adjustments in experiments with several treatmentsEstimation in exponential families on permutationsMultivariate normal approximation with Stein's method of exchangeable pairs under a general linearity conditionTwo central limit problems for dependent random variablesRemainder term estimate in a combinatorial limit theoremA Bernstein type inequality for sums of selections from three dimensional arraysCombinatorial problems of probability theoryStein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distributionDetection of sparse positive dependenceA Coupling Proof of the Asymptotic Normality of the Permutation OscillationParametric versus nonparametrics: two alternative methodologiesAnticoncentration for subgraph statisticsNon uniform bound on a combinatorial central limit theoremStein's method of normal approximation: some recollections and reflectionsUnnamed ItemUnnamed ItemOn large deviations for combinatorial sumsThe asymptotic normality of \((s,s+1)\)-cores with distinct partsSymmetrization and decoupling of combinatorial random elementsProduct mixing in the alternating groupAsymptotic properties of Lee distanceOn the Hoeffding's combinatorial central limit theoremModified log-Sobolev inequalities, Beckner inequalities and moment estimatesThe distribution of permutation matrix entries under randomized basisAn estimate of the remainder in a combinatorial central limit theoremOn the error bound in a combinatorial central limit theoremStein meets Malliavin in normal approximationStatistical applications of linear assignment




This page was built for publication: A Combinatorial Central Limit Theorem