Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Perfect sampling algorithm for small m×n contingency tables

  • Published:
Statistics and Computing Aims and scope Submit manuscript

Abstract

A Markov chain is proposed that uses coupling from the past sampling algorithm for sampling m×n contingency tables. This method is an extension of the one proposed by Kijima and Matsui (Rand. Struct. Alg., 29:243–256, 2006). It is not polynomial, as it is based upon a recursion, and includes a rejection phase but can be used for practical purposes on small contingency tables as illustrated in a classical 4×4 example.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Chen, Y., Diaconis, P., Holmes, S., Liu, J.S.: Sequential Monte Carlo methods for statistical analysis of tables. J. Am. Stat. Assoc. 100, 109–120 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Cryan, M., Dyer, M., Goldberg, L.A., Jerrum, M., Martin, R.: Rapidly mixing Markov chains for sampling contingency tables with constant number of rows. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS 2002), pp. 711–720 (2002)

  • Diaconis, P., Efron, B.: Testing for independence in a two-way table: New interpretations of the chi-square statistic (with discussion). Ann. Stat. 13, 845–913 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  • Diaconis, P., Saloff-Coste, L.: Random walk on contingency tables with fixed row and column sums. Technical report, Department of Mathematics, Harvard University (1995)

  • Fisher, R.A.: The logic of inductive inference (with discussion). J. R. Stat. Soc. 98, 39–54 (1935)

    Article  Google Scholar 

  • Kijima, S., Matsui, T.: Polynomial time perfect sampling algorithm for two-rowed contingency tables. Rand. Struct. Algorithms 29, 243–256 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Propp, J., Wilson, D.: How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Rand. Struct. Algorithms 9, 223–252 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  • Snee, R.D.: Graphical display of two-way contingency tables. Am. Stat. 38, 9–12 (1974)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Bioinformatique et Génomique Intégrative, Institut de Génétique et de Biologie Moléculaire et Cellulaire, 1, rue Laurent Fries, 67404, Illkirch Cedex, France

    Nicolas Wicker

Authors
  1. Nicolas Wicker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Wicker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wicker, N. Perfect sampling algorithm for small m×n contingency tables. Stat Comput 20, 57–61 (2010). https://doi.org/10.1007/s11222-009-9115-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11222-009-9115-1

Keywords

Search

Navigation