The following pages link to On sampling with Markov chains (Q4894601):
Displaying 12 items.
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables (Q703540) (← links)
- Ricci curvature of graphs (Q765669) (← links)
- Coupling, spectral gap and related topics. II (Q1375818) (← links)
- Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
- Neumann Cheeger constants on graphs (Q1710251) (← links)
- Sampling contingency tables (Q1713620) (← links)
- Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
- Analysis of a nonreversible Markov chain sampler. (Q1872496) (← links)
- A note on Neumann problems on graphs (Q2159405) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- (Q4506065) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)
