Markov chains on the reference set of contingency tables with upper bounds

zbMATH Open1202.62077MaRDI QIDQ612840FDOQ612840

Fabio Rapallo, Maria Piera Rogantin

Publication date: 2 January 2011

Published in: Metron (Search for Journal in Brave)

zbMATH Keywords

Metropolis-Hastings algorithmLawrence liftingMarkov basesSimulation.

Mathematics Subject Classification ID

Contingency tables (62H17) Markov processes (60J99)

Cited In (4)

• A characterization of saturated designs for factorial experiments
• Markov bases and subbases for bounded contingency tables
• Connecting tables with zero-one entries by a subset of a Markov basis
• Two-factor saturated designs: cycles, Gini index, and state polytopes

Uses Software

• CoCoA
• 4ti2

This page was built for publication: Markov chains on the reference set of contingency tables with upper bounds

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