Magnitude and Topological Entropy of Digraphs
arXiv:2205.05178 · doi:10.4204/EPTCS.380.15
Abstract
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 based on the observation that topological entropy provides a suitable map into the max-plus semiring, and we outline its utility. Subsequently, we identify a separate point of contact between magnitude and topological entropy in digraphs that yields an analogue of volume entropy for geodesic flows. Finally, we sketch the utility of this construction for feature engineering in downstream applications with generic digraphs.
arXiv commentIn Proceedings ACT 2022, arXiv:2307.15519
References in corpus (6)
- Metrics for Graph Comparison: A Practitioner's Guide
- The magnitude of a metric space: from category theory to geometric measure theory
- The magnitude of a graph
- Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces
- The multiresolution analysis of flow graphs
- On the magnitude of a finite dimensional algebra