Related papers: A study on the negative binomial distribution moti…

We solve Chui's conjecture on the simplest fractions (i.e., sums of Cauchy kernels with unit coefficients) in weighted (Hilbert) Bergman spaces. Namely, for a wide class of weights, we prove that for every $N$, the simplest fractions with…

It is shown that Bell's counterfactuals admit joint quasiprobability distributions (i.e. joint distributions exist, but may not be non-negative). A necessary and sufficient condition for the existence among them of a true probability…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

Let $\a$ be a real-valued random variable of mean zero and variance 1. Let $M_n(\a)$ denote the $n \times n$ random matrix whose entries are iid copies of $\a$ and $\sigma_n(M_n(\a))$ denote the least singular value of $M_n(\a)$.…

In this paper, we give a Breiman's theorem for conditional dependent random vector, where one component has a regularly-varying-tailed distribution with the index $\alpha\ge0$ and its slowly varying function satisfies a relaxed condition,…

The Park-Pham theorem (previously known as the Kahn-Kalai conjecture), bounds the critical probability, $p_c(\mathcal{F})$, of the a non-trivial property $\mathcal{F}\subseteq 2^X$ that is closed under supersets by the product of a…

Many situations in quantum theory and other areas of physics lead to quasi-probabilities which seem to be physically useful but can be negative. The interpretation of such objects is not at all clear. In this paper, we show that…

Posterior predictive p-values are a common approach to Bayesian model-checking. This article analyses their frequency behaviour, that is, their distribution when the parameters and the data are drawn from the prior and the model…

In this paper, we develop a general theory on the coverage probability of random intervals defined in terms of discrete random variables with continuous parameter spaces. The theory shows that the minimum coverage probabilities of random…

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…

A random variable $\xi$ has a {\it light-tailed} distribution (for short: is light-tailed) if it possesses a finite exponential moment, $\E \exp (\lambda \xi) <\infty$ for some $\lambda >0$, and has a {\it heavy-tailed} distribution (is…

We suggest approximating the distribution of the sum of independent and identically distributed random variables with a Pareto-like tail by combining extreme value approximations for the largest summands with a normal approximation for the…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

The P\'al inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by…

In this addendum we extend Theorem 4.6 on the negative binomial distribution in `Bounds for survival probabilities in supercritical Galton-Watson processes and applications to population genetics' (Journal of Mathematical Biology 92:40,…

We present the expected values from p-value hacking as a choice of the minimum p-value among $m$ independents tests, which can be considerably lower than the "true" p-value, even with a single trial, owing to the extreme skewness of the…

In risk management, often the probability must be estimated that a random vector falls into an extreme failure set. In the framework of bivariate extreme value theory, we construct an estimator for such failure probabilities and analyze its…

Constructing a Pseudo Random Function (PRF) is a fundamental problem in cryptology. Such a construction, implemented by truncating the last $m$ bits of permutations of $\{0, 1\}^{n}$ was suggested by Hall et al. (1998). They conjectured…

This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general…

For graphs $G$ and $H$, the Ramsey number $r(G,H)$ is the smallest positive integer $N$ such that any red/blue edge coloring of the complete graph $K_N$ contains either a red $G$ or a blue $H$. A book $B_n$ is a graph consisting of $n$…