Related papers: Hard Core entropy: lower bounds
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…
We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…
Recently, we derived an improved universal upper bound to the entropy of a charged system $S \leq \pi (2E b-q^2)/ \hbar$. There was, however, some uncertainty in the value of the numerical factor which multiplies the $q^2$ term. In this…
Let $f$ be a $C^r$ ($r>1$) diffeomorphism on a compact surface $M$ with $h_{\rm top}(f)\geq\frac{\lambda^{+}(f)}{r}$ where $\lambda^{+}(f):=\lim_{n\to+\infty}\frac{1}{n}\max_{x\in M}\log \left\|Df^{n}_{x}\right\|$. We establish an…
The issue of black hole entropy is reexamined within a finite lattice framework along the lines of Wheeler, 't Hooft and Susskind, with an additional criterion to identify physical horizon states contributing to the entropy. As a…
We consider the \emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified)…
In this paper, we propose a characterization for non-elementary trapping sets (NETSs) of low-density parity-check (LDPC) codes. The characterization is based on viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The…
This paper studies set-invariance and stabilization of hyperbolic sets over rate-limited channels for discrete-time control systems. We first investigate structural and control-theoretic properties of hyperbolic sets, in particular such…
In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the…
We expand our recent work on the outer entropy, a holographic coarse-grained entropy defined by maximizing the boundary entropy while fixing the classical bulk data outside some surface. When the surface is marginally trapped and satisfies…
The notion of software entropy is often invoked to describe the tendency of software systems to become increasingly disordered as they evolve, yet existing approaches to quantify it are largely heuristic. In this work we introduce a formal…
In typical flat-band models, defined as nearest-neighbor tight-binding models, flat bands are usually pinned to the special energies, such as top or bottom of dispersive bands, or band-crossing points. In this paper, we propose a simple…
We extend the notion of estimation entropy of autonomous dynamical systems proposed by Liberzon and Mitra [1] to nonlinear dynamical systems with uncertain inputs with bounded variation. We call this new notion the {$\epsilon$}-estimation…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
For closed hyperbolic $3$-manifolds $M$ with volume less than a constant $V$, we prove an inequality regarding the geometric $L^2$-norm and the topological Thurston norm, which is qualitatively sharp and verifies a conjecture of Brock and…
Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of…
We demonstrate that linear combinations of subregion entropies with canceling boundary terms, commonly used to calculate the topological entanglement entropy, may suffer from spurious nontopological contributions even in models with zero…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…
The Gibbs entropy of a microcanonical network ensemble is the logarithm of the number of network configurations compatible with a set of hard constraints. This quantity characterizes the level of order and randomness encoded in features of…