Pages that link to "Item:Q5901125"
From MaRDI portal
The following pages link to Sampling binary contingency tables with a greedy start (Q5901125):
Displayed 6 items.
- A sequential algorithm for generating random graphs (Q603928) (← links)
- Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities (Q892799) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- Randomization methods for assessing data analysis results on real‐valued matrices (Q4969690) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)