On Obtaining Permutation Distributions in Polynomial Time

DOI10.2307/2288653zbMath0517.62030OpenAlexW4235413055MaRDI QIDQ3666046

David L. Tritchler, Marcello Pagano

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2288653

zbMATH Keywords

stratificationfast Fourier transformtiespolynomial time algorithmsnonparametricscensored observationstwo-sample problemmultisample problempermutation distributions

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Probabilistic methods, stochastic differential equations (65C99)

Related Items

An adaptive Mantel–Haenszel test for sensitivity analysis in observational studies, Permutation Anderson–Darling Type and Moment-Based Test Statistics for Univariate Ordered Categorical Data, Efficient calculation of the permutation distribution of robust two- sample statistics, Analysis of discrete data: Rerandomization methods and complexity, Permutation tests - a revival?! II: An efficient algorithm for computing the critical region, Assessing fast Fourier transform algorithms., A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data, Higher order cumulants and Tchebyshev--Markov bounds for \(P\)-values in distribution-free matched-pairs tests, Robust permutation tests for one sample, Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test, A Pointwise Estimator for thek-Fold Convolution of a Distribution Function, A comparison of algorithms for exact analysis of unordered \(2\times K\) contingency tables, Simple exact bounds for distributions of linear signed rank statistics, A nonparametric estimator of the renewal function, Extending permutation conditional inference to unconditional ones, Exact analysis of a paired sibling data, On characteristic function-based bootstrap tests, Estimating probabilities from invariant permutation distributions, Evaluating alternative system configurations using simulation: A nonparametric approach, Exact algorithms for computing \(p\)-values of statistics-linear combination of 3-nomial variables, Robust permutation tests for two samples, Permutation inference distribution for linear regression and related models, Efficient calculation ofp-values in linear-statistic permutation significance tests, The split-up algorithm: a fast symbolic method for computing p-values of distribution-free statistics, A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins

Uses Software

• AS 142