Markov-chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations
DOI10.1080/15598608.2015.1067172zbMath1420.62334arXiv1502.02323OpenAlexW3099634820MaRDI QIDQ2323150
Satoshi Aoki, Takayuki Hibi, Hidefumi Ohsugi
Publication date: 30 August 2019
Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.02323
root systemsMarkov basesBox-Behnken designscentrally symmetric configurationsMarkov-chain Monte Carlo methods
Sampling theory, sample surveys (62D05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Factorial statistical designs (62K15) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals
- Markov bases in algebraic statistics.
- Centrally symmetric configurations of order polytopes
- Markov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections
- Gröbner bases of nested configurations
- Markov chain Monte Carlo tests for designed experiments
- Algebraic algorithms for sampling from conditional distributions
- Sequential importance sampling for multiway tables
- Quadratic initial ideals of root systems
- Gröbner Bases
- Root Polytopes and Growth Series of Root Lattices
- Centrally Symmetric Configurations of Integer Matrices
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: Markov-chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations