A permutation test for matching and its asymptotic distribution

MaRDI QIDQ2002896zbMATH OpenFDO

Authors Larry Goldstein, Yosef Rinott

Publication date 12 July 2019

Published in Metron (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0511427

zbMATH Keywords

normal approximationsimilarityStein's method

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Nonparametric hypothesis testing (62G10)

Abstract: We consider a permutation method for testing whether observations given in their natural pairing exhibit an unusual level of similarity in situations where any two observations may be similar at some unknown baseline level. Under a null hypotheses where there is no distinguished pairing of the observations, a normal approximation with explicit bounds and rates is presented for determining approximate critical test levels.

Recommendations

• Bootstrapping and permuting paired \(t\)-test type statistics
• Exact and asymptotically robust permutation tests
• scientific article; zbMATH DE number 3992665
• Permutation Tests for Linear Models
• Numerical comparison of classical and permutation statistical hypothesis testing methods

Cited in

(7)

• Higher order cumulants and Tchebyshev--Markov bounds for \(P\)-values in distribution-free matched-pairs tests
• Permutation-based pairwise comparisons for assessing the homogeneity of probability distributions and missing data rates
• Distribution of descents in matchings
• Concentration inequalities via zero bias couplings
• Minimax rates in permutation estimation for feature matching
• Asymptotic properties of the matches number in pairing observations
• Bootstrapping and permuting paired \(t\)-test type statistics

This page was built for publication: A permutation test for matching and its asymptotic distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002896)