Papers
Topics
Authors
Recent
Search
2000 character limit reached

Towards a Unified Theory of Time-Varying Data

Published 31 Jan 2024 in math.CT and cs.DS | (2402.00206v3)

Abstract: What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a general theory of temporal data by introducing categories of narratives. These are sheaves on posets of time intervals that encode snapshots of a temporal object along with the relationships between them. This theory satisfies five desiderata distilled from the burgeoning field of time-varying graphs: (D1) it defines both time-varying objects and their morphisms; (D2) it distinguishes between cumulative and persistent interpretations and provides principled methods for transitioning between them; (D3) it systematically lifts static notions to their temporal analogues; (D4) it is object agnostic; (D5) it integrates with theories of dynamical systems. To achieve this, we build upon existing categorical and sheaf-theoretic approaches to temporal graph theory, generalizing them to any category with limits and colimits. We also formalize tacit intuitions that, while present, often remain implicit in temporal graph theory. Beyond synthesizing and reformulating existing ideas in categorical language, we introduce sheaf-theoretic constructions and prove results that, to our knowledge, have not appeared in the temporal data literature - such as the adjunction between persistent and cumulative narratives. More importantly, we integrate these existing and novel elements into a consistent and coherent framework, setting the stage for a unified theory of time-varying data.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. A compositional account of motifs, mechanisms, and dynamics in biochemical regulatory networks. arXiv preprint arXiv:2301.01445 (2023).
  2. Augustine, S. Confessions. vol. i: Books 1-8., edited and translated by c j.-b. hammond. loeb classical library 27, isbn 0-67499685-2. Exemplaria classica: journal of classical philology, 19 (2015), 381–382.
  3. Augustine, S. Confessions, volume ii: Books 9–13. edited and translated by c j.-b. hammond. loeb classical library 27, isbn 0-67499693-3, 2016.
  4. Awodey, S. Category theory. Oxford University Press, 2010. ISBN:0199237182.
  5. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (New York, NY, USA, 2006), KDD ’06, Association for Computing Machinery, p. 44–54.
  6. On the enumeration of maximal (δ𝛿\deltaitalic_δ, γ𝛾\gammaitalic_γ)-cliques of a temporal network. In Proceedings of the ACM India Joint International Conference on Data Science and Management of Data (2019), pp. 112–120.
  7. Listing all maximal k-plexes in temporal graphs. Journal of Experimental Algorithmics (JEA) 24 (2019), 1–27.
  8. Bumpus, B. M. Generalizing graph decompositions. PhD thesis, University of Glasgow, 2021.
  9. Edge exploration of temporal graphs. Algorithmica (2022), 1–29.
  10. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems 27, 5 (2012), 387–408.
  11. Curry, J. Sheaves, cosheaves and applications, 2014.
  12. Curry, J. M. Topological data analysis and cosheaves. Japan Journal of Industrial and Applied Mathematics 32, 2 (Jul 2015), 333–371.
  13. Categorified reeb graphs. Discrete & Computational Geometry 55, 4 (Jun 2016), 854–906.
  14. Epidemics on dynamic networks. Epidemics 24 (2018), 88–97.
  15. Deleting edges to restrict the size of an epidemic in temporal networks. Journal of Computer and System Sciences 119 (2021), 60–77.
  16. Assigning times to minimise reachability in temporal graphs. Journal of Computer and System Sciences 115 (2021), 169–186.
  17. An Invitation to Applied Category Theory: Seven Sketches in Compositionality. Cambridge University Press, 2019.
  18. Dynamic graph models. Mathematical and Computer Modelling 25, 7 (1997), 79–87.
  19. Temporal interval cliques and independent sets. Theoretical Computer Science (2023), 113885.
  20. Adapting the bron–kerbosch algorithm for enumerating maximal cliques in temporal graphs. Social Network Analysis and Mining 7 (2017), 1–16.
  21. Holme, P. Modern temporal network theory: a colloquium. The European Physical Journal B 88, 9 (2015), 1–30.
  22. Temporal networks. Physics Reports 519, 3 (2012), 97–125. Temporal Networks.
  23. Protocols and impossibility results for gossip-based communication mechanisms. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. (2002), pp. 471–480.
  24. Connectivity and inference problems for temporal networks. Journal of Computer and System Sciences 64, 4 (2002), 820–842.
  25. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (New York, NY, USA, 2003), KDD ’03, Association for Computing Machinery, p. 137–146.
  26. Extracting persistent clusters in dynamic data via möbius inversion. Discrete & Computational Geometry (Oct 2023).
  27. Adhesive categories. In Foundations of Software Science and Computation Structures (Berlin, Heidelberg, 2004), I. Walukiewicz, Ed., Springer Berlin Heidelberg, pp. 273–288.
  28. Le Poidevin, R. The Experience and Perception of Time. In The Stanford Encyclopedia of Philosophy, E. N. Zalta, Ed., Summer 2019 ed. Metaphysics Research Lab, Stanford University, 2019.
  29. Leal, W. Exploration of Chemical Space: Formal, chemical and historical aspects. PhD thesis, Dissertation, Leipzig, Universität Leipzig, 2022, 2022.
  30. Exploration of the chemical space and its three historical regimes. Proceedings of the National Academy of Sciences 116, 26 (2019), 12660–12665.
  31. Sheaves in geometry and logic: A first introduction to topos theory. Springer Science & Business Media, 2012.
  32. Master, J. The Open Algebraic Path Problem. In LIPIcs Proceedings of CALCO 2021 (2021), Schloss Dagstuhl, pp. 20:1–20:20.
  33. Michail, O. An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics 12, 4 (2016), 239–280.
  34. Isolation concepts applied to temporal clique enumeration. Network Science 9, S1 (2021), S83–S105.
  35. Categorical Data Structures for Technical Computing. Compositionality 4 (Dec. 2022).
  36. Riehl, E. Category theory in context. Courier Dover Publications, 2017. ISBN:048680903X.
  37. Rosiak, D. Sheaf Theory through Examples. The MIT Press, 10 2022.
  38. Multi-species temporal network of livestock movements for disease spread. Applied Network Science 6, 1 (2021), 1–20.
  39. Temporal type theory: A topos-theoretic approach to systems and behavior. arXiv preprint arXiv:1710.10258 (2017).
  40. Dynamical systems and sheaves. Applied Categorical Structures 28, 1 (2020), 1–57.
  41. Identifying roles in an ip network with temporal and structural density. In 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) (2014), IEEE, pp. 801–806.
  42. Computing maximal cliques in link streams. Theoretical Computer Science 609 (2016), 245–252.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 3 tweets with 6 likes about this paper.

Sign Up for Free