相关论文: Functional limit theorems for the number of occupi…
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…
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…
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…
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…
The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1...W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the…
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…
The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1... W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the…
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…
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…
A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…
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…
Under an appropriate regular variation condition, the affinely normalized partial sums of a sequence of independent and identically distributed random variables converges weakly to a non-Gaussian stable random variable. A functional version…
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
In this paper, we prove functional limit theorems for P\'olya urn processes whose number of draws and initial number of balls tend to infinity together. This is motivated by recent work of Borovkov [5], where they prove a functional limit…
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
Consider a weighted branching process generated by the lengths of intervals obtained by stick-breaking of unit length (a.k.a. the residual allocation model) and associate with each weight a `box'. Given the weights `balls' are thrown…
The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the…
We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability $1/2$, respectively. The theorem entails that the law of every one-dimensional regular…
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…