P´olya-Type Urn Models with Multiple Drawings

Authors

  • Hosam Mahmoud
  • Norman Johnson
  • Samuel Kotz
Abstract:

We investigate the distribution, mean value, variance and some limiting properties of an urn model of white and red balls under random multiple drawing (either with or without replacement) when the number of white and red balls added follows a schedule that depends on the number of white balls chosen in each drawing.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

P´olya Urn Models and Connections to Random Trees: A Review

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

full text

Analysis of a generalized Friedman's urn with multiple drawings

We study a generalized Friedman’s urn model with multiple drawings of white and blue balls. After a drawing, the replacement follows a policy of opposite reinforcement. We give the exact expected value and variance of the number of white balls after a number of draws, and determine the structure of the moments. Moreover, we obtain a strong law of large numbers, and a central limit theorem for t...

full text

Designing and Evolving Business Models with URN

The User Requirements Notation (URN) combines goals and scenarios in order to help capture and reason about user requirements prior to detailed design. In terms of application areas, this emerging standard targets reactive systems in general, with a particular emphasis on telecommunications systems and services. However, URN can also be applied to business process modeling. In this paper, we il...

full text

Multicolor urn models with reducible replacement matrices

Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...

full text

On Generalized Pólya Urn Models

We study an urn model introduced in the paper of Chen and Wei [2], where at each discrete time step m balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors, generalizing the well known Pólya-Eggenberger urn model, case m = 1. We provide exact expressions for the expectation and the variance of the number of white b...

full text

Urn Models and Yao's Formula

Yao's formula is one of the basic tools in any situation where one wants to estimate the number of blocks to be read in answer to some query. We show that such situations can be modelized by probabilistic urn models. This allows us to fully characterize the distribution probability of the number of selected blocks under uniformity assumptions, and to consider extensions to non-uniform block pro...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue None

pages  165- 173

publication date 2004-11

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023