Gray codes for randomization procedures

We introduce a simple combinatorial scheme for systematically running through a complete enumeration of sample reuse procedures such as the bootstrap, Hartigan's subsets, and various permutation tests. The scheme is based on Gray codes which give ‘tours’ through various spaces, changing only one or two points at a time. We use updating algorithms to avoid recomputing statistics and achieve substantial speedups. Several practical examples and computer codes are given.

[1]  R. A. Fisher,et al.  Design of Experiments , 1936 .

[2]  Ronald Aylmer Sir Fisher,et al.  141: "The Coefficient of Racial Likeness" and the Future of Craniometry , 1936 .

[3]  E. S. Pearson.  SOME ASPECTS OF THE PROBLEM OF RANDOMIZATION , 1937 .

[4]  E. Pitman.  Significance Tests Which May be Applied to Samples from Any Populations , 1937 .

[5]  Irving John Good,et al.  The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[6]  B. Efron.  Student's t-Test under Symmetry Conditions , 1969 .

[7]  A. Dempster.  Elements of Continuous Multivariate Analysis , 1969 .

[8]  J. A. Hartigan,et al.  Using Subsample Values as Typical Values , 1969 .

[9]  Bradley Efron,et al.  Hotelling's T2 Test Under Symmetry Conditions , 1970 .

[10]  A. Forsythe,et al.  Efficiency of confidence intervals generated by repeated subsample calculations , 1970 .

[11]  L. Gordon.  Efficiency in Subsampling , 1974 .

[12]  L. Gordon,et al.  Completely Separating Groups in Subsampling , 1974 .

[13]  E. Lehmann,et al.  Nonparametrics: Statistical Methods Based on Ranks , 1976 .

[14]  W. R. van Zwet,et al.  Asymptotic Expansions for the Power of Distributionfree Tests in the Two-Sample Problem , 1976 .

[15]  H. Toutenburg,et al.  Lehmann, E. L., Nonparametrics: Statistical Methods Based on Ranks, San Francisco. Holden‐Day, Inc., 1975. 480 S., $ 22.95 . , 1977 .

[16]  J. Bunch,et al.  Updating the singular value decomposition , 1978 .

[17]  J. Bunch,et al.  Rank-one modification of the symmetric eigenproblem , 1978 .

[18]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[19]  B. Efron.  Bootstrap Methods: Another Look at the Jackknife , 1979 .

[20]  J. S. Maritz,et al.  A note on exact robust confidence intervals for location , 1979 .

[21]  J. Friedman,et al.  Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .

[22]  D. Basu.  Randomization Analysis of Experimental Data: The Fisher Randomization Test , 1980 .

[23]  D. Freedman,et al.  Some Asymptotic Theory for the Bootstrap , 1981 .

[24]  J. S. Maritz.  Distribution-Free Statistical Methods , 1981 .

[25]  Paul Klingsberg,et al.  A Gray Code for Compositions , 1982, J. Algorithms.

[26]  W. Krzanowski,et al.  Cross-Validatory Choice of the Number of Components From a Principal Component Analysis , 1982 .

[27]  B. Efron,et al.  The Jackknife: The Bootstrap and Other Resampling Plans. , 1983 .

[28]  M. Pagano,et al.  On Obtaining Permutation Distributions in Polynomial Time , 1983 .

[29]  Dave Witte Morris,et al.  A survey: Hamiltonian cycles in Cayley graphs , 1984, Discret. Math..

[30]  David Tritchler,et al.  On Inverting Permutation Tests , 1984 .

[31]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[32]  B. Efron.  The jackknife, the bootstrap, and other resampling plans , 1987 .

[33]  G. Golub,et al.  On the spectral decomposition of Hermitian matrices modified by low rank perturbations , 1988 .

[34]  P. Hall,et al.  On bootstrap resampling and iteration , 1988 .

[35]  N. J. A. Sloane,et al.  Gray codes for reflection groups , 1989, Graphs Comb..

[36]  D. Cox,et al.  Asymptotic techniques for use in statistics , 1989 .

[37]  W. R. Schucany,et al.  Better nonparametric bootstrap confidence intervals for the correlation coefficient , 1989 .

[38]  D. V. Hinkley,et al.  Balanced design of bootstrap simulations , 1990 .

[39]  William H. Press,et al.  Numerical recipes , 1990 .

[40]  J. Gentle,et al.  Randomization and Monte Carlo Methods in Biology. , 1990 .

[41]  Marcello Pagano,et al.  Efficient Calculation of the Permutation Distribution of Trimmed Means , 1991 .

[42]  N. Fisher,et al.  Bootstrap algorithms for small samples , 1991 .

[43]  P. Hall.  The Bootstrap and Edgeworth Expansion , 1992 .

[44]  Frank Ruskey,et al.  Generating Permutations of a Bag by Interchanges , 1992, Inf. Process. Lett..

[45]  B. Efron.  Jackknife‐After‐Bootstrap Standard Errors and Influence Functions , 1992 .

[46]  R. Tibshirani,et al.  An introduction to the bootstrap , 1993 .

[47]  Joseph P. Romano,et al.  Large Sample Confidence Regions Based on Subsamples under Minimal Assumptions , 1994 .

[48]  E. Rips,et al.  Equidistant Letter Sequences in the Book of Genesis , 1994 .

[49]  Susan Holmes,et al.  Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics , 1995 .