Related papers: Magnitude and Topological Entropy of Digraphs
We compute magnitude homology of various graphs using algebraic Morse theory. Specifically, we (1) give an alternative proof that trees are diagonal, (2) identify a new class of diagonal graphs, (3) prove that the icosahedral graph is…
Magnitude is a numerical invariant of metric spaces introduced by Leinster, motivated by considerations from category theory. This paper extends the original definition for finite spaces to compact spaces, in an equivalent but more natural…
Graph representation learning has achieved great success in many areas, including e-commerce, chemistry, biology, etc. However, the fundamental problem of choosing the appropriate dimension of node embedding for a given graph still remains…
A characterization of topological order in terms of bi-partite entanglement was proposed recently [A. Kitaev and J. Preskill, Phys. Rev. Lett. 96, 110404 (2006); M. Levin and X.-G. Wen, ibid, 110405]. It was argued that in a topological…
The purpose of this article is twofold. Firstly, we use the next-token probabilities given by a language model to explicitly define a category of texts in natural language enriched over the unit interval, in the sense of Bradley, Terilla,…
The notion of metric entropy dimension is introduced to measure the complexity of entropy zero dynamical systems. For measure preserving systems, we define entropy dimension via the dimension of entropy generating sequences. This…
Metric spaces are a fundamental component of mathematics and have a paramount importance as a framework for measuring distance. They can be found in many different branches of mathematics, such as analysis and topology. This paper offers an…
A new monotone quantity in graphical mean curvature flows of higher codimensions is identified in this work. The submanifold deformed by the mean curvature flow is the graph of a map between Riemannian manifolds, and the quantity is…
The local structure of unweighted networks can be characterized by the number of times a subgraph appears in the network. The clustering coefficient, reflecting the local configuration of triangles, can be seen as a special case of this…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
In this paper, we mainly elucidate a close relationship between the topological entropy and mean dimension theory for actions of polynomial growth groups. We show that metric mean dimension and mean Hausdorff dimension of subshifts with…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
The topological entanglement entropy is used to measure long-range quantum correlations in the ground state of topological phases. Here we obtain closed form expressions for topological entropy of (2+1)- and (3+1)-dimensional loop gas…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
In the present paper we study the thermodynamical properties of finitely generated continuous subgroup actions. We address a notion of topological entropy and pressure functions that does not depend on the growth rate of the semigroup and…
Necessary and sufficient conditions for the symbolic dynamics of a Lorenz map to be fully embedded in the symbolic dynamics of a piecewise continuous interval map are given. As an application of this result, we describe a new algorithm for…
Metric magnitude is a measure of the "size" of point clouds with many desirable geometric properties. It has been adapted to various mathematical contexts and recent work suggests that it can enhance machine learning and optimization…
This study introduces a pore morphology algorithm that emphasizes the central role of topology in multiphase flow through porous media. Analysis of drainage in lattice-based pore networks identifies two key quantities, the percolation…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
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…