Notes on the values of volume entropy of graphs
From MaRDI portal
Abstract: Volume entropy is an important invariant of metric graphs as well as Riemannian manifolds. In this note, we calculate the change of volume entropy when an edge is added to a metric graph. Using the first result, we investigate the change of volume entropy when a vertex and edges around it are added. In the second part, we estimate the value of the volume entropy which can be used to suggest an algorithm of calculating the persistent volume entropy of graphs.
Recommendations
- Volume entropy, weighted girths and stable balls on graphs
- Minimal volume entropy for graphs
- On the von Neumann entropy of graphs
- On the possible values of the entropy of undirected graphs
- scientific article; zbMATH DE number 7410277
- Note on von Neumann and Rényi entropies of a graph
- scientific article; zbMATH DE number 167195
- On the von Neumann entropy of a graph
- A note on the von Neumann entropy of random graphs
- Volume entropy of hyperbolic graph surfaces
Cites work
- Entropy and the clique polynomial
- Entropy rigidity for metric spaces
- Equidistribution and counting under equilibrium states in negative curvature and trees. Applications to non-Archimedean Diophantine approximation
- Exponential growth rate of paths and its connection with dynamics
- Growth of balls in the universal cover of surfaces and graphs
- scientific article; zbMATH DE number 5907543 (Why is no real title available?)
- Minimal volume entropy for graphs
- Topological entropy and the complete invariant for expansive maps
- Topological entropy for geodesic flows
- Topology and data
- Volume entropy, weighted girths and stable balls on graphs
- Volume et entropie minimale des espaces localement symétriques. (Minimal volume and entropy of locally symmetric spaces)
Cited in
(6)
This page was built for publication: Notes on the values of volume entropy of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2191141)
