Message-passing graph persistence
Message-passing graph neural networks (GNNs) are limited in expressive power by the one-dimensional Weisfeiler-Leman test. Persistent homology (PH) provides topological descriptors that can complement GNN representations, but existing approaches typically compute persistence separately from the…
By Jorge Luiz Franco, Arthur Queiroz Moura, Moacir Ponti, Amauri SouzaarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Nov 5, 2026.
Comments
Sign in to join the discussion.