相关论文: Notes on the values of the volume entropy

We study some new isoperimetric inequalities on graphs. We etablish a relation between the volume entropy (or asymptotic volume), the systole and the first Betti number of weighted graphs. We also find bounds for the volume, associated to…

A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate to a -…

Entropy is a classical measure to quantify the amount of information or complexity of a system. Various entropy-based measures such as functional and spectral entropies have been proposed in brain network analysis. However, they are less…

Among the normalized metrics on a graph, we show the existence and the uniqueness of an entropy-minimizing metric, and give explicit formulas for the minimal volume entropy and the metric realizing it.

We propose a method to associate a differentiable Riemannian manifold to a generic many degrees of freedom discrete system which is not described by a Hamiltonian function. Then, in analogy with classical Statistical Mechanics, we introduce…

We are interested in the impact of entropies on the geometry of a hypersurface of a Riemannian manifold. In fact, we will be able to compare the volume entropy of a hypersurface with that of the ambient manifold, provided some geometric…

Let $f$ be a $C^2$ diffeomorphism on a compact manifold. Ledrappier and Young introduced entropies along unstable foliations for an ergodic measure $\mu$. We relate those entropies to covering numbers in order to give a new upper bound on…

Let M be a closed 3-dimensional graph manifold. We prove that h(g)>1 for each geometrization g of M, where h(g) is the topological entropy of geodesic flow of g.

In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.

We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

Coarse geometry studies metric spaces on the large scale. The recently introduced notion of coarse entropy is a tool to study dynamics from the coarse point of view. We prove that all isometries of a given metric space have the same coarse…

The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…

This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…

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$…

This paper concerns the tau constant, which is an important invariant of a metrized graph, and which has applications to arithmetic properties of curves. We give several formulas for the tau constant, and show how it changes under graph…

We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…

Building on a technical result by Brunnemann and Rideout on the spectrum of the Volume operator in Loop Quantum Gravity, we show that the dimension of the space of the quadrivalent, diffeomorphism invariant states with no zero-volume nodes…

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…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…