Related papers: On nested infinite occupancy scheme in random envi…
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…
This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…
Consider a balls-in-bins process in which each new ball goes into a given bin with probability proportional to f(n), where n is the number of balls currently in the bin and f is a fixed positive function. It is known that these so-called…
We give a formulation of the single particle occupation probabilities for a system of identical particles obeying fractional exclusion statistics of Haldane. We first derive a set of constraints using an exactly solvable model which…
Consider the following process whereby $n$ balls are distributed into $k$ bins. Repeatedly, a ball is removed from a non-empty bin chosen uniformly at random. The process ends when a single non-empty bin remains. Will Ma…
Using a central limit theorem for arrays of interacting quantum systems, we give analytical expressions for the density of states and the partition function at finite temperature of such a system, which are valid in the limit of infinite…
We examine the negative occupancy distribution and the coupon-collector distribution, both of which arise as distributions relating to hitting times in the extended occupancy problem. These distributions constitute a full solution to a…
We consider a deposition model in which balls rain down at random towards a 2-dimensional surface, roll downwards over existing adsorbed balls, are adsorbed if they reach the surface, and discarded if not. We prove a spatial law of large…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
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…
We consider an effective kinetic description for quantum many-body systems, which is not based on a weak-coupling or diluteness expansion. Instead, it employs an expansion in the number of field components N of the underlying scalar quantum…
We consider a branching system consisting of particles moving according to a Markov family in $\Rd$ and undergoing subcritical branching with a constant rate $V>0$. New particles immigrate to the system according to homogeneous space-time…
We introduce a minimal model of multilevel selection on structured populations, considering the interplay between game theory and population dynamics. Through a bottleneck process, finite groups are formed with cooperators and defectors…
Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is…
A broad class of blocked or jammed configurations of particles on the one-dimensional lattice can be characterized in terms of local rules involving only the lengths of clusters of particles (occupied sites) and of holes (empty sites).…
We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two bins uniformly at random and place a ball in the least loaded bin. It is…
We establish a functional limit theorem for the joint-law of occupations near and away from indifferent fixed points of interval maps, and of waits for the occupations away from these points, in the sense of strong distributional…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…