Sampling contingency tables

DOI10.1016/j.akcej.2017.10.001zbMath1440.62042OpenAlexW2765915582MaRDI QIDQ1713620

Tariq A. Chishti, Koko K. Kayibi, Shariefuddin Pirzada

Publication date: 25 January 2019

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.10.001

zbMATH Keywords

samplingmixing time of Markov chainscanonical path

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Contingency tables (62H17) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Related Items (3)

GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST ⋮ T-tetrominoes Tiling's Markov chain mixes fast ⋮ Rejection sampling of bipartite graphs with given degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• Matrices of zeros and ones with fixed row and column sum vectors
• Approximating the Permanent
• An Application of Markov Chain Monte Carlo to Community Ecology
• Counting the Number of r × c Contingency Tables with Fixed Margins
• On sampling with Markov chains
• Sampling Regular Graphs and a Peer-to-Peer Network
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: Sampling contingency tables