English
Related papers

Related papers: Concentration functions and entropy bounds for dis…

200 papers

We show that Shannon's entropy--power inequality admits a strengthened version in the case in which the densities are log-concave. In such a case, in fact, one can extend the Blachman--Stam argument to obtain a sharp inequality for the…

Information Theory · Computer Science 2014-08-19 Giuseppe Toscani

New Vapnik and Chervonenkis type concentration inequalities are derived for the empirical distribution of an independent random sample. Focus is on the maximal deviation over classes of Borel sets within a low probability region. The…

Statistics Theory · Mathematics 2022-04-26 Stéphane Lhaut , Anne Sabourin , Johan Segers

We show a general phenomenon of the constrained functional value for densities satisfying general convexity conditions, which generalizes the observation in Bobkov and Madiman (2011) that the entropy per coordinate in a log-concave random…

Information Theory · Computer Science 2020-10-27 Yanjun Han

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Probability · Mathematics 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

A concentration property of the functional ${-}\log f(X)$ is demonstrated, when a random vector X has a log-concave density f on $\mathbb{R}^n$. This concentration property implies in particular an extension of the Shannon-McMillan-Breiman…

Probability · Mathematics 2012-11-20 Sergey Bobkov , Mokshay Madiman

We associate to the p-th R\'enyi entropy a definition of entropy power, which is the natural extension of Shannon's entropy power and exhibits a nice behaviour along solutions to the p-nonlinear heat equation in $R^n$. We show that the…

Information Theory · Computer Science 2014-09-16 Giuseppe Savarè , Giuseppe Toscani

Rooted trees with probabilities are used to analyze properties of a variable length code. A bound is derived on the difference between the entropy rates of the code and a memoryless source. The bound is in terms of normalized informational…

Information Theory · Computer Science 2013-10-11 Georg Böcherer , Rana Ali Amjad

The R\'enyi and Shannon entropies are information-theoretic measures which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation.…

Quantum Physics · Physics 2013-05-24 Pablo Sánchez-Moreno , Steeve Zozor , Jesus S. Dehesa

In the setup of i.i.d.~observations and a real valued differentiable functional~$T$, locally asymptotic upper bounds are derived for the power of one-sided tests (simple, versus large values of~$T$)and for the confidence probability of…

Statistics Theory · Mathematics 2014-12-05 Helmut Rieder

R\'enyi complexity ratio of two density functions is introduced for three and multidimensional quantum systems. Localization property of several density functions are defined and five theorems about near continuous property of R\'enyi…

Mathematical Physics · Physics 2021-06-29 Debraj Nath

Bounds on information combining are entropic inequalities that determine how the information, or entropy, of a set of random variables can change when they are combined in certain prescribed ways. Such bounds play an important role in…

Information Theory · Computer Science 2020-11-10 Christoph Hirche

We estimate the concentration functions of $n$-fold convolutions of one-dimensional probability measures. The main result is a supplement to the results of G\"otze and Zaitsev (1998). We show that the estimation of concentration functions…

Probability · Mathematics 2014-02-28 F. Götze , A. Yu. Zaitsev

This paper is twofold. In the first part, we present a refinement of the R\'enyi Entropy Power Inequality (EPI) recently obtained in \cite{BM16}. The proof largely follows the approach in \cite{DCT91} of employing Young's convolution…

Probability · Mathematics 2018-05-01 Jiange Li

This paper studies the behavior of the entropy numbers of classes of functions with bounded integral norms from a given finite dimensional linear subspace. Upper bounds of these entropy numbers in the uniform norm are obtained and applied…

Classical Analysis and ODEs · Mathematics 2020-01-30 F. Dai , A. Prymak , A. Shadrin , V. Temlyakov , S. Tikhonov

We present a general method for calculating R\'enyi entropies in the ground state of a one-dimensional critical system with mixed open boundaries, for an interval starting at one of its ends. In the conformal field theory framework, this…

Statistical Mechanics · Physics 2025-11-12 Benoit Estienne , Yacine Ikhlef , Andrei Rotaru

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…

Statistics Theory · Mathematics 2007-06-13 Fuchang Gao , Jon A. Wellner

A method of estimating the joint probability mass function of a pair of discrete random variables is described. This estimator is used to construct the conditional Shannon-R\'eyni-Tsallis entropies estimates. From there almost sure rates of…

Statistics Theory · Mathematics 2020-02-18 Ba Amadou Diadie , Lo Gane Samb

The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with…

Information Theory · Computer Science 2024-05-07 Sergey Bobkov , Mokshay Madiman

Given a suitably normalized $X\in\mathbb{R}^n$ we observe that the function $\theta\mapsto\mathbb{E}|X\cdot\theta|$, defined for $\theta\in S^{n-1}$, admits surprisingly strong concentration far surpassing what is expected on account of…

Functional Analysis · Mathematics 2020-08-04 Erez Buchweitz

The concentration of empirical measures is studied for dependent data, whose joint distribution satisfies Poincar\'{e}-type or logarithmic Sobolev inequalities. The general concentration results are then applied to spectral empirical…

Statistics Theory · Mathematics 2010-11-30 S. G. Bobkov , F. Götze