Enhancing graph representation learning with localized topological features
From MaRDI portal
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- An optimal lower bound on the number of variables for graph identification
- Computational topology. An introduction
- Continuation of point clouds via persistence diagrams
- Data structures for mergeable trees
- Deep learning on graphs
- Distinguishing Vertices of Random Graphs
- Extending persistence using Poincaré and Lefschetz duality
- Extreme elevation on a 2-manifold
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Network alignment by discrete Ollivier-Ricci flow
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Persistence images: a stable vector representation of persistent homology
- Proximity of persistence modules and their diagrams
- Random Graph Isomorphism
- Stability of persistence diagrams
This page was built for publication: Enhancing graph representation learning with localized topological features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982699)