English
Related papers

Related papers: Entropy and Information jump for log-concave vecto…

200 papers

We prove that the reciprocal of Fisher information of a log-concave probability density $X$ in ${\bf{R}}^n$ is concave in $t$ with respect to the addition of a Gaussian noise $Z_t = N(0, tI_n)$. As a byproduct of this result we show that…

Information Theory · Computer Science 2015-06-23 G. Toscani

We prove that the (square root) Fisher information functional is a strong Wasserstein upper gradient of the entropy on non-convex Riemannian domains. This fills a gap in the literature by allowing one to completely dispense from…

Analysis of PDEs · Mathematics 2025-12-08 Jean-Baptiste Casteras , Marco Flaim , Léonard Monsaingeon

We establish lower bounds on the volume and the surface area of a geometric body using the size of its slices along different directions. In the first part of the paper, we derive volume bounds for convex bodies using generalized…

Information Theory · Computer Science 2019-10-02 Jing Hao , Varun Jog

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Yaming Yu

We establish a quantum version of the classical isoperimetric inequality relating the Fisher information and the entropy power of a quantum state. The key tool is a Fisher information inequality for a state which results from a certain…

Quantum Physics · Physics 2017-02-16 Stefan Huber , Robert Koenig , Anna Vershynina

In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…

Quantum Physics · Physics 2018-10-25 Christian Majenz

This note extends some results of Nishiyama [Ann. Probab. 28 (2000) 685--712]. A maximal inequality for stochastic integrals with respect to integer-valued random measures which may have infinitely many jumps on compact time intervals is…

Probability · Mathematics 2011-11-10 Yoichi Nishiyama

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…

Information Theory · Computer Science 2018-07-24 Arnaud Marsiglietti , James Melbourne

We introduce an inequality which may be viewed as a generalization of both the Brascamp-Lieb inequality and its reverse (Barthe's inequality), and prove its information-theoretic (i.e.\ entropic) formulation. This result leads to a unified…

Information Theory · Computer Science 2017-12-05 Jingbo Liu , Thomas A. Courtade , Paul Cuff , Sergio Verdu

This paper studies the asymptotic behavior of the Fisher information for a Levy process discretely sampled at an increasing frequency. We show that it is possible to distinguish not only the continuous part of the process from its jumps…

Probability · Mathematics 2007-05-23 Yacine Ait-Sahalia , Jean Jacod

Incremental information, as measured by the quantum entropy, is increasing when two ensembles are united. This result was proved by Lieb and Ruskai, and it is the foundation for the proof of strong subadditivity of quantum entropy. We…

Mathematical Physics · Physics 2016-10-24 Frank Hansen

We generalize a result by Carlen and Cordero-Erausquin on the equivalence between the Brascamp-Lieb inequality and the subadditivity of relative entropy by allowing for random transformations (a broadcast channel). This leads to a unified…

Information Theory · Computer Science 2016-05-11 Jingbo Liu , Thomas A. Courtade , Paul Cuff , Sergio Verdu

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…

Information Theory · Computer Science 2016-10-26 Thomas A. Courtade , Max Fathi , Ashwin Pananjady

We study the approach to equilibrium of systems of gas particles in terms of relative entropy. The systems are modeled by the Kac master equation in arbitrary dimensions. First, we study the Kac system coupled to a thermostat, and secondly…

Mathematical Physics · Physics 2023-01-24 Lukas Hauger

We introduce a pair of transformations, which are mutually inverse, acting on rather general classes of probability densities in R. These transformations have the property of interchanging the main informational measures such as p-moments,…

Mathematical Physics · Physics 2025-03-19 Razvan Gabriel Iagar , David Puertas-Centeno

We demonstrate that Shannon's information entropy and the thermodynamic entropy of Boltzmann and Gibbs are quantitatively equivalent for real condensed-matter systems. By interpreting atomic configurations as information sources, we compute…

Statistical Mechanics · Physics 2025-12-03 Dallin Fisher , Qi-Jun Hong

We have discussed dynamical properties of the Tsallis entropy and the generalized Fisher information in nonextensive systems described by the Langevin model subjected to additive and multiplicative noise. Analytical expressions for the…

Statistical Mechanics · Physics 2009-11-13 Hideo Hasegawa

We show that for log-concave real random variables with fixed variance the Shannon differential entropy is minimized for an exponential random variable. We apply this result to derive upper bounds on capacities of additive noise channels…

Probability · Mathematics 2024-03-19 James Melbourne , Piotr Nayar , Cyril Roberto

Here we present an analytic approximation for the entropy of floating-point numbers, along with bounds on the error of this approximation. It is well-known that the differential entropy is tightly linked to the discrete entropy of a…

Information Theory · Computer Science 2026-05-13 Sultan Daniels , Samuel H. D'Ambrosia , Michael R. DeWeese , Anant Sahai

We tighten the Entropy Power Inequality (EPI) when one of the random summands is Gaussian. Our strengthening is closely connected to the concept of strong data processing for Gaussian channels and generalizes the (vector extension of)…

Information Theory · Computer Science 2016-02-10 Thomas A. Courtade