English
Related papers

Related papers: Bounds on Variance for Unimodal Distributions

200 papers

We provide an elementary proof of the lower bound for the variance of continuous unimodal distributions and obtain analogous bounds for the higher order central moments. A lower bound for the rth central moment of discrete distribution is…

Statistics Theory · Mathematics 2016-02-16 R. Sharma , R. Bhandari , R. Saini

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

Information Theory · Computer Science 2007-07-13 Joseph DeStefano , Erik Learned-Miller

In this paper, we develop the lower and upper bounds of worst-case distortion riskmetrics and weighted entropy for unimodal, and symmetric unimodal distributions when mean and variance information are available. We also consider the sharp…

Risk Management · Quantitative Finance 2025-11-24 Baishuai Zuo , Chuancun Yin

In this paper, we identify a class of absolutely continuous probability distributions, and show that the differential entropy is uniformly convergent over this space under the metric of total variation distance. One of the advantages of…

Information Theory · Computer Science 2018-01-03 Hamid Ghourchian , Amin Gohari , Arash Amini

Mixture distributions are extensively used as a modeling tool in diverse areas from machine learning to communications engineering to physics, and obtaining bounds on the entropy of probability distributions is of fundamental importance in…

Information Theory · Computer Science 2022-12-05 James Melbourne , Saurav Talukdar , Shreyas Bhaban , Mokshay Madiman , Murti V. Salapaka

A lower bound on the R\'enyi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the…

Information Theory · Computer Science 2015-05-07 Liyao Wang , Mokshay Madiman

This paper demonstrates that basic statistics (mean, variance) of the logarithm of the variate itself can be used in the calculation of differential entropy among random variables known to be multiples and powers of a common underlying…

Information Theory · Computer Science 2009-01-26 Thomas M. Eccardt

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…

Statistics Theory · Mathematics 2010-12-30 Aad van der Vaart , Jon A. Wellner

We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables $(X_1, X_2, \dots, X_n)$ possessing a symmetric joint distribution. Our lower bound is in terms of the joint entropy of $(X_1, X_2, \dots,…

Information Theory · Computer Science 2018-01-16 Jing Hao , Varun Jog

This paper proposes that the mathematical relationship between an entropy distribution and its limit offers some new insight into system performance. This relationship is used to quantify variation among the entities of a system, where…

Information Theory · Computer Science 2007-07-16 Ken Krechmer

In this paper, we show that the halfspace depth random variable for samples from a univariate distribution with a notion of center is distributed as a uniform distribution on the interval [0,1/2]. The simplicial depth random variable has a…

Methodology · Statistics 2023-04-27 Rui Ding

We prove an entropy version of van der Corput's difference theorem: the entropy of a sequence is equal to the entropy of its differences. This reveals a potential correspondence between the theory of uniform distribution mod 1 and entropy.…

Dynamical Systems · Mathematics 2024-03-11 Weichen Gu , Xiang Li

The entropy power inequality for independent random vectors is a foundational result of information theory, with deep connections to probability and geometric functional analysis. Several extensions of the entropy power inequality have been…

Information Theory · Computer Science 2025-12-23 Mokshay Madiman , James Melbourne , Cyril Roberto

Exact lower and upper bounds on the best possible misclassification probability for a finite number of classes are obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. These…

Statistics Theory · Mathematics 2018-02-12 Iosif Pinelis

Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…

Applications · Statistics 2011-03-03 Mehdi Molkaraie , Payam Pakzad

The existing upper and lower bounds between entropy and error are mostly derived through an inequality means without linking to joint distributions. In fact, from either theoretical or application viewpoint, there exists a need to achieve a…

Information Theory · Computer Science 2013-03-06 Bao-Gang Hu , Hong-Jie Xing

Convergence properties of Shannon Entropy are studied. In the differential setting, it is shown that weak convergence of probability measures, or convergence in distribution, is not enough for convergence of the associated differential…

Information Theory · Computer Science 2016-11-18 Francisco J. Piera , Patricio Parada

We prove generalised concentration inequalities for a class of scaled self-bounding functions of independent random variables, referred to as ${(M,a,b)}$ self-bounding. The scaling refers to the fact that the component-wise difference is…

Probability · Mathematics 2025-09-29 George Crowley , Iñaki Esnaola

We introduce a new measure of interdependence among the components of a random vector along the main diagonal of the vector copula, i.e. along the line $u_{1}=\ldots=u_{J}$, for $\left(u_{1},\ldots,u_{J}\right)\in\left[0,1\right]^{J}$. Our…

Methodology · Statistics 2014-08-29 Jhan Rodríguez , András Bárdossy
‹ Prev 1 2 3 10 Next ›