The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables problem, an important problem in statistics, where the goal is to estimate the number of 0/1 matrices with prescribed row and column sums. We give a family of examples in which the SIS procedure, if run for any subexponential number of trials, will underestimate the number of tables by an exponential factor. This result holds for any of the usual design choices in the SIS algorithm, namely the ordering of the columns and rows. These are apparently the first theoretical results on the efficiency of the SIS algorithm for binary contingency tables. Finally, we present experimental evidence that the SIS algorithm is efficient for row and column sums that are regular. Our work is a first step in determining the class of inputs for which SIS is effective.
Sequential Monte Carlo Markov chain Monte Carlo Graphs with prescribed degree sequence Zero-one table
This is a preview of subscription content, log in to check access.
Bezáková, I., Bhatnagar, N., Vigoda, E.: Sampling binary contingency tables with a greedy start. Random Struct. Algorithms 30(1–2), 168–205 (2007)
Bezáková, I., Sinclair, A., Štefankovič, D., Vigoda, E.: Negative examples for sequential importance sampling of binary contingency tables. Version available on the arXiv at: http://arxiv.org/abs/math/0606650
Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489–522 (2010)
Chen, Y., Diaconis, P., Holmes, S.P., Liu, J.S.: Sequential Monte Carlo methods for statistical analysis of tables. J. Am. Stat. Assoc. 100(469), 109–120 (2005)
De Iorio, M., Griffiths, R.C., Leblois, R., Rousset, F.: Stepwise mutation likelihood computation by sequential importance sampling in subdivided population models. Theor. Popul. Biol. 68, 41–53 (2005)
Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York (2009)
Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. J. Assoc. Comput. Mach. 51(4), 671–697 (2004)
Míguez, J., Djurić, P.M.: Blind equalization by sequential importance sampling. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 845–848 (2002)
Zhang, J.L., Liu, J.S.: A new sequential importance sampling method and its application to the two-dimensional hydrophobic-hydrophilic model. J. Chem. Phys. 117(7), 3492–3498 (2002)