Sampling binary contingency tables with a greedy start
From MaRDI portal
Publication:5901125
DOI10.1145/1109557.1109604zbMath1192.90159OpenAlexW4253338169MaRDI QIDQ5901125
Nayantara Bhatnagar, Ivona Bezáková, Eric Vigoda
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109604
Related Items (6)
Efficient importance sampling for binary contingency tables ⋮ A sequential algorithm for generating random graphs ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities ⋮ Majorization and the number of bipartite graphs for given vertex degrees ⋮ Randomization methods for assessing data analysis results on real‐valued matrices
This page was built for publication: Sampling binary contingency tables with a greedy start
