Magnitude and Topological Entropy of Digraphs

DOI10.4204/eptcs.380.15arXiv2205.05178OpenAlexW4385349600MaRDI QIDQ6190600

Steve Huntsman

Publication date: 5 March 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.05178

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gromov-Wasserstein distances and the metric approach to object matching
• Topological entropy for geodesic flows
• Fifty years of graph matching, network alignment and network comparison
• The multiresolution analysis of flow graphs
• The Gromov-Wasserstein distance: a brief overview
• The magnitude of a graph
• On the magnitude of a finite dimensional algebra
• Minimal volume entropy for graphs
• A Matrix Iteration for Dynamic Network Summaries
• The Gromov–Wasserstein distance between networks and stable network invariants
• Entropy and Diversity
• Growth of balls in the universal cover of surfaces and graphs
• An Invitation to Applied Category Theory
• Zeta functions of digraphs

This page was built for publication: Magnitude and Topological Entropy of Digraphs