Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals
From MaRDI portal
Publication:394788
DOI10.1016/j.jspi.2013.06.009zbMath1279.62159arXiv1302.2882OpenAlexW2963729569MaRDI QIDQ394788
Hidefumi Ohsugi, Satoshi Aoki, Takayuki Hibi
Publication date: 27 January 2014
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2882
Applications of graph theory (05C90) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Factorial statistical designs (62K15) Markov processes (60J99)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov bases in algebraic statistics.
- Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics
- Toric geometry of cuts and splits
- Properties of cut ideals associated to ring graphs
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs
- Markov chain Monte Carlo tests for designed experiments
- Confounding revisited with commutative computational algebra
- Markov bases for decomposable graphical models
- Classification of two-level factorial fractions
- Algebraic algorithms for sampling from conditional distributions
- Generalised confounding with Grobner bases
- Extremal graphs without three‐cycles or four‐cycles
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals