English
Related papers

Related papers: A Note on the Gaussian Minimum Conjecture

200 papers

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…

Probability · Mathematics 2023-09-20 Abdulmajeed Alqasem , Heshan Aravinda , Arnaud Marsiglietti , James Melbourne

Let $A$ be an $n\times n$ random matrix with i.i.d. entries of zero mean, unit variance and a bounded subgaussian moment. We show that the condition number $s_{\max}(A)/s_{\min}(A)$ satisfies the small ball probability estimate $${\mathbb…

Probability · Mathematics 2019-06-18 Alexander E. Litvak , Konstantin Tikhomirov , Nicole Tomczak-Jaegermann

Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its expectation by at least \lambda \var(X)^{1/2} is at most…

Combinatorics · Mathematics 2009-09-15 Guy Wolfovitz

We consider a channel $Y=X+N$ where $X$ is a random variable satisfying $\mathbb{E}[|X|]<\infty$ and $N$ is an independent standard normal random variable. We show that the minimum mean-square error estimator of $X$ from $Y,$ which is given…

Information Theory · Computer Science 2021-02-12 Wael Alghamdi , Flavio P. Calmon

The present article derives the minimal number $N$ of observations needed to consider a Bayesian posterior distribution as Gaussian. Two examples are presented. Within one of them, a chi-squared distribution, the observable $x$ as well as…

Statistics Theory · Mathematics 2020-12-03 Christoph Fuhrmann , Hanns Ludwig Harney , Klaus Harney , Andreas Müller

A formulation of the generalized minimal output entropy conjecture for Gaussian channels is presented. It asserts that, for states with fixed input entropy, the minimal value of the output entropy of the channel (i.e. the minimal output…

Quantum Physics · Physics 2015-05-18 V. Giovannetti , A. S. Holevo , S. Lloyd , L. Maccone

Consider the problem of estimating the mean of a Gaussian random vector when the mean vector is assumed to be in a given convex set. The most natural solution is to take the Euclidean projection of the data vector on to this convex set; in…

Statistics Theory · Mathematics 2014-11-21 Sourav Chatterjee

Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…

Metric Geometry · Mathematics 2009-11-11 B. Klartag

We show that for some constant $\kappa>0$, any centered $\kappa$-subgaussian random variable is equal to the sum of three standard Gaussian random variables, confirming a conjecture of M. Talagrand. We also prove that given $\Lambda\geq 1$,…

Probability · Mathematics 2026-02-27 Antoine Song

The minimum k-assignment of an m by n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. If X is generated by choosing each entry independently from the exponential distribution with mean 1,…

Combinatorics · Mathematics 2007-05-23 Marshall W. Buck , Clara S. Chan , David P. Robbins

We show that any pair $X, Y$ of independent, non-compactly supported random variables on $[0,\infty)$ satisfies $\liminf_{m\to\infty} \mathbb{P}(\min(X,Y) >m \,| \,X+Y> 2m) =0$. We conjecture multi-variate and weighted generalizations of…

Probability · Mathematics 2020-08-05 Naomi Dvora Feldheim , Ohad Noy Feldheim

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector $\boldsymbol{X} = (X_1, \ldots, X_d)$ of arbitrary length can be written as a linear…

Probability · Mathematics 2022-11-18 Christian Genest , Frédéric Ouimet

We consider the following detection problem: given a realization of a symmetric matrix ${\mathbf{X}}$ of dimension $n$, distinguish between the hypothesis that all upper triangular variables are i.i.d. Gaussians variables with mean 0 and…

Statistics Theory · Mathematics 2014-11-25 Andrea Montanari , Daniel Reichman , Ofer Zeitouni

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

Number Theory · Mathematics 2025-04-22 Ameneh Farhadian

Let $X$ be a centered random variable with unit variance, zero third moment, and such that $E[X^4] \ge 3$. Let $\{F_n : n\geq 1\}$ denote a normalized sequence of homogeneous sums of fixed degree $d\geq 2$, built from independent copies of…

Probability · Mathematics 2014-07-24 Ivan Nourdin , Giovanni Peccati , Guillaume Poly , Rosaria Simone

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

This paper addresses the question of when projections of a high-dimensional random vector are approximately Gaussian. This problem has been studied previously in the context of high-dimensional data analysis, where the focus is on…

Information Theory · Computer Science 2017-01-02 Galen Reeves

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

Number Theory · Mathematics 2014-01-31 Li-meng Xia

Let $G_{n,\gamma}$ be the set of all connected graphs on $n$ vertices with domination number $\gamma$. A graph is called a minimizer graph if it attains the minimum spectral radius among $G_{n,\gamma}$. Very recently, Liu, Li and Xie…

Combinatorics · Mathematics 2023-07-31 Yarong Hu , Zhenzhen Lou , Qiongxiang Huang