Counting subsets of contingency tables

DOI10.1007/s00180-013-0442-5zbMath1306.65056OpenAlexW2062550624MaRDI QIDQ2259711

George S. Fishman

Publication date: 5 March 2015

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-013-0442-5

zbMATH Keywords

Markov chain Monte Carlosequential importance samplingHastings-Metropolis sampling

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Monte Carlo methods (65C05) Contingency tables (62H17)

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov bases in algebraic statistics.
• Data. A collection of problems from many fields for the student and research worker
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• Random generation of combinatorial structures from a uniform distribution
• Algebraic algorithms for sampling from conditional distributions
• Negative examples for sequential importance sampling of binary contingency tables
• Efficient importance sampling for binary contingency tables
• Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals
• Markov bases and subbases for bounded contingency tables
• Adaptive simulated annealing: A near-optimal connection between sampling and counting
• Sampling contingency tables
• Sequential Monte Carlo Methods for Dynamic Systems
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: Counting subsets of contingency tables