Markov bases of three-way tables are arbitrarily complicated

Journal of Symbolic Computation

Volumn 41, Issue 2, 2006, Pages 173-181

  De Loera, Jesús A ^a   Onn, Shmuel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Confidentiality of statistical data; Contingency tables; Markov bases; Sampling and random generation; Statistical data security; Transportation polytopes

Indexed keywords

EID: 29744443981     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2005.04.010     Document Type: Article

References (20)

1. S. Aoki A. Takemura Minimal basis for connected Markov chain over 3 × 3 × K contingency tables with fixed two-dimensional marginals Aust. N. Z. J. Stat. 45 2003 229-249
2. L.H. Cox Bounds on entries in 3-dimensional contingency tables. In: Inference Control in Statistical Databases - From Theory to Practice Lecture Notes Comput. Sci. vol. 2316 2002 Springer New York 21-33
3. L.H. Cox On properties of multi-dimensional statistical tables J. Statis. Plann. Inference. 117 2003 251-273
4. Cryan, M., Dyer, M., Goldberg, L.A., Jerrum, M., Martin, R., 2002. Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, FOCS 02. pp. 711-720
5. M. Cryan M. Dyer H. Müller L. Stougie Random walks on the vertices of transportation polytopes with constant number of sources In: Proc. 14th Ann. ACM-SIAM Symp. Disc. Alg., Baltimore, MD 2003 ACM New York 330-339
6. J. De Loera S. Onn The complexity of three-way statistical tables SIAM J. Comput. 33 2004 819-836
7. J. De Loera S. Onn All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables In: Proc. 10th Ann. Math. Prog. Soc. Symp. Integ. Prog. Combin. Optim., Columbia University, New York In: Lec. Not. Comp. Sci. vol. 3064 2004 Springer New York 338-351
8. J. De Loera S. Onn Universal Generator 2004 Available online at http://www.math.ucdavis.edu/~deloera http://ie.technion.ac.il/~onn
9. P. Diaconis A. Gangolli Rectangular arrays with fixed margins In: Discrete Probability and Algorithms (Minneapolis, MN, 1993) In: IMA Vol. Math. App. vol. 72 1995 Springer New York 15-41
10. P. Diaconis B. Sturmfels Algebraic algorithms for sampling from conditional distributions Ann. Statist. 26 1998 363-397
11. A. Dobra Markov bases for decomposable graphical models Bernoulli 9 2003 1093-1108
12. A. Dobra S.E. Fienberg M. Torttini Assessing the risk of disclosure of confidential categorical data In: J.M. Bernardo M.J. Bayarri J.O. Berger A.P. Dawid D. Heckerman A.F.M. Smith M. West (Eds.), Bayesian Statistics vol. 7 2003 Oxford University Press 125-144
13. G.T. Duncan S.E. Fienberg R. Krishnan R. Padman S.F. Roehrig Disclosure limitation methods and information loss for tabular data In: P. Doyle J.I. Land J.M. Theeuwes L.V. Zayatz (Eds.), Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies 2001 North-Holland
14. D. Gusfield A graph theoretic approach to statistical data security SIAM J. Comput. 17 1988 552-571
15. S. Hoşten S. Sullivant Gröbner bases and polyhedral geometry of reducible and cyclic models J. Combin. Theory Ser. A 100 2002 277-301
16. Hoşten, S., Sullivant, S., 2003. Finiteness theorems for Markov bases of hierarchical models, draft
17. R. Irving M.R. Jerrum Three-dimensional statistical data security problems SIAM J. Comput. 23 1994 170-184
18. C.R. Mehta N.R. Patel A network algorithm for performing Fisher's exact test in r × c contingency tables J. Amer. Statist. Assoc. 78 1983 427-434
19. F. Santos B. Sturmfels Higher Lawrence configurations J. Combin. Theory Ser. A 103 2003 151-164
20. U.S. Census Bureau, 2005. American FactFinder. http://factfinder.census.gov/servlet/BasicFactsServlet