Related papers: On intermediate levels of nested occupancy scheme …
A nested occupancy scheme in random environment is a generalization of the classical Karlin infinite balls-in-boxes occupancy scheme in random environment (with random probabilities). Unlike the Karlin scheme in which the collection of…
We investigate a nested balls-in-boxes scheme in a random environment. The boxes follow a nested hierarchy, with infinitely many boxes in each level, and the hitting probabilities of boxes are random and obtained by iterated fragmentation…
Consider a weighted branching process generated by a point process on $[0,1]$, whose atoms sum up to one. Then the weights of all individuals in any given generation sum up to one, as well. We define a nested occupancy scheme in random…
A nested Karlin's occupancy scheme is a symbiosis of classical Karlin's balls-in-boxes scheme and a weighted branching process. To define it, imagine a deterministic weighted branching process in which weights of the first generation…
Let $(p_k)_{k\in\mathbb{N}}$ be a discrete probability distribution for which the counting function $x\mapsto \#\{k\in\mathbb{N}: p_k\geq 1/x\}$ belongs to the de Haan class $\Pi$. Consider a deterministic weighted branching process…
We consider an infinite balls-in-boxes occupancy scheme with boxes organised in nested hierarchy, and random probabilities of boxes defined in terms of iterated fragmentation of a unit mass. We obtain a multivariate functional limit theorem…
The Bernoulli sieve is a version of the classical `balls-in-boxes' occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative renewal process, also known as the residual allocation model or…
We consider the connections among `clumped' residual allocation models (RAMs), a general class of stick-breaking processes including Dirichlet processes, and the occupation laws of certain discrete space time-inhomogeneous Markov chains…
The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or…
We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability $p_j$ of hitting box $j$. Each time a box receives its first ball we speak of a record and, more generally, call an…
The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which $n$ balls are thrown independently into boxes $1,2,...$, with probability $p_j$ of hitting the box $j$, where $p_1\geq p_2\geq...>0$ and…
An occupancy problem with an infinite number of bins and a random probability vector for the locations of the balls is considered. The respective sizes of bins are related to the split times of a Yule process. The asymptotic behavior of the…
In the Karlin infinite occupancy scheme, balls are thrown independently into an infinite array of boxes $1$, $2,\ldots$, with probability $p_k$ of hitting the box $k$. For $j,n\in\mathbb{N}$, denote by $\mathcal{K}^*_j(n)$ the number of…
In the classical occupancy scheme, one considers a fixed discrete probability measure ${\bf p}=(p_i: {i\in{\cal I}})$ and throws balls independently at random in boxes labeled by ${\cal I}$, such that $p_i$ is the probability that a given…
The paper concerns the classical occupancy scheme with infinitely many boxes. We establish approximations to the distributions of the number of occupied boxes, and of the number of boxes containing exactly r balls, within the family of…
The classical and extended occupancy distributions are useful for examining the number of occupied bins in problems involving random allocation of balls to bins. We examine the extended occupancy problem by framing it as a Markov chain and…
Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…
We consider an occupancy scheme in which "balls" are identified with $n$ points sampled from the standard exponential distribution, while the role of "boxes" is played by the spacings induced by an independent random walk with positive and…
We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collectors and dixie cup problems. We show that as the number of…
Consider a general branching process, a.k.a. Crump-Mode-Jagers process, generated by a perturbed random walk $\eta_1$, $\xi_1+\eta_2$, $\xi_1+\xi_2+\eta_3,\ldots$. Here, $(\xi_1,\eta_1)$, $(\xi_2, \eta_2),\ldots$ are independent identically…