Simulate via Markov chain Monte Carlo (hit-and-run algorithm) a Dirichlet distribution conditioned to satisfy a finite set of linear equality and inequality constraints (hence to lie in a convex polytope that is a subset of the unit simplex).
|Author||Glen Meeden <firstname.lastname@example.org> and Radu Lazar <email@example.com> and Charles J. Geyer <firstname.lastname@example.org>|
|Date of publication||2017-03-15 05:25:34|
|Maintainer||Glen Meeden <email@example.com>|
|License||GPL (>= 2)|
constrppmn: Estimating a population mean using the constrained Polya...
constrppprob: Dependent sampling from the uniform distribution on a...
feasible: Feasible solution for a probability distribution which must...
hitrun: Hit and Run Algorithm for Constrained Dirichlet Distribution
polyap: Polya sampling from an urn
wtpolyap: Polya sampling from an urn with possibly unequal weights