The Diaconis-Sturmfels algorithm and rules of succession
From MaRDI portal
Publication:1275860
DOI10.2307/3318722zbMath0914.60038OpenAlexW2102955045MaRDI QIDQ1275860
Publication date: 9 March 1999
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bj/1174324986
Foundations and philosophical topics in statistics (62A01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Bayesian networks for discrete multivariate data: An algebraic approach to inference ⋮ Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions ⋮ A novel association test for rare variants based on algebraic statistics ⋮ Generating functions for exactp-values of odds ratios in logistic regression ⋮ The largest group of invariance for Markov bases and toric ideals ⋮ A divide-and-conquer algorithm for generating Markov bases of multi-way tables ⋮ A short history of algebraic statistics ⋮ Markov chain Monte Carlo tests for designed experiments ⋮ Distance-reducing Markov bases for sampling from a discrete sample space
