2000 character limit reached
Persistent Homology on a lattice of multigraphs (2502.02151v1)
Published 4 Feb 2025 in math.AT and q-bio.NC
Abstract: A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process of merging multigraphs in the calculation of the Betti numbers. For the latter, an extended version of the incremental algorithm is provided. The ideas here developed are mainly oriented to the original example described in [10] and used more extensively in [11] in the context of the formalization of the notion of embodiment in Neuroscience.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.