Magnitude and topological entropy of digraphs

05/10/2022
by   Steve Huntsman, et al.
0

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.

READ FULL TEXT
research
11/28/2018

On the relation between topological entropy and restoration entropy

In the context of state estimation under communication constraints, seve...
research
08/14/2018

Complexity of Shift Spaces on Semigroups

Let G=〈 S|R_A〉 be a semigroup with generating set S and equivalences R...
research
07/20/2021

Entropy as a Topological Operad Derivation

We share a small connection between information theory, algebra, and top...
research
03/02/2023

Categorical magnitude and entropy

Given any finite set equipped with a probability measure, one may comput...
research
01/22/2018

Topological Entropy of Formal Languages

In this thesis we will introduce topological automata and the topologica...
research
06/04/2019

On the computability properties of topological entropy: a general approach

The dynamics of symbolic systems, such as multidimensional subshifts of ...
research
10/28/2020

Three Applications of Entropy to Gerrymandering

This preprint is an exploration in how a single mathematical idea - entr...

Please sign up or login with your details

Forgot password? Click here to reset