Open Access
February 2019 Pólya urns with immigration at random times
Erol Peköz, Adrian Röllin, Nathan Ross
Bernoulli 25(1): 189-220 (February 2019). DOI: 10.3150/17-BEJ983

Abstract

We study the number of white balls in a classical Pólya urn model with the additional feature that, at random times, a black ball is added to the urn. The number of draws between these random times are i.i.d. and, under certain moment conditions on the inter-arrival distribution, we characterize the limiting distribution of the (properly scaled) number of white balls as the number of draws goes to infinity. The possible limiting distributions obtained in this way vary considerably depending on the inter-arrival distribution and are difficult to describe explicitly. However, we show that the limits are fixed points of certain probabilistic distributional transformations, and this fact provides a proof of convergence and leads to properties of the limits. The model can alternatively be viewed as a preferential attachment random graph model where added vertices initially have a random number of edges, and from this perspective, our results describe the limit of the degree of a fixed vertex.

Citation

Download Citation

Erol Peköz. Adrian Röllin. Nathan Ross. "Pólya urns with immigration at random times." Bernoulli 25 (1) 189 - 220, February 2019. https://doi.org/10.3150/17-BEJ983

Information

Received: 1 February 2017; Revised: 1 July 2017; Published: February 2019
First available in Project Euclid: 12 December 2018

zbMATH: 07007205
MathSciNet: MR3892317
Digital Object Identifier: 10.3150/17-BEJ983

Keywords: distributional convergence , distributional fixed point equation , Pólya urns , preferential attachment random graph

Rights: Copyright © 2019 Bernoulli Society for Mathematical Statistics and Probability

Vol.25 • No. 1 • February 2019
Back to Top