Path homologies of motifs and temporal network representations

Applied Network Science

Steve Huntsman¹  Matvey Yutin²  Samir Chowdhury³ 

[1] Alexandria, Virginia, USA;Fairfax, Virginia, USA;Stanford University, Stanford, USA;

关键词: Path homology;    Topological data analysis;    Temporal networks;   

DOI  :  10.1007/s41109-021-00441-z

来源: Springer

【 摘 要 】

Path homology is a powerful method for attaching algebraic invariants to digraphs. While there have been growing theoretical developments on the algebro-topological framework surrounding path homology, bona fide applications to the study of complex networks have remained stagnant. We address this gap by presenting an algorithm for path homology that combines efficient pruning and indexing techniques and using it to topologically analyze a variety of real-world complex temporal networks. A crucial step in our analysis is the complete characterization of path homologies of certain families of small digraphs that appear as subgraphs in these complex networks. These families include all digraphs, directed acyclic graphs, and undirected graphs up to certain numbers of vertices, as well as some specially constructed cases. Using information from this analysis, we identify small digraphs contributing to path homology in dimension two for three temporal networks in an aggregated representation and relate these digraphs to network behavior. We then investigate alternative temporal network representations and identify complementary subgraphs as well as behavior that is preserved across representations. We conclude that path homology provides insight into temporal network structure, and in turn, emergent structures in temporal networks provide us with new subgraphs having interesting path homology.

【 授权许可】

CC BY