Skip to main content

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 37))

  • 908 Accesses

Abstract

In many experimental situations, subjects are randomly allocated to treatment and control groups. Measurements are then made on the two groups to ascertain if there is in fact a statistically significant treatment effect. Exact calculation of the associated randomization distribution theoretically involves looking at all possible partitions of the original measurements into two appropriately-sized groups. Computing every possible partition is computationally wasteful, so our objective is to systematically enumerate partitions starting from the tail of the randomization distribution. A new enumeration scheme that only examines potentially worthwhile partitions is described, based on an underlying partial order. Numerical results show that the proposed method runs quickly compared to complete enumeration, and its effectiveness can be enhanced by use of certain pruning rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

    MATH  Google Scholar 

  2. P. Diaconis and S. Holmes, Gray codes Tor randomization procedures, Statistics and Computing 4 (1994), 287–302.

    Article  Google Scholar 

  3. E. S. Edgington, Randomization Tests, 3rd ed., Marcel Dekker, New York, 1995.

    MATH  Google Scholar 

  4. R. A. Fisher, Design of Experiments, Oliver and Boyd, Edinburgh, 1935.

    Google Scholar 

  5. P. Good, Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses, 2nd ed., Springer-Verlag, New York, 2000.

    MATH  Google Scholar 

  6. R. P. Grimaldi, Discrete and Combinatorial Mathematics, 5th ed., Addison-Wesley, Reading, MA, 2004.

    Google Scholar 

  7. J. Ludbrook and H. Dudley, Why permutation tests are superior to t and F tests in biomedical research, The American Statistician 52 (1998), 127–132.

    Article  Google Scholar 

  8. B. F. J. Manly, Randomization, Bootstrap and Monte Carlo Methods in Biology, 2nd ed., CRC Press, Boca Raton, FL, 1997.

    MATH  Google Scholar 

  9. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, 1979.

    MATH  Google Scholar 

  10. C. R. Mehta, N. R. Patel and L. J. Wei, Constructing exact significance tests with restricted randomization rules, Biometrika 75 (1988), 295–302

    Article  MATH  Google Scholar 

  11. M. Pagano and D. Tritchler, On obtaining permutation distributions in polynomial time, Journal of the American Statistical Association 78 (1983), 435–440.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. J. G. Pitman, Significance tests which may be applied to samples from any populations, Journal of the Royal Statistical Society, Series B, 4 (1937), 119–130.

    Google Scholar 

  13. StatXact software, Cytel Corp., Cambridge, MA. http: //www.cytel.com/

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Coffin, M.A., Jarvis, J.P., Shier, D.R. (2007). An Efficient Enumeration Algorithm for the Two-Sample Randomization Distribution. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds) Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-48793-9_5

Download citation

Publish with us

Policies and ethics