Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, others combinatorial, based on arbitrary set-valued functors. To unify the study of topological and combinatorial persistence in a common categorical framework 1 , we give axioms for a generalized rank function on objects in a target category so that functors to that category induce persistence functions. We port the interleaving and bottleneck distances to this novel framework and generalize classical equalities and inequalities. Unlike sets and vector spaces, in many categories the rank of an object does not identify it up to isomorphism: to preserve information about the structure of persistence modules, we define colorable ranks, persistence diagrams and prove the equality between multicolored bottleneck distance and interleaving distance in semisimple Abelian categories. To illustrate our framework in practice, we give examples of multicolored persistent homology on filtered topological spaces with a group action and labeled point cloud data.
Our understanding of collective animal behavior is limited by our ability to track each of the individuals. We describe an algorithm and software, idtracker.ai, that extracts from video all trajectories with correct identities at a high accuracy for collectives of up to 100 individuals. It uses two deep networks, one detecting when animals touch or cross and an-other one for animal identification, trained adaptively to conditions and difficulty of the video.
Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and digraphs. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness—clique communities, k-vertex, and k-edge connectedness—directly on simple graphs and strong connectedness in digraphs.