You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Random-Allocation and Urn Models
Journal of Applied Probability
Vol. 41, Stochastic Methods and Their Applications (2004), pp. 313-320
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3215985
Page Count: 8
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We review some urn and random-allocation models, mostly using probability generating function (PGF) methods. We begin by formulating a basic problem which can be thought of as either an urn or a random-allocation model; a PGF solution to it is outlined. When the compartments in the latter model are no longer homogeneous, the multivariate PGF can still be derived, though the algebra becomes cumbersome. Some results are given for the case where there are two types of compartment and for the case where there are two types of ball. Some comments are offered on the Frobenius-Harper property of PGFs.
Journal of Applied Probability © 2004 Applied Probability Trust