Random Sampling of Contingency Tables via Probabilistic Divide-and-Conquer
Abstract
We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced probabilistic divide-and-conquer technique. A simple exact sampling algorithm is presented for 2× n tables, as well as a generalization where each entry of the table has a specified marginal distribution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.