相关论文: Exact expressions for the maximal probability that…

A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be…

While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several…

The estimation of a probability p from repeated Bernoulli trials is considered in this paper. A sequential approach is followed, using a simple stopping rule. A closed-form expression and an upper bound are obtained for the mean absolute…

A collection of $n$ random events is said to be $(n - 1)$-wise independent if any $n - 1$ events among them are mutually independent. We characterise all probability measures with respect to which $n$ random events are $(n - 1)$-wise…

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML…

The problem of determining the joint probability distributions for correlated random variables with pre-specified marginals is considered. When the joint distribution satisfying all the required conditions is not unique, the "most unbiased"…

Given a set of independent Poisson random variables with common mean, we study the distribution of their maximum and obtain an accurate asymptotic formula to locate the most probable value of the maximum. We verify our analytic results with…

For probability distributions on $\mathbb{R}^n$, we study the optimal sample size N = N(n,p) that suffices to uniformly approximate the pth moments of all one-dimensional marginals. Under the assumption that the marginals have bounded 4p…

We consider Bernoulli measures $\mu_p$ on the interval $[0,1]$. For the standard Lebesgue measure the digits $0$ and $1$ in the binary representation of real numbers appear with an equal probability $1/2$. For the Bernoulli measures, the…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word (i) contains a subsequence of letters (p, p-1,...,1) in that order and (ii) that the maximal length of the disjoint union…

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$.…

Let $b(x)$ be the probability that a sum of independent Bernoulli random variables with parameters $p_1, p_2, p_3, \ldots \in [0,1)$ equals $x$, where $\lambda := p_1 + p_2 + p_3 + \cdots$ is finite. We prove two inequalities for the…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

A complete characterization of the asymptotic singularity probability of random circulant Bernoulli matrices is given for all values of the probability parameter.