Related papers: Records in the Infinite Occupancy Scheme
We prove functional limits theorems for the occupation time process of a system of particles moving independently in $R^d$ according to a symmetric $\alpha$-stable L\'evy process, and starting off from an inhomogeneous Poisson point measure…
Consider sequential packing of unit balls in a large cube, as in the Renyi car-parking model, but in any dimension and with Poisson input. We show after suitable rescaling that the spatial distribution of packed balls tends to that of a…
We consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record…
We consider various probabilistic games with piles for one player or two players. In each round of the game, a player randomly chooses to add $a$ or $b$ chips to his pile under the condition that $a$ and $b$ are not necessarily positive. If…
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 regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
A generalisation of quantum contextuality to the case of many indentical particles is presented. The model consists of a finite collection of modes that can be occupied by N particles, either bosons or fermions. Measurement scenarios allow…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
Chain records is a new type of multidimensional record. We discuss how often the chain records are broken when the background sampling is from the unit cube with uniform distribution (or, more generally, from an arbitrary continuous product…
We consider expanding systems with invariant measures that are uniformly expanding everywhere except on a small measure set and show that the limiting statistics of hitting times for zero measure sets are compound Poisson provided the…
Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…
We study the joint asymptotics of forward and backward processes of numbers of non-empty urns in an infinite urn scheme. The probabilities of balls hitting the urns are assumed to satisfy the conditions of regular decrease. We prove weak…
We consider a billiard in the plane with periodic configuration of convex scatterers. This system is recurrent, in the sense that almost every orbit comes back arbitrarily close to the initial point. In this paper we study the time needed…
Interval scheduling is a basic problem in the theory of algorithms and a classical task in combinatorial optimization. We develop a set of techniques for partitioning and grouping jobs based on their starting and ending times, that enable…
Let $\boldsymbol{X}_1,\boldsymbol{X}_2,\dots$ be independent copies of a random vector $\boldsymbol{X}$ with values in $\mathbb{R}^d$ and with a continuous distribution function. The random vector $\boldsymbol{X}_n$ is a complete record, if…
Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…
For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…
The paper considers a queueing system with limited processor sharing. No more than n jobs may be served simultaneously. This system may be used for modeling bandwidth sharing in wireless communication systems and processes of service in…
We consider the occupation area of spherical (fractional) Brownian motion, i.e. the area where the process is positive, and show that it is uniformly distributed. For the proof, we introduce a new simple combinatorial view on occupation…