Persistent path homology of directed networks

MaRDI QIDQ4607962zbMATH OpenFDO

Authors Samir Chowdhury, Facundo Mémoli

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1701.00565, http://dl.acm.org/citation.cfm?id=3175345

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a construction of homology of digraphs due to Grigor'yan, Lin, Muranov and Yau, and extend this construction to the persistent framework. The result, which we call persistent path homology, can provide information about the digraph structure of a directed network at varying resolutions. Moreover, this method encodes a rich level of detail about the asymmetric structure of the input directed network. We test our method on both simulated and real-world directed networks and conjecture some of its characteristics.

Recommendations

• Persistent homology over directed acyclic graphs
• Path homology of directed hypergraphs
• A functorial Dowker theorem and persistent homology of asymmetric networks
• Persistent homology of vertex-weighted digraphs
• Rips filtrations for quasimetric spaces and asymmetric functions with stability results

Cited in

(32)

• Persistent homology over directed acyclic graphs
• Path homology theory of multigraphs and quivers
• Evolutionary de Rham-Hodge method
• Graph pseudometrics from a topological point of view
• The Fréchet mean of inhomogeneous random graphs
• An efficient algorithm for 1-dimensional (Persistent) path homology
• ANAPT: additive noise analysis for persistence thresholding
• Complexes of tournaments, directionality filtrations and persistent homology
• Rips filtrations for quasimetric spaces and asymmetric functions with stability results
• A functorial Dowker theorem and persistent homology of asymmetric networks
• Path homology theory of edge-colored graphs
• On persistent directed graphs
• Persistent Homology Lower Bounds on High-Order Network Distances
• Persistence of Conley-Morse graphs in combinatorial dynamical systems
• Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
• An efficient algorithm for 1-dimensional (persistent) path homology
• A directed persistent homology theory for dissimilarity functions
• Steady and ranging sets in graph persistence
• What Are Higher-Order Networks?
• Persistent path Laplacian
• Distances and isomorphism between networks: stability and convergence of network invariants
• Simplicial approach to path homology of quivers, marked categories, groups and algebras
• Sampling random graph homomorphisms and applications to network data analysis
• ChatGPT for computational topology
• Hochschild homology, and a persistent approach via connectivity digraphs
• First Betti number of the path homology of random directed graphs
• Grounded persistent path homology: a stable, topological descriptor for weighted digraphs
• Monoidal Rips: stable multiparameter filtrations of directed networks
• A survey of simplicial, relative, and chain complex homology theories for hypergraphs
• A long exact sequence of path homology of digraphs
• Topological sequence analysis of genomes: Delta complex approaches
• Topological graph persistence

This page was built for publication: Persistent path homology of directed networks

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