Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This 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

J. Gani
Journal of Applied Probability
Vol. 41, Stochastic Methods and Their Applications (2004), pp. 313-320
Stable URL: http://www.jstor.org/stable/3215985
Page Count: 8
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
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
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
313
    313
  • Thumbnail: Page 
314
    314
  • Thumbnail: Page 
315
    315
  • Thumbnail: Page 
316
    316
  • Thumbnail: Page 
317
    317
  • Thumbnail: Page 
318
    318
  • Thumbnail: Page 
319
    319
  • Thumbnail: Page 
320
    320