相关论文: Entropy on regular trees
In this paper, we introduce two bounds which we call the Upper Differential Entropy and the Lower Differential Entropy for an infinite family of intervals(strips) in quantum field theory. The two bounds are equal provided that the theory is…
Treedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O(k^2)} n$-time exact algorithm and a polynomial-time $O(\text{OPT} \log^{3/2}…
For a state $\rho_{A_1^n B}$, we call a sequence of states $(\sigma_{A_1^k B}^{(k)})_{k=1}^n$ an approximation chain if for every $1 \leq k \leq n$, $\rho_{A_1^k B} \approx_\epsilon \sigma_{A_1^k B}^{(k)}$. In general, it is not possible to…
We consider topological dynamical systems given by skew products $S\rtimes_{\tau} T$, where $S\colon Y\to Y$ is a subshift, $\tau\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For…
We generalize the tree doubling and Christofides algorithm, the two most common approximations for TSP, to parameterized approximations for ATSP. The parameters we consider for the respective parameterizations are upper bounded by the…
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a}…
Using the definition of entropy of a family of increasing distances on a compact metric set given in [10] we introduce a notion of Finsler entropy for smooth distributions and Stefan-Sussmann foliations. This concept generalizes most of…
A fast method is presented for computing the topological entropy of braids on the torus. This work is motivated by the need to analyze large braids when studying two-dimensional flows via the braiding of a large number of particle…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
Entropy estimation is of practical importance in information theory and statistical science. Many existing entropy estimators suffer from fast growing estimation bias with respect to dimensionality, rendering them unsuitable for…
The aim of this paper is to provide upper bounds for the entropy numbers of summation operators on trees in a critical case. In a recent paper [10] we elaborated a framework of weighted summation operators on general trees where we related…
In this paper, we study the entanglement entropy in string theory in the simplest setup of dividing the nine dimensional space into two halves. This corresponds to the leading quantum correction to the horizon entropy in string theory on…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
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…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity of the problem is polynomial. In this paper, some tools for…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
We introduce the concept of inflation word entropy for random substitutions with a constant and primitive substitution matrix. Previous calculations of the topological entropy of such systems implicitly used this concept and established…
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…