Related papers: Entropy on regular trees
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
We consider the weighted least squares spline approximation of a noisy dataset. By interpreting the weights as a probability distribution, we maximize the associated entropy subject to the constraint that the mean squared error is…
The graph invariant EPT-sum has cropped up in several unrelated fields in later years: As an objective function for hierarchical clustering, as a more fine-grained version of the classical edge ranking problem, and, specifically when the…
We study the relative entropy and the trace square distance, both of which measure the distance between reduced density matrices of two excited states in two dimensional conformal field theories. We find a general formula for the relative…
Despite substantial progress in non-equilibrium physics, steady-state (s.s.) probabilities remain intractable to analysis. For a Markov process, s.s. probabilities can be expressed in terms of transition rates using the Matrix-Tree theorem…
Let $H$ be a fixed graph. The $H$-Transversal problem, given a graph $G$, asks to remove the smallest number of vertices from $G$ so that $G$ does not contain $H$ as a subgraph. While a simple $|V(H)|$-approximation algorithm exists and is…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
We examine the minimization of information entropy for measures on the phase space of bounded domains, subject to constraints that are averages of grand canonical distributions. We describe the set of all such constraints and show that it…
Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
We present a new and surprisingly simple analysis of random-shift decompositions -- originally proposed by Miller, Peng, and Xu [SPAA'13]: We show that decompositions for exponentially growing scales $D = 2^0, 2^1, \ldots,…
For a continuous map $f$ from the real line (half-open interval $[0,1)$) into itself let ent(f) denote the supremum of topological entropies of $f|_K$, where $K$ runs over all compact $f$-invariant subsets of $\mathbb{R}$ ($[0,1)$,…
For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
We establish the analogue for maps on trees of the result established in two papers by the first author for interval maps, that a continuous self- map for which all but countably many points have at least m preimages (and none have less…
As access to high-quality, domain-specific data grows increasingly scarce, multi-epoch training has become a practical strategy for adapting large language models (LLMs). However, autoregressive models often suffer from performance…
We study the Bowen topological entropy of generic and irregular points for certain dynamical systems. We define the topological entropy of noncompact sets for flows, analogous to Bowen's definition. We show that this entropy coincides with…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
In previous work (see arxiv:1102.3040), we have defined the telescopic relative entropy (TRE), which is a regularisation of the quantum relative entropy $S(\rho||\sigma)=\trace\rho(\log\rho-\log\sigma)$, by replacing the second argument…