首页> 外文期刊>Computational statistics >Counting subsets of contingency tables
【24h】

Counting subsets of contingency tables

机译:Counting subsets of contingency tables

获取原文
获取原文并翻译 | 示例
           

摘要

We describe multistage Markov chain Monte Carlo (MSMCMC) procedures which, in addition to estimating the total number of contingency tables with given positive row and column sums, estimate the number, Q, and the proportion, P, of those tables that satisfy an additional, possibly, nonlinear constraint. Three Options, A, B, and C, are studied. Options A and B exploit locally optimal statistical properties whereas judicious assignment of a particular parameter of Option C allows estimation with approximately minimal standard error. Ten examples of varying dimensions and total entries illustrate and compare the procedures, where Q and P denote the number and proportion of chi-squared statistics less than a given value. For both small and large dimensional tables, the comparisons favorOptionsAandBfor moderate P and Option C for small P. Additional comparison with sequential importance sampling estimates favors the latter for small dimensional tables and moderate P but favors Option C for large dimensional tables for both small and moderate P. The proposed options extend an earlier MSMCMC technique for estimating total count and, in principle, can be further extended to incorporate additional constraints.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号