Towards a Unified Theory of Time-Varying Data
Authors:
- Benjamin Merlin BumpusBBBenjamin Merlin Bumpus
- James FairbanksJFJames Fairbanks
Preprint
Abstract
What is a time-varying graph, or a time-varying topological space and more generally what does it mean for a mathematical structure to vary over time? Here we introduce categories of narratives: powerful tools for studying temporal graphs and other time-varying data structures. Narratives are sheaves on posets of intervals of time which specify snapshots of a temporal object as well as relationships between snapshots over the course of any given interval of time. This approach offers two significant advantages. First, when restricted to the base category of graphs, the theory is consistent with the well-established theory of temporal graphs, enabling the reproduction of results in this field. Second, the theory is general enough to extend results to a wide range of categories used in data analysis, such as groups, topological spaces, databases, Petri nets, simplicial complexes and many more. The approach overcomes the challenge of relating narratives of different types to each other and preserves the structure over time in a compositional sense. Furthermore our approach allows for the systematic relation of different kinds of narratives. In summary, this theory provides a consistent and general framework for analyzing dynamic systems, offering an essential tool for mathematicians and data scientists alike.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Deleting edges to restrict the size of an epidemic in temporal networksJournal of Computer and System Sciences, 2021
- Multi-species temporal network of livestock movements for disease spreadApplied Network Science, 2021
- Assigning times to minimise reachability in temporal graphsJournal of Computer and System Sciences, 2021
- Dynamical Systems and SheavesApplied Categorical Structures, 2019
- Epidemics on dynamic networksEpidemics, 2018
- Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphsSocial Network Analysis and Mining, 2017
- Categorified Reeb GraphsDiscrete & Computational Geometry, 2016
- Computing maximal cliques in link streamsTheoretical Computer Science, 2016
- Topological data analysis and cosheavesJapan Journal of Industrial and Applied Mathematics, 2015
- Connectivity and Inference Problems for Temporal NetworksJournal of Computer and System Sciences, 2002