Related papers: Optimal Concentration of Information Content For L…

We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on $\mathbb{R}^d$, for all $d \geq 1$. Prior to our work, no…

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

We give a simple development of the concentration properties of compound Poisson measures on the nonnegative integers. A new modification of the Herbst argument is applied to an appropriate modified logarithmic-Sobolev inequality to derive…

We observe that the distribution of the eigenvalues of an $N$-by-$N$ GUE random matrix is log-concave on $\mathbb{R}^N$, and that the same is true for the law of a single gap between two consecutive eigenvalues. We use this observation to…

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…

In a recent paper the author obtained optimal bounds for the strong Gaussian approximation of sums of independent $\R^d$-valued random vectors with finite exponential moments. The results may be considered as generalizations of well-known…

This paper is dedicated to the study of viscous compressible barotropic fluids in dimension $N\geq2$. We address the question of well-posedness for {\it large} data having critical Besov regularity. Our result improve the analysis of R.…

We give a shorter proof of Kanter's (1976) sharp Bessel function bound for concentrations of sums of independent symmetric random vectors. We provide sharp upper bounds for the sum of modified Bessel functions $I_0(x)+I_1(x)$, which might…

We establish quantitative stability results for the entropy power inequality (EPI). Specifically, we show that if uniformly log-concave densities nearly saturate the EPI, then they must be close to Gaussian densities in the quadratic…

For a general class of lattice-spin systems, we prove that an abstract Gaussian concentration bound implies positivity of lower relative entropy density. As a consequence we obtain uniqueness of translation-invariant Gibbs measures from the…

The log-concave maximum likelihood estimator of a density on the real line based on a sample of size $n$ is known to attain the minimax optimal rate of convergence of $O(n^{-4/5})$ with respect to, e.g., squared Hellinger distance. In this…

As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…

We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for…

We introduce a new method for obtaining quantitative convergence rates for the central limit theorem (CLT) in a high dimensional setting. Using our method, we obtain several new bounds for convergence in transportation distance and entropy,…

In this note we prove a spectral gap for various Markov chains on various functional spaces. While proving that a spectral gap exists is relatively common, explicit estimates seems somewhat rare.These estimates are then used to apply the…

Using a sharp version of the reverse Young inequality, and a R\'enyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive R\'enyi entropy power inequalities for log-concave random vectors when…

In this paper, we consider the log-concave ensemble of random matrices, a class of covariance-type matrices $XX^*$ with isotropic log-concave $X$-columns. A main example is the covariance estimator of the uniform measure on isotropic convex…

We prove that the density of a topologically nontrivial, area-minimizing hypercone with an isolated singularity must be greater than the square root of 2. The Simons' cones show that this is the best possible constant. If one of the…

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…