Related papers: Maximal Counts in the Stopped Occupancy Problem
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 "double Dixie cup problem" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number $T_{m}(N)$ of coupons that a collector has to buy in order to complete $m$…
We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We…
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…
Viewing stochastic processes through the lens of occupation measures has proved to be a powerful angle of attack for the theoretical and computational analysis of stochastic optimal control problems. We present a simple modification of the…
In this paper, we use techniques of enumerative combinatorics to study the following problem: we count the number of ways to split $n$ balls into nonempty, ordered bins so that the most crowded bin has exactly $k$ balls. We find closed…
We consider a facility location problem, where the objective is to ``disperse'' a number of facilities, i.e., select a given number k of locations from a discrete set of n candidates, such that the average distance between selected…
We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…
We consider a distribution logistics scenario where a shipping operator, managing a limited amount of resources, receives a stream of collection requests, issued by a set of customers along a booking time-horizon, that are referred to a…
The sequential sampling of populations with unequal probabilities and with replacement in a closed population is a recurrent problem in ecology and evolution. Many of these questions can be reformulated as urn problems, often as special…
The paper works out the canonical probability distribution of the occupancy numbers of a bosonic system and shows that canonical typicality applies to the canonical density operator of the occupancy numbers. The result is that, if, as it is…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
We study high-dimensional stochastic optimal control problems in which many agents cooperate to minimize a convex cost functional. We consider both the full-information problem, in which each agent observes the states of all other agents,…
We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…
The functional characterization of a measure, an essential but delicate aspect of Stein's method, is shown to be accessible for stable probability distributions on convex cones. This notion encompasses the usual stable distributions…
We consider the extremal pointset configuration problem of maximizing a kernel-based energy subject to the geometric constraints that the points are contained in a fixed set, the pairwise distances are bounded below, and that every closed…
We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…
This work proposes a method to compute the maximum value obtained by a state function along trajectories of a Delay Differential Equation (DDE). An example of this task is finding the maximum number of infected people in an epidemic model…