Minimal Basis for a Connected Markov Chain over 3 � 3 �"K" Contingency Tables with Fixed Two-Dimensional Marginals
This paper considers a connected Markov chain for sampling 3 � 3 �"K" contingency tables having fixed two-dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three-factor interactions. A Markov chain algorithm is a valuable tool for evaluating "P"-values, especially for sparse datasets where large-sample theory does not work well. To construct a connected Markov chain over high-dimensional contingency tables with fixed marginals, algebraic algorithms have been proposed. These algorithms involve computations in polynomial rings using Gröbner bases. However, algorithms based on Gröbner bases do not incorporate symmetry among variables and are very time-consuming when the contingency tables are large. We construct a minimal basis for a connected Markov chain over 3 � 3 �"K" contingency tables. The minimal basis is unique. Some numerical examples illustrate the practicality of our algorithms. Copyright 2003 Australian Statistical Publishing Association Inc..
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 45 (2003)
Issue (Month): 2 (06)
|Contact details of provider:|| Web page: http://www.blackwellpublishing.com/journal.asp?ref=1369-1473|
|Order Information:||Web: http://www.blackwellpublishing.com/subs.asp?ref=1369-1473|
When requesting a correction, please mention this item's handle: RePEc:bla:anzsta:v:45:y:2003:i:2:p:229-249. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.