Pages that link to "Item:Q1583095"

The following pages link to Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095):

Displaying 12 items.

• Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← 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)
• Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals (Q1019460) (← 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)
• The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
• Structure and eigenvalues of heat-bath Markov chains (Q2451698) (← links)
• Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
• Markov chain Monte Carlo exact tests for incomplete two-way contingency tables (Q5711982) (← links)
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)