On Obtaining Permutation Distributions in Polynomial Time

DOI10.2307/2288653MaRDI QIDQ3666046zbMATH OpenOpenAlexFDO

Authors Marcello Pagano, David L. Tritchler

Publication date 1983

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

zbMATH Keywords

stratificationtiesfast Fourier transformnonparametricscensored observationstwo-sample problempolynomial time algorithmsmultisample problempermutation distributions

Mathematics Subject Classification ID

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

Cited in

(27)

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

Describes a project that uses

Uses Software

• AS 142

This page was built for publication: On Obtaining Permutation Distributions in Polynomial Time

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