The following pages link to Sampling contingency tables (Q4345364):
Displaying 36 items.
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- Exact sampling and counting for fixed-margin matrices (Q366999) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables (Q703540) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- On the number of faces of certain transportation polytopes (Q1580679) (← links)
- Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
- Asymptotic enumeration of integer matrices with large equal row and column sums (Q1945291) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- Counting subsets of contingency tables (Q2259711) (← links)
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces (Q2447735) (← links)
- Statistical evidence in contingency tables analysis (Q2474374) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients (Q2509196) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes (Q3613885) (← links)
- A Nonparametric Test for Symmetry Based on Freeman and Halton's Ideas on Contingency Tables (Q3652730) (← links)
- Fast Unimodular Counting (Q4500424) (← links)
- Random generation of 2�n contingency tables (Q4705324) (← links)
- Improved bounds for sampling contingency tables (Q4803313) (← links)
- Characterizing optimal sampling of binary contingency tables via the configuration model (Q4909199) (← links)
- Uniformly Generating Origin Destination Tables (Q4915236) (← links)
- What Does a Random Contingency Table Look Like? (Q4933598) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)
- Sampling binary contingency tables with a greedy start (Q5898351) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)
- Linear-time uniform generation of random sparse contingency tables with specified marginals (Q6590451) (← links)
