English
Related papers

Related papers: Limit theorems in the extended coupon collector's …

200 papers

We investigate the implementation of reduced-form allocation probabilities in a two-person bargaining problem without side payments, where the agents have to select one alternative from a finite set of social alternatives. We provide a…

Theoretical Economics · Economics 2022-02-23 Xu Lang

A reduction of a source distribution is a collection of smaller sized distributions that are collectively equivalent to the source distribution with respect to the property of decomposability. That is, an arbitrary language is decomposable…

Systems and Control · Computer Science 2018-03-30 Liyong Lin , Tomáš Masopust , W. Murray Wonham , Rong Su

Let $\boxplus$, $\boxtimes$ and $\uplus$ be the free additive, free multiplicative, and boolean additive convolutions, respectively. For a probability measure $\mu$ on $[0,\infty)$ with finite second moment, we find the scaling limit of…

Probability · Mathematics 2013-03-22 Noriyoshi Sakuma , Hiroaki Yoshida

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

Combinatorics · Mathematics 2025-09-09 Matěj Trödler , Jan Volec , Jan Vybíral

When split conformal prediction operates in batch mode with exchangeable data, we determine the exact distribution of the empirical coverage of prediction sets produced for a finite batch of future observables, as well as the exact…

Statistics Theory · Mathematics 2025-01-23 Paulo C. Marques F

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

Data Structures and Algorithms · Computer Science 2020-02-10 Mario Pennacchioni , Emanuele Munarini , Marco Mesiti

We investigate some versions of the famous 100 prisoner problem for the infinite case, where there are infinitely many prisoners and infinitely many boxes with labels. In this case, many questions can be asked about the admissible steps of…

General Mathematics · Mathematics 2024-09-26 Attila Losonczi

The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…

Probability · Mathematics 2015-06-26 Alexander Soshnikov

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Number Theory · Mathematics 2026-01-21 Andreas Rusu , Gabriela Ileana Sebe , Dan Lascu

We consider a limit theorem for the distribution of a r.v. $Y_n:=argmax {\{X_i, i= 1,..., n\}},$ where $X_i'$s are independent continuous non-negative random variables. The r.v.'s $\{X_i, i=1,..., n\}$, may be interpreted as the gains of…

Probability · Mathematics 2024-02-07 Youri Davydov , Vladimir Rotar

This paper focuses on the Coupon Collector's Problem with replacement (limited purchasing of missing stickers) and swapping. We have simulated combined strategies and found new results, which we were able to prove for a particular case. The…

Probability · Mathematics 2016-06-07 Niklas Braband , Sonja Braband , Malte Braband

In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…

Optimization and Control · Mathematics 2018-11-05 C. O. Lopez , J. E. Beasley

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

We show a general problem-solving tool called limit theory. This is an advanced version of asymptotic analysis of discrete problems when some finite parameter tends to infinity. We will apply it on three closely related problems. Alpern's…

Computer Science and Game Theory · Computer Science 2017-06-21 Endre Csóka

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

Quantum Physics · Physics 2019-07-23 Frédéric Dupuis , Omar Fawzi

Many discrete-time optimal stopping problems are known to have more tractable limit forms based on a planar Poisson process. Using this tool we find a solution to the optimal stopping problem for i.i.d. sequence of $n$ discrete uniform…

Probability · Mathematics 2026-01-09 Alexander Gnedin

Based upon inequalities on Subset Probabilities, proofs of several conjectures on the Generalized Coupon Collector Problem (i.e. CCP with unequal popularity) are presented. Then we derive a very simple asymptotic relation between the…

Discrete Mathematics · Computer Science 2017-06-19 Christian Berthet

We study the optimal placement problem of a stock trader who wishes to clear his/her inventory by a predetermined time horizon t, by using a limit order or a market order. For a diffusive market, we characterize the optimal limit order…

Trading and Market Microstructure · Quantitative Finance 2017-08-16 José E. Figueroa-López , Hyoeun Lee , Raghu Pasupathy

A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…

Probability · Mathematics 2017-12-13 Plinio S. Dester , Christine Fricker , Danielle Tibi

Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…

Combinatorics · Mathematics 2007-05-23 Kennan Shelton , Michael Siler