Distributing Persistent Homology via Spectral Sequences

Abstract

We set up the theory for a distributed algorithm for computing persistent homology. For this purpose we develop linear algebra of persistence modules. We present bases of persistence modules, and give motivation as for the advantages of using them. Our focus is on developing efficient methods for the computation of homology of chains of persistence modules. Later we give a brief, self contained presentation of the Mayer-Vietoris spectral sequence. Then we study the Persistent Mayer-Vietoris spectral sequence and present a solution to the extension problem. Finally, we review PerMaViss, a method implementing these ideas. This procedure distributes simplicial data, while focusing on merging homological information.