AbstractIn this paper the concept of Poisson randomization is studied as given in [1, 2] and analogous formulae for the generalized process are derived. The generalization regards occupancy problems where different ball types are considered such that each type has an associated probability distribution of urn occupancy. Theorems are given for formulae to calculate probabilities of events and the distribution and moments of waiting time random variables. Finally, the theory is illustrated with examples
AbstractIn the classical occupancy scheme, one considers a fixed discrete probability measure p=(pi:...
Suppose that an urn contains m distinguishable balls, and that these balls are sampled (with replace...
AbstractLet z(t) ∈ Rn be a generalized Poisson process with parameter λ and let A: Rn → Rn be a line...
AbstractIn this paper the concept of Poisson randomization is studied as given in [1, 2] and analogo...
This thesis provides a general methodology for classifying and describing many combinatoric problems...
We study the classical occupancy problem from the viewpoint of its embedding Markov chain. We derive...
Abstract—Duals of probability distributions on continuous (R) domains exist on discrete (Z) domains....
This dissertation consists of a series of four papers, each appearing as a separate chapter. In the ...
An occupancy problem with an infinite number of bins and a random probability vector for the locatio...
We review some urn and random-allocation models, mostly using probability generating function (PGF) ...
We examine the discrete distributional form that arises from the "classical occupancy problem," whic...
Periodic random environments and mechanisms of their effect on imbedded random variables are discuss...
A familiar relation links the densities that result for the intersection of a convex body and straig...
In the classical occupancy scheme, one considers a fixed discrete probability measure ${\bf p}=(p_i:...
Neste trabalho é apresentado o processo de Poisson, através de exemplos existentes e identificados n...
AbstractIn the classical occupancy scheme, one considers a fixed discrete probability measure p=(pi:...
Suppose that an urn contains m distinguishable balls, and that these balls are sampled (with replace...
AbstractLet z(t) ∈ Rn be a generalized Poisson process with parameter λ and let A: Rn → Rn be a line...
AbstractIn this paper the concept of Poisson randomization is studied as given in [1, 2] and analogo...
This thesis provides a general methodology for classifying and describing many combinatoric problems...
We study the classical occupancy problem from the viewpoint of its embedding Markov chain. We derive...
Abstract—Duals of probability distributions on continuous (R) domains exist on discrete (Z) domains....
This dissertation consists of a series of four papers, each appearing as a separate chapter. In the ...
An occupancy problem with an infinite number of bins and a random probability vector for the locatio...
We review some urn and random-allocation models, mostly using probability generating function (PGF) ...
We examine the discrete distributional form that arises from the "classical occupancy problem," whic...
Periodic random environments and mechanisms of their effect on imbedded random variables are discuss...
A familiar relation links the densities that result for the intersection of a convex body and straig...
In the classical occupancy scheme, one considers a fixed discrete probability measure ${\bf p}=(p_i:...
Neste trabalho é apresentado o processo de Poisson, através de exemplos existentes e identificados n...
AbstractIn the classical occupancy scheme, one considers a fixed discrete probability measure p=(pi:...
Suppose that an urn contains m distinguishable balls, and that these balls are sampled (with replace...
AbstractLet z(t) ∈ Rn be a generalized Poisson process with parameter λ and let A: Rn → Rn be a line...