polyap

Consider an urn containing a finite set of values.
 An item is selected at random from the urn. Then it is returned
 to the urn along with another item with the same value. Next
 a value is selected at random from the reconstituted urn
 and it and a copy our returned to the urn. This process is
 repeated until \(k\) additional items have been added to the
 original urn. The original composition of the urn along with the selected
 values, in order, are returned.

survey

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).

Glen Meeden

polyapost

Simulating from the Polya Posterior

Radu Lazar

polyap function

<dl><dt>ysamp</dt>
<dd>A vector of real numbers which make up the urn.</dd><dt>k</dt>
<dd>A positive integer which specifies the number of items
 added to the original composition of the urn.</dd></dl>

Arguments

Polya Sampling from an Urn — polyap

<dl>

<dt>ysamp</dt>
<dd>A vector of real numbers which make up the urn.</dd>

<dt>k</dt>
<dd>A positive integer which specifies the number of items
 added to the original composition of the urn.</dd>

</dl>

polyap: Polya Sampling from an Urn

Description

Usage

Value

Arguments

Examples