Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-11T02:42:44.449Z Has data issue: false hasContentIssue false

Random-allocation and urn models

Published online by Cambridge University Press:  14 July 2016

J. Gani*
Affiliation:
Centre for Mathematics and Its Applications, Mathematical Sciences Institute, Australian National University, Canberra, ACT 0200, Australia. Email address: gani@maths.anu.edu.au

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.

Information

Type
Part 6. Stochastic processes
Copyright
Copyright © Applied Probability Trust 2004 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable