Related papers: Finite Free Information Inequalities
Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…
We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another…
Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We apply this result to address a fundamental question in…
We establish a large deviation principle for the empirical spectral measure of a sample covariance matrix with sub-Gaussian entries, which extends Bordenave and Caputo's result for Wigner matrices having the same type of entries [7]. To…
We derive a general information-theoretic equality for a system undergoing two projective measurements separated by a general temporal evolution. The equality implies the non-negativity of the mutual information between the measurement…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
We have calculated the Tsallis entropy and Fisher information matrix (entropy) of spatially-correlated nonextensive systems, by using an analytic non-Gaussian distribution obtained by the maximum entropy method. Effects of the correlated…
There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…
In the setting of reversible continuous-time Markov chains, the $CD_\Upsilon$ condition has been shown recently to be a consistent analogue to the Bakry-\'Emery condition in the diffusive setting in terms of proving Li-Yau inequalities…
We introduce two infinite sequences of entanglement monotones, which are constructed from expectation values of polynomials in the modular Hamiltonian. These monotones yield infinite sequences of inequalities that must be satisfied in…
The concept of weighted entropy takes into account values of different outcomes, i.e., makes entropy context-dependent, through the weight function. In this paper, we establish a number of simple inequalities for the weighted entropies…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
Given a sequence of real rooted polynomials $\{p_n\}_{n\geq 1}$ with a fixed asymptotic root distribution, we study the asymptotic root distribution of the repeated polar derivatives of this sequence. This limiting distribution can be seen…
We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…
In this paper, we prove a finite basis theorem for radical well-mixed difference ideals generated by binomials. As a consequence, every strictly ascending chain of radical well-mixed difference ideals generated by binomials in a difference…
We examine a class of deep learning models with a tractable method to compute information-theoretic quantities. Our contributions are three-fold: (i) We show how entropies and mutual informations can be derived from heuristic statistical…
We prove that the Fisher information is monotone decreasing in time along solutions of the space-homogeneous Boltzmann equation for a large class of collision kernels covering all classical interactions derived from systems of particles.…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…