摘要: I develop a new Markov chain algorithm for sampling from sets of multi-way contingency tables defined by an arbitrary set fixed marginals and lower upper bounds constraints on cell counts. My procedure is called the Bounds Sampling Algorithm (BSA) it relies existence method to calculate entries. BSA accommodates any pattern structural zeros or, more generally, missing cells. investigate validity my approach in several examples, some which have