Related papers: Entropy of Berenstein-Maldacena-Nastase Strings
Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some…
The definition of $k^{th}$-order empirical entropy of strings is extended to node labelled binary trees. A suitable binary encoding of tree straight-line programs (that have been used for grammar-based tree compression before) is shown to…
Entropies must correspond to mean values for them to be measurable. The Shannon entropy corresponds to the weighted arithmetic mean, whereas the Renyi entropy corresponds to the exponential mean. These means refer to code lengths, which are…
This is an expanded version of a talk given at ``{\em IInd Recontre du Vietnam}'' held at Ho Chi Minh City in October, 1995. We discuss several aspects of black hole entropy in string theory. We first explain why the geometric entropy in…
We study the possibility of extended inflation in the effective theory of gravity from strings compactified to four dimensions and find that it strongly depends on the mechanism of supersymmetry breaking. We consider a general class of…
Shannon entropy is widely used to quantify the uncertainty of discrete random variables. But when normalized to the unit interval, as is often done in practice, it no longer conveys the alphabet sizes of the random variables being studied.…
Entropy quantifies the number of bits required to store objects under certain given assumptions. While this is a well established concept for strings, in the context of tries the state-of-the-art regarding entropies is less developed. The…
We develop techniques to compute higher loop string amplitudes for twisted $N=2$ theories with $\hat c=3$ (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states,…
We study the new class of solutions in linearized open string field theory (OSFT) involving higher-spin modes. Unlike the elementary OSFT solutions (on-shell vertex operators) that, acting on a vacuum, define wavefunctions of pure states…
We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…
Entropies of mixing can be derived directly from the parent distributions of extreme value theory. They correspond to pseudo-additive entropies in the case of Pareto and power function distributions, while to the Shannon entropy in the case…
We consider entanglement in the ground state of the XY spin model on infinite chain. We use von Neumann entropy of a sub-system as a measure of entanglement. The entropy of a large block of neighboring spins approaches a constant as the…
We study an entropy measure for quantum systems that generalizes the von Neumann entropy as well as its classical counterpart, the Gibbs or Shannon entropy. The entropy measure is based on hypothesis testing and has an elegant formulation…
We generalize the entropy function formalism to five-dimensional and four-dimensional non-extremal black holes in string theory. In the near horizon limit, these black holes have BTZ metric as part of the spacetime geometry. It is shown…
We show how generalized Gibbs-Shannon entropies can provide new insights on the statistical properties of texts. The universal distribution of word frequencies (Zipf's law) implies that the generalized entropies, computed at the word level,…
We improve the entropic uncertainty relations for position and momentum coarse-grained measurements. We derive the continuous, coarse-grained counterparts of the discrete uncertainty relations based on the concept of majorization. The…
A common statistical situation concerns inferring an unknown distribution Q(x) from a known distribution P(y), where X (dimension n), and Y (dimension m) have a known functional relationship. Most commonly, n<m, and the task is relatively…
We present a new class of estimators of Shannon entropy for severely undersampled discrete distributions. It is based on a generalization of an estimator proposed by T. Schuermann, which itself is a generalization of an estimator proposed…
Convergence properties of Shannon Entropy are studied. In the differential setting, it is shown that weak convergence of probability measures, or convergence in distribution, is not enough for convergence of the associated differential…
I consider flat slices of moduli spaces where the $(-\nabla \log T)$-vectors of particle-towers and branes are constant, and I show that the Emergent String Conjecture constrains these vectors to reside on lattices. In asymptotic limits,…