Pages that link to "Item:Q5898351"
From MaRDI portal
The following pages link to Sampling binary contingency tables with a greedy start (Q5898351):
Displayed 13 items.
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- Sampling hypergraphs with given degrees (Q1981695) (← 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)
- Monte Carlo algorithms for computing \(\alpha \)-permanents (Q2631360) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- Characterizing optimal sampling of binary contingency tables via the configuration model (Q4909199) (← 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)
- Approximately Counting Embeddings into Random Graphs (Q5891884) (← links)