Dynamic Markov Bases

Statistics – Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 4 figures

Scientific paper

We present a computational approach for generating Markov bases for multi-way contin- gency tables whose cells counts might be constrained by fixed marginals and by lower and upper bounds. Our framework includes tables with structural zeros as a particular case. In- stead of computing the entire Markov basis in an initial step, our framework finds sets of local moves that connect each table in the reference set with a set of neighbor tables. We construct a Markov chain on the reference set of tables that requires only a set of local moves at each iteration. The union of these sets of local moves forms a dynamic Markov basis. We illustrate the practicality of our algorithms in the estimation of exact p-values for a three-way table with structural zeros and a sparse eight-way table. Computer code implementing the methods de- scribed in the article as well as the two datasets used in the numerical examples are available as supplemental material.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dynamic Markov Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Markov Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Markov Bases will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-570042

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.