The Diaconis-Sturmfels algorithm and rules of succession
Dinwoodie, Ian H.
Bernoulli, Tome 4 (1998) no. 1, p. 401-410 / Harvested from Project Euclid
A multinomial rule of succession is derived with conditioning on partial past information. The probability computation is done with a Markov chain on tables of non-negative integers using Gröbner bases as described by Diaconis and Sturmfels.
Publié le : 1998-09-14
Classification:  Gröbner basis,  Laplace,  Markov chain,  succession probability
@article{1174324986,
     author = {Dinwoodie, Ian H.},
     title = {The Diaconis-Sturmfels algorithm and rules of succession},
     journal = {Bernoulli},
     volume = {4},
     number = {1},
     year = {1998},
     pages = { 401-410},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1174324986}
}
Dinwoodie, Ian H. The Diaconis-Sturmfels algorithm and rules of succession. Bernoulli, Tome 4 (1998) no. 1, pp.  401-410. http://gdmltest.u-ga.fr/item/1174324986/