Pages that link to "Item:Q3427745"

The following pages link to Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows (Q3427745):

Displaying 19 items.

• 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)
• 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)
• Hit and run as a unifying device (Q2197359) (← links)
• Heat-bath random walks with Markov bases (Q2407392) (← links)
• Structure and eigenvalues of heat-bath Markov chains (Q2451698) (← links)
• Markov bases of three-way tables are arbitrarily complicated (Q2457324) (← links)
• Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← 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)
• New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
• What Does a Random Contingency Table Look Like? (Q4933598) (← links)
• Power analysis of independence testing for three-way contingency tables of small sizes (Q5036344) (← links)
• Some contributions to practice of 2 × 2 contingency tables (Q5036617) (← links)
• A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
• On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)