arXiv AI
1d ago

Message-passing graph persistence

The paper introduces Message‑Passing Graph Persistence (MGP), a new family of topological descriptors that integrates message‑passing into graph filtrations. By updating node embeddings at each filtration step and using them to determine persistence events and component representatives, MGP remains invariant under graph isomorphism and is proven to be strictly more expressive than existing PH‑based descriptors. Experiments on expressivity benchmarks and various graph classification and regression datasets demonstrate that MGP outperforms other PH‑based methods on most tasks.

By Jorge Luiz Franco, Arthur Queiroz Moura, Moacir Ponti, Amauri Souza
arXiv Machine Learning
Jun 18

Unreduced Persistence Diagrams for Topological Machine Learning

arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.

By Nicole Abreu, Parker B. Edwards, Francis Motta