English
Related papers

Related papers: A Tight Uniform Continuity Bound for Equivocation

200 papers

We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of…

Quantum Physics · Physics 2020-12-23 Anna Vershynina

In this paper, some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals. Certain optimization problems associated with these functionals are shown to be…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Ivan Stanojević , Vojin Šenk

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

Numerical Analysis · Mathematics 2019-11-01 Gerard Awanou

We present new tight bounds for averaging differential inclusions, which we apply to multi-frequency inclusions consisting of a sum of time periodic set-valued mappings. For this family of inclusions we establish an a tight estimate of…

Optimization and Control · Mathematics 2014-03-11 Ido Bright

Motivated by the entropy computations relevant to the evaluation of decrease in entropy in bit reset operations, the authors investigate the deficit in an entropic inequality involving two independent random variables, one continuous and…

Information Theory · Computer Science 2018-09-21 James Melbourne , Saurav Talukdar , Shreyas Bhaban , Murti V. Salapaka

We prove that the tail probabilities of sums of independent uniform random variables, up to a multiplicative constant, are dominated by the Gaussian tail with matching variance and find the sharp constant for such stochastic domination.

Probability · Mathematics 2026-03-05 Xinjie He , Tomasz Tkocz , Katarzyna Wyczesany

Expressions for (EPI Shannon type) Divergence-Power Inequalities (DPI) in two cases (time-discrete and band-limited time-continuous) of stationary random processes are given. The new expressions connect the divergence rate of the sum of…

Information Theory · Computer Science 2016-11-17 Jacob Binia

We present estimators for entropy and other functions of a discrete probability distribution when the data is a finite sample drawn from that probability distribution. In particular, for the case when the probability distribution is a joint…

comp-gas · Physics 2008-02-03 David H. Wolpert , David R. Wolf

We consider the symmetric simple exclusion process evolving on the interval of length $n-1$ in contact with reservoirs of density $\rho \in (0,1)$ at the boundary. We use Yau's relative entropy method to show that if the initial measure is…

Probability · Mathematics 2021-10-14 Patrícia Gonçalves , Milton Jara , Rodrigo Marinho , Otávio Menezes

Dini's Theorem guarantees that a monotone sequence of continuous functions converges pointwise on a compact interval to a continuous limit that converges uniformly. In this paper, we establish new theorems generalizing Dini's result by…

General Mathematics · Mathematics 2025-06-03 Riwaj Khatiwada

We provide a sharp lower bound on the $p$-norm of a sum of independent uniform random variables in terms of its variance when $0 < p < 1$. We address an analogous question for $p$-R\'enyi entropy for $p$ in the same range.

Probability · Mathematics 2025-01-28 Giorgos Chasapis , Keerthana Gurushankar , Tomasz Tkocz

This paper addresses the statistical problem of estimating the infinite-norm deviation from the empirical mean to the distribution mean for high-dimensional distributions on $\{0,1\}^d$, potentially with $d=\infty$. Unlike traditional…

Statistics Theory · Mathematics 2024-02-21 Moïse Blanchard , Václav Voráček

This study investigates the extension of distance variance, a validated spread metric for continuous and binary variables [Edelmann et al., 2020, Ann. Stat., 48(6)], to quantify the spread of general categorical variables. We provide both…

Methodology · Statistics 2024-05-14 Qingyang Zhang

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary…

Other Computer Science · Computer Science 2013-09-17 Grenville J. Croll

We present a somewhat different way of looking on Shannon entropy. This leads to an axiomatisation of Shannon entropy that is essentially equivalent to that of Fadeev. In particular we give a new proof of Fadeev theorem.

Information Theory · Computer Science 2012-03-16 Tomasz Sobieszek

We prove entropy rigidity for finite volume strictly convex projective manifolds in dimensions $\geq 3$, generalizing the work of arXiv:1708.03983 to the finite volume setting. The rigidity theorem uses the techniques of Besson, Courtois,…

Differential Geometry · Mathematics 2020-06-25 Harrison Bray , David Constantine

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…

Optimization and Control · Mathematics 2020-10-16 Ernst Roos , Ruud Brekelmans , Wouter van Eekelen , Dick den Hertog , Johan van Leeuwaarden

We axiomatically characterize the Tsallis entropy of a finite quantum system. In addition, we derive a continuity property of Tsallis entropy. This gives a generalization of the Fannes inequality.

Quantum Physics · Physics 2010-01-12 Shigeru Furuichi , Kenjiro Yanagi , Ken Kuriyama

Suppose that you have $n$ colours and $m$ mutually independent dice, each of which has $r$ sides. Each dice lands on any of its sides with equal probability. You may colour the sides of each die in any way you wish, but there is one…

Probability · Mathematics 2018-08-14 Christos Pelekis

In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…

Probability · Mathematics 2026-04-10 Fraser Daly
‹ Prev 1 8 9 10 Next ›