Related papers: Entropy and expansion
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…
We exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new…
In this paper, we establish Berry--Esseen bounds for both self-normalized and non-self-normalized sums of locally dependent random variables. The proofs are based on Stein's method together with a concentration inequality approach. We…
This paper is on developing some computer-assisted proof methods involving non-classical inequalities for Shannon entropy. Two areas of the applications of information inequalities are studied: Secret sharing schemes and hat guessing games.…
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured…
We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…
When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the…
We study higher order expansions both in the Berry-Ess\'een estimate (Edgeworth expansions) and in the local limit theorems for Birkhoff sums of chaotic probability preserving dynamical systems. We establish general results under technical…
The fundamental inequality of Guivarc'h relates the entropy and the drift of random walks on groups. It is strict if and only if the random walk does not behave like the uniform measure on balls. We prove that, in any nonelementary…
The shear shallow water model is an extension of the classical shallow water model to include the effects of vertical shear. It is a system of six non-linear hyperbolic PDE with non-conservative products. We develop a high-order entropy…
We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic…
We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that…
This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $\alpha \in [1, \infty]$. An R-EPI…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…
In this paper we investigate the entropy of gravitational Chern-Simons terms for the horizon with non-vanishing extrinsic curvatures, or the holographic entanglement entropy for arbitrary entangling surface. In 3D we find no anomaly of…
We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…