Path homology and temporal networks

arXiv2008.11885MaRDI QIDQ6347823

Author name not available (Why is that?)

Publication date: 26 August 2020

Abstract: We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The digraphs analyzed 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 $2$ for three temporal networks, and relate these digraphs to network behavior. We conclude that path homology can provide insight into temporal network structure and vice versa.

Has companion code repository: https://github.com/SteveHuntsman/PathHomologyDataAndScripts

This page was built for publication: Path homology and temporal networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347823)