Estimating the number of zero-one multi-way tables via sequential importance sampling

DOI10.1007/S10463-012-0392-7MaRDI QIDQ379986zbMATH OpenOpenAlexFDO

Authors Jing Xi, Ruriko Yoshida, David C. Haws

Publication date 11 November 2013

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.5939

zbMATH Keywords

counting problemcategorical data analysisconditional Poissonno three-way interaction

Mathematics Subject Classification ID

Contingency tables (62H17)

Abstract: In 2005, Chen et al introduced a sequential importance sampling (SIS) procedure to analyze zero-one two-way tables with given fixed marginal sums (row and column sums) via the conditional Poisson (CP) distribution. They showed that compared with Monte Carlo Markov chain (MCMC)-based approaches, their importance sampling method is more efficient in terms of running time and also provides an easy and accurate estimate of the total number of contingency tables with fixed marginal sums. In this paper we extend their result to zero-one multi-way ($d$-way, $dgeq2$) contingency tables under the no $d$-way interaction model, i.e., with fixed $d-1$ marginal sums. Also we show by simulations that the SIS procedure with CP distribution to estimate the number of zero-one three-way tables under the no three-way interaction model given marginal sums works very well even with some rejections. We also applied our method to Samson's monks' data set. We end with further questions on the SIS procedure on zero-one multi-way tables.

Recommendations

• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Sequential importance sampling for multiway tables
• Efficient importance sampling for binary contingency tables

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• Enumeration and simulation methods for 0-1 matrices with given marginals
• Fast perfect sampling from linear extensions
• Polynomials for classification trees and applications
• Sampling large tables with constraints
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Sequential importance sampling for multiway tables

Cited in

(3)

• Counting subsets of contingency tables
• Sequential importance sampling for multiway tables
• Asymptotic Enumeration of Hypergraphs by Degree Sequence

Describes a project that uses

Uses Software

• R
• LattE

This page was built for publication: Estimating the number of zero-one multi-way tables via sequential importance sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q379986)