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

DOI10.1007/S10463-012-0392-7zbMATH Open1329.62268arXiv1108.5939OpenAlexW2115791777MaRDI QIDQ379986FDOQ379986

David C. Haws, Ruriko Yoshida, Jing Xi

Publication date: 11 November 2013

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

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.

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)

Cites Work

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

Cited In (2)

• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Negative examples for sequential importance sampling of binary contingency tables

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)