Algebraic algorithms for sampling from conditional distributions

363Citations
Citations of this article
104Readers
Mendeley users who have this article in their library.

Abstract

We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include contingency tables, logistic regression, and spectral analysis of permutation data. The algorithms involve computations in polynomial rings using Gröbner bases.

Cite

CITATION STYLE

APA

Diaconis, P., & Sturmfels, B. (1998). Algebraic algorithms for sampling from conditional distributions. Annals of Statistics, 26(1), 363–397. https://doi.org/10.1214/aos/1030563990

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free