相关论文: Minimal volume entropy on graphs

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

This article deals with topological assumptions under which the minimal volume entropy of a closed manifold $M$, and more generally of a finite simplicial complex $X$, vanishes or is positive. These topological conditions are expressed in…

We study the convexity of the entropy functional along particular interpolating curves defined on the space of finitely supported probability measures on a graph.

Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice…

Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…

As we have proved in [L], the geodesic flows associated with the flat metrics on T^2 minimize the polynomial entropy. In this paper, we show that, among the geodesic flows that are Bott integrable and dynamically coherent, the geodesic…

Magnitude and (co)weightings are quite general constructions in enriched categories, yet they have been developed almost exclusively in the context of Lawvere metric spaces. We construct a meaningful notion of magnitude for flow graphs…

The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based…

We describe dimensional entropies introduced in a previous work list some of their properties and give some new proofs. These entropies allowed the definition of entropy-expanding maps. We introduce a new notion of entropy-hyperbolicity for…

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

Entropy is a natural geometric quantity measuring the complexity of a surface embedded in $\mathbb{R}^3$. For dynamical reasons relating to mean curvature flow, Colding-Ilmanen-Minicozzi-White conjectured that the entropy of any closed…

When constructing models of the world, we aim for optimal compressions: models that include as few details as possible while remaining as accurate as possible. But which details -- or features measured in data -- should we choose to include…

For the minimal graph defined on a convex ring in the space form with nonnegative curvature, we obtain the regularity and the strict convexity about its level sets by the continuity method.

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…

The geodesic flow of the flat metric on a torus is minimizing the polynomial entropy among all geodesic flows on this torus. We prove here that this properties characterises the flat metric on the two torus.

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

Trigonometric and trigonometric-algebraic entropies are introduced. Regularity increases the entropy and the maximal entropy is shown to result when a regular $n$-gon is inscribed in a circle. A regular $n$-gon circumscribing a circle gives…

Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…

We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…