Efficient importance sampling for binary contingency tables

Annals of Applied Probability

Volumn 19, Issue 3, 2009, Pages 949-982

  Blanchet, Jose H ^a  

^a 340 S W Mudd Building ^*  (United States)

Author keywords

Approximate counting; Binary tables; Bipartate graphs; Changes of measure; Doob h transform; Importance sampling; Markov processes; Rare event simulation

Indexed keywords

EID: 69149110741     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/08-AAP558     Document Type: Article

References (28)

1. Asmussen, S. and Glynn, P. W. (2007). Stochastic Simulation: Algorithms and Analysis. Stochastic Modelling and Applied Probability 57. Springer, New York. MR2331321
2. Bayati, M., Kim, J. and Saberi, A. (2007). A Sequential Algorithm for Generating Random Graphs. Lecture Notes in Computer Science 4627. 326-340. Springer, Berlin.
3. Békéssy, A., Békéssy, P. and Komlós, J. (1972). Asymptotic enumeration of regular matrices. Studia Sci. Math. Hungar. 7 343-353. MR0335342
4. Bezáková, I., Bhatnagar, N. and Vigoda, E. (2006). Sampling binary contingency tables with a greedy start. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms 414-423. ACM, New York. MR2368838
5. Bezáková, I., Sinclair, A., Štefankovič, D. and Vigoda, E. (2007). Negative examples for sequential importance sampling of binary contingency tables. In Algorithms-ESA 2006. Lecture Notes in Computer Science 4168 136-147. Springer, Berlin. MR2347138
6. Blanchet, J. and Glynn, P. (2008). Efficient rare-event simulation for the maximum of heavytailed random walks. Ann. Appl. Probab. 18 1351-1378. MR2434174
7. Blanchet, J. and Liu, J. C. (2008). State-dependent importance sampling for regularly varying random walks. Adv. in Appl. Probab. 40 1104-1128.
8. Blitzstein, J. and Diaconis, P. (2008). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Preprint.
9. Botev, Z. I. and Kroese, D. P. (2008). Non-asymptotic bandwidth selection for density estimation of discrete data. Methodol. Comput. Appl. Probab. 10 435-451. MR2415127
10. Bucklew, J. A. (2004). Introduction to Rare Event Simulation. Springer, New York. MR2045385
11. Chen, S. X. and Liu, J. S. (1997). Statistical applications of the Poisson-binomial and conditional Bernoulli distributions. Statist. Sinica 7 875-892. MR1488647
12. Chen, X.-H., Dempster, A. P. and Liu, J. S. (1994). Weighted finite population sampling to maximize entropy. Biometrika 81 457-469. MR1311090
13. Chen, Y., Diaconis, P., Holmes, S. P. and Liu, J. S. (2005). Sequential Monte Carlo methods for statistical analysis of tables. J. Amer. Statist. Assoc. 100 109-120. MR2156822 (Pubitemid 40366822)
14. Doob, J. L. (1957). Conditional Brownian motion and the boundary limits of harmonic functions. Bull. Soc. Math. France 85 431-458. MR0109961
15. Glynn, P. W. and Iglehart, D. L. (1989). Importance sampling for stochastic simulations. Management Sci. 35 1367-1392. MR1024494
16. Greenhill, C., McKay, B. D. and Wang, X. (2006). Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Combin. Theory Ser. A 113 291-324. MR2199276
17. Jerrum, M. (2003). Counting, Sampling and Integrating: Algorithms and Complexity. Birkhäuser, Basel. MR1960003
18. Juneja, S. and Shahabuddin, P. (2006). Rare event simulation techniques: An introduction and recent advances. In Handbook on Simulation (S. Henderson and B. Nelson, eds.) 291-350. Elsevier, Amsterdam.
19. Kannan, R., Tetali, P. and Vempala, S. (1997). Simple Markov-chain algorithms for generating bipartite graphs and tournaments (extended abstract). In Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997) 193-200. ACM, New York. MR1447665
20. Kim, J. H. and Vu, V. H. (2003). Generating random regular graphs. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing 213-222. ACM, New York. MR2121044
21. L'Ecuyer, P., Blanchet, J., Glynn, P. and Tuffin, B. (2008). Efficient rare-event simulation for the maximum of heavy-tailed random walks. Ann. Appl. Probab. 18 1351-1378. MR2434174
22. Liu, J. S. (2001). Monte Carlo Strategies in Scientific Computing. Springer, New York. MR1842342
23. McKay, B. D. (1984). Asymptotics for 0-1 matrices with prescribed line sums. In Enumeration and Design (Waterloo, Ont., 1982) 225-238. Academic Press, Toronto, ON. MR782316
24. Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London. MR1287609
25. Mitzenmacher, M. and Upfal, E. (2005). Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, Cambridge. MR2144605
26. Rubinstein, R. Y. (2007). How many needles are in a hay stack or how to solve fast #P-complete counting problems. Methodol. Comput. Appl. Probab. 11 5-49.
27. Sinclair, A. (1993). Algorithms for Random Generation and Counting. Birkhäuser Boston, Boston, MA. MR1201590
28. Valiant, L. G. (1979). The complexity of computing the permanent. Theoret. Comput. Sci. 8 189-201. MR526203