Related papers: Entropy and expansion
We consider the joint density distribution of the elements of certain random matrix models which are example of globally correlated and asymptotically scale-invariant distributions. It is shown that in their cases, the nonadditive entropy…
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in $r$-regular bipartite graphs. It is shown that some of these bounds are…
The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have…
We explore the relation between entanglement entropy of quantum many body systems and the distribution of corresponding, properly selected, observables. Such a relation is necessary to actually measure the entanglement entropy. We show that…
We formulate and prove in this report some sufficient conditions for exponential tightness (ET) of a family of independent identical distributed (i.i.d.) random fields (r.f.) (processes) in the space of continuous functions defined on…
A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one, where the security of the protocol does not rely on knowing the inner workings of the devices used to run it. In order to do…
This paper provides tight bounds on the R\'enyi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one-to-one. To that end, a tight lower bound on the R\'enyi…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
We develop novel empirical Bernstein inequalities for the variance of bounded random variables. Our inequalities hold under constant conditional variance and mean, without further assumptions like independence or identical distribution of…
In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…
The article presents new entropic continuity bounds for conditional expectations and conditional covariance matrices. These bounds are expressed in terms of the relative entropy between different coupling distributions. Our approach…
This paper addresses the correspondence between linear inequalities of Shannon entropy and differential entropy for sums of independent group-valued random variables. We show that any balanced (with the sum of coefficients being zero)…
In arXiv:1801.01238 a variation of Bowen's topological entropy that can be applied to the study of discontinuous semiflows on compact metric spaces was introduced. The main novetly is the use of certain family of pseudosemimetrics…
The von Neumann entropy of an $n$-partite system $A_1^n$ given a system $B$ can be written as the sum of the von Neumann entropies of the individual subsystems $A_k$ given $A_1^{k-1}$ and $B$. While it is known that such a chain rule does…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
We explore an asymptotic behavior of entropies for sums of independent random variables that are convolved with a small continuous noise.
In this paper, we improve the known estimates for the invariance entropy of a nonlinear control system. For sets of complete approximate controllability we derive an upper bound in terms of Lyapunov exponents and for uniformly hyperbolic…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…
We compute the entanglement entropy in a composite system separated by a finitely ramified boundary with the structure of a self-similar lattice graph. We derive the entropy as a function of the decimation factor which determines the…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…