Path Homology and Temporal Networks
| Autor: | Steve Huntsman, Matvey Yutin, Samir Chowdhury |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematics::Combinatorics
Computer science Dimension (graph theory) Network structure Network behavior Homology (mathematics) Directed acyclic graph Combinatorics Computer Science::Discrete Mathematics Simple (abstract algebra) TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Path (graph theory) Computer Science::Data Structures and Algorithms Undirected graph MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Studies in Computational Intelligence ISBN: 9783030653507 COMPLEX NETWORKS (2) |
| DOI: | 10.1007/978-3-030-65351-4_51 |
| Popis: | 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 two 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|