Related papers: The maximum negative hypergeometric distribution

Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…

We find the asymptotic total variation distance between two distributions on configurations of m balls in n labeled bins: in the first, each ball is placed in a bin uniformly at random; in the second, k balls are planted in an arbitrary but…

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…

We present a generalization of the maximal inequalities that upper bound the expectation of the maximum of $n$ jointly distributed random variables. We control the expectation of a randomly selected random variable from $n$ jointly…

The negative binomial distribution NB$(k,r)$ of Type I is the probability distribution for a sequence of independent Bernoulli trials (with success parameter $p\in(0,1)$) with $r$ nonoverlapping success runs of length $\ge k$. We present a…

This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We…

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…

We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…

In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…

We consider a version of the classical P\'olya urn scheme which incorporates innovations. The space $S$ of colors is an arbitrary measurable set. After each sampling of a ball in the urn, one returns $C$ balls of the same color and…

For a given $\delta \in (0,1)$, the randomly perturbed graph model is defined as the union of any $n$-vertex graph $G_0$ with minimum degree $\delta n$ and the binomial random graph $\mathbf{G}(n,p)$ on the same vertex set. Moreover, we say…

Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ is defined in terms of the following game: There are $n$ players and one opponent. The opponent will wear one of the $q$ hats of different colors on the player's…

Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…

The paper is devoted to infinite Bernoulli convolutions generated by positive multigeometric series and to probability distributions of random variables whose digits in an even integer base-$s$ expansion with two redundant digits form a…

Given a set of strings over a specified alphabet, identifying a median or consensus string that minimizes the total distance to all input strings is a fundamental data aggregation problem. When the Hamming distance is considered as the…

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…

We give a detailed proof, in the identically distributed case, of a conjecture of Feige about the maximum probability that the sum of n independent non-negative integer valued random variables, each of mean 1, exceeds n. The general case is…

We study the number of white balls in a classical P\'olya urn model with the additional feature that, at random times, a black ball is added to the urn. The number of draws between these random times are i.i.d. and, under certain moment…