Related papers: Bounds on topological Abelian string-vortex and st…
The Shannon based conditional entropy that underlies five-dimensional Einstein-Hilbert gravity coupled to a dilaton field is investigated in the context of dynamical holographic AdS/QCD models. Considering the UV and IR dominance limits of…
The information processing capacity of a complex dynamical system is reflected in the partitioning of its state space into disjoint basins of attraction, with state trajectories in each basin flowing towards their corresponding attractor.…
We give a systematic derivation of the consistency conditions which constrain open-closed disk amplitudes of topological strings. They include the A-infinity relations (which generalize associativity of the boundary product of topological…
Can we learn more from data than existed in the generating process itself? Can new and useful information be constructed from merely applying deterministic transformations to existing data? Can the learnable content in data be evaluated…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
In this work the topological order at finite temperature in two-dimensional color code is studied. The topological entropy is used to measure the behavior of the topological order. Topological order in color code arises from the colored…
Bethe strings are bound states of constituent particles in a variety of interacting many-body one-dimensional (1D) integrable quantum models relevant to magnetism, nanophysics, cold atoms and beyond. As emergent fundamental excitations,…
In a tachyon model proposed by Minahan and Zwiebach and derived in the boundary string field theory, we construct various new solutions which correspond to nontrivial brane configurations in string theory. Our solutions include Dp-D(p-2)…
This paper considers an information bottleneck problem with the objective of obtaining a most informative representation of a hidden feature subject to a R\'enyi entropy complexity constraint. The optimal bottleneck trade-off between…
We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a…
In many biological systems, the network of interactions between the elements can only be inferred from experimental measurements. In neuroscience, non-invasive imaging tools are extensively used to derive either structural or functional…
Accurately determining dependency structure is critical to discovering a system's causal organization. We recently showed that the transfer entropy fails in a key aspect of this---measuring information flow---due to its conflation of dyadic…
Topological entanglement entropy (TEE), the sub-leading term in the entanglement entropy of topological order, is the direct evidence of the long-range entanglement. While effective in characterizing topological orders on closed manifolds,…
We ask which topological phases can and cannot be realized by exactly soluble string-net models. We answer this question for the simplest class of topological phases, namely those with abelian braiding statistics. Specifically, we find that…
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new…
Recent work has established a correspondence between the tripartite entanglement measure of three qubits and the macroscopic entropy of the four-dimensional 8-charge STU black hole of supergravity. Here we consider the configurations of…
We propose a mechanism for solving the horizon and entropy problems of standard cosmology which does not make use of cosmological inflation. Crucial ingredients of our scenario are brane gases, extra dimensions, and a confining potential…
We develop an approach based on edge theories to calculate the entanglement entropy and related quantities in (2+1)-dimensional topologically ordered phases. Our approach is complementary to, e.g., the existing methods using replica trick…
The learnability of different neural architectures can be characterized directly by computable measures of data complexity. In this paper, we reframe the problem of architecture selection as understanding how data determines the most…
A new method is proposed for analyzing complexity and studying the information in random geometric networks using Tsallis entropy tool. Tsallis entropy of the ensemble of random geometric networks is calculated based on the components of…