Related papers: Balls and Bins -- Simple Concentration Bounds
Given a prior probability density $p$ on a compact set $K$ we characterize the probability distribution $q_{\delta}^*$ on $K$ contained in a Wasserstein ball $B_{\delta}(\mu)$ centered in a given discrete measure $\mu$ for which the…
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…
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…
Under investigation in this paper is the dynamics and probability of heads in the toss of a coin with symmetric inhomogeneous density. Such coins are assumed to have diagonal inertia matrix. The rotational motion of the coin is determined…
We derive the limiting distribution of the barycenter $b_n$ of an i.i.d. sample of $n$ random points on a planar cone with angular spread larger than $2\pi$. There are three mutually exclusive possibilities: (i) (fully sticky case) after a…
We prove a strong concentration result about the natural collision estimator, which counts the number of collisions that occur within an iid sample. This estimator is at the heart of algorithms used for uniformity testing and entropy…
We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance,…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints…
The idea of representations of the data in negatively curved manifolds recently attracted a lot of attention and gave a rise to the new research direction named {\it hyperbolic machine learning} (ML). In order to unveil the full potential…
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…
The zero-temperature limit of the backgammon model under resetting is studied. The model is a balls-in-boxes model whose relaxation dynamics is governed by the density of boxes containing just one particle. As these boxes become rare at…
This paper studies the Best-of-K Bandit game: At each time the player chooses a subset S among all N-choose-K possible options and observes reward max(X(i) : i in S) where X is a random vector drawn from a joint distribution. The objective…
We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…
Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…
Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
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 randomly chosen bins, compare their two loads and then place a ball in the least…
The requirement that packings of hard particles, arguably the simplest structural glass, cannot be compressed by rearranging their network of contacts is shown to yield a new constraint on their microscopic structure. This constraint takes…
We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…