Fetching the paper…
Reading the bibliography…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification.
Christoph. Hofer et al · 1905
Earlier work this paper cites.
“A congruence theorem for trees”
Paul. Kelly · 1957
Earlier work this paper cites.
“Spectra of graphs with transitive groups”
L. Lovász · 1975
Earlier work this paper cites.
“Chromatic number and subgraphs of Cayley graphs”
László Babai · 1978
Earlier work this paper cites.
“On testing isomorphism of permutation graphs”
Charles. Colbourn · 1981
Earlier work this paper cites.
“Distinguishing Vertices of Random Graphs”
Béla Bollobás · 1982
Earlier work this paper cites.
“Elements of Algebraic Topology”
James. Munkres · 1984
Earlier work this paper cites.
“An optimal lower bound on the number of variables for graph identification”
Jin-yi Cai, Martin Furer and Neil Immerman · 1989
Earlier work this paper cites.
“Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity”
Asim Debnath et al · 1991
Earlier work this paper cites.
“An optimal lower bound on the number of variables for graph identification”
Jin-Yi Cai, Martin Fürer and Neil Immerman · 1992
Earlier work this paper cites.
“Automorphism Groups, Isomorphism, Reconstruction”
László Babai · 1996
Earlier work this paper cites.
“Isomorphism and Cayley graphs on abelian groups”
Brian Alspach · 1997
Earlier work this paper cites.
“On isomorphisms of connected Cayley graphs”
Cai Heng Li · 1998
Earlier work this paper cites.
“The Earth Mover’s distance is the Mallows distance: some insights from statistics”
E. Levina and P. Bickel · 2001
Earlier work this paper cites.
“Vietoris–Rips Persistent Homology, Injective Metric Spaces, and The Filling Radius”, 2020
Sunhyuk Lim, Facundo Memoli and Osman Okutan · 2001
Earlier work this paper cites.
“Topological persistence and simplification”
Herbert Edelsbrunner, David Letscher and Afra. Zomorodian · 2002
Earlier work this paper cites.
“On isomorphisms of finite Cayley graphs—a survey”
Cai Heng Li · 2002
Earlier work this paper cites.
“Laplacian Eigenmaps for Dimensionality Reduction and Data Representation”
Mikhail Belkin and Partha Niyogi · 2003
Earlier work this paper cites.
“A Survey on The Expressive Power of Graph Neural Networks”, 2020
Ryoma Sato · 2003
Earlier work this paper cites.
“Protein function prediction via graph kernels”
Karsten. Borgwardt et al · 2005
Earlier work this paper cites.
“Wasserstein Stability for Persistence Diagrams”, 2020
Primož Škraba and Katharine Turner · 2006
Earlier work this paper cites.
“Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification”
Nikil Wale and George Karypis · 2006
Earlier work this paper cites.
“Stability of persistence diagrams”
David Cohen-Steiner, Herbert Edelsbrunner and John Harer · 2007
Earlier work this paper cites.
“Ricci curvature of metric spaces”
Yann Ollivier · 2007
Earlier work this paper cites.
“Persistent homology of complex networks”
Danijela Horak, Slobodan Maletić and Milan Rajković · 2009
Earlier work this paper cites.
“Optimal Transport”, Grundlehren der mathematischen Wissenschaften 338
Cédric Villani · 2009
Earlier work this paper cites.
“Lipschitz functions have L p \mathrm{L}_{p} -stable persistence”
David Cohen-Steiner, Herbert Edelsbrunner, John Harer and Yuriy Mileyko · 2010
Earlier work this paper cites.
“Computational Topology: An Introduction”, Applied Mathematics
H. Edelsbrunner and J. Harer · 2010
Earlier work this paper cites.
“Weisfeiler–Lehman Graph Kernels”
Nino Shervashidze et al · 2011
Earlier work this paper cites.
“Sinkhorn Distances: Lightspeed Computation of Optimal Transport”
Marco Cuturi · 2013
Earlier work this paper cites.
“Linear-Size Approximations to the Vietoris–Rips Filtration”
Donald. Sheehy · 2013
Earlier work this paper cites.
“Persistence stability for geometric complexes”
Frédéric Chazal, Vin de Silva and Steve Oudot · 2014
Earlier work this paper cites.
“Fréchet Means for Distributions of Persistence Diagrams”
Katharine Turner, Yuriy Mileyko, Sayan Mukherjee and John Harer · 2014
Earlier work this paper cites.
“Persistent homology transform for modeling shapes and surfaces”
Katharine Turner, Sayan Mukherjee and Doug. Boyer · 2014
Earlier work this paper cites.
“On the Power of Color Refinement”
V. Arvind, Johannes Köbler, Gaurav Rattan and Oleg Verbitsky · 2015
Cited alongside, same era.
“Statistical Topological Data Analysis - A Kernel Perspective”
Roland Kwitt et al · 2015
Cited alongside, same era.
“A stable multi-scale kernel for topological machine learning”
J. Reininghaus, S. Huber, U. Bauer and R. Kwitt · 2015
Cited alongside, same era.
“Deep graph kernels”
Pinar Yanardag and SVN Vishwanathan · 2015
Cited alongside, same era.
“Persistent homology analysis of brain artery trees”
Paul Bendich et al · 2016
Cited alongside, same era.
“The structure and stability of persistence modules” 10
Frédéric Chazal, Vin De, Marc Glisse and Steve Oudot · 2016
Cited alongside, same era.
“The Logic of Graph Neural Networks”
Martin Grohe · 2021
Later among the works it cites.
“A Survey of Topological Machine Learning Methods”
Felix Hensel, Michael Moor and Bastian Rieck · 2021
Later among the works it cites.
“Weisfeiler and Leman go Machine Learning: The Story so far”, 2021
Christopher Morris et al · 2021
Later among the works it cites.
“Filtration Curves for Graph Representation”
Leslie O’Bray, Bastian Rieck and Karsten Borgwardt · 2021
Later among the works it cites.
“Topics in Optimal Transportation”
Cédric Villani · 2021
Later among the works it cites.
“Geometric Approaches to Persistent Homology”
Henry Adams and Baris Coskunuzer · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dave Morris, Joy Morris and Gabriel Verret · 2016
Cited alongside, same era.
“Persistence Images: A Stable Vector Representation of Persistent Homology”
Henry Adams et al · 2017
Cited alongside, same era.
“Geometric Deep Learning: Going beyond Euclidean data”
Michael. Bronstein et al · 2017
Cited alongside, same era.
“Deep Learning with Topological Signatures”
Christoph Hofer, Roland Kwitt, Marc Niethammer and Andreas Uhl · 2017
Cited alongside, same era.
“A roadmap for the computation of persistent homology”
Nina Otter et al · 2017
Cited alongside, same era.
“Persistent Homology in Multivariate Data Visualization”, 2017
Bastian Rieck · 2017
Cited alongside, same era.
Ulrich Bauer et al · 2022
Later among the works it cites.
“Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting”
Giorgos Bouritsas, Fabrizio Frasca, Stefanos Zafeiriou and Michael. Bronstein · 2022
Later among the works it cites.
“House of Graphs 2.0: A database of interesting graphs and more”
Kris Coolsaet, Sven D’hondt and Jan Goedgebeur · 2022
Later among the works it cites.
“Computational Topology for Data Analysis”
Tamal Dey and Yusu Wang · 2022
Later among the works it cites.
“Toroidal topology of population activity in grid cells”
Richard. Gardner et al · 2022
Later among the works it cites.
“Topological Graph Neural Networks”
Max Horn et al · 2022
Later among the works it cites.
“The Expressive Power of Graph Neural Networks”
Pan Li and Jure Leskovec · 2022
Later among the works it cites.
“Computational Algebraic Topology Lecture Notes”, https://people.maths.ox.ac.uk/nanda/cat/TDANotes.pdf , 2022
Vidit Nanda · 2022
Later among the works it cites.
“GraphWorld: Fake Graphs Bring Real Insights for GNNs”
John Palowitch, Anton Tsitsulin, Brandon Mayer and Bryan Perozzi · 2022
Later among the works it cites.
“A Theoretical Comparison of Graph Neural Network Extensions”
Pálás Papp and Roger Wattenhofer · 2022
Later among the works it cites.
“On the Effectiveness of Persistent Homology”
Renata Turkeš, Guido Montúfar and Nina Otter · 2022
Later among the works it cites.
“Neural Approximation of Graph Topological Features”
Zuoyu Yan et al · 2022
Later among the works it cites.
“GEFL: Extended Filtration Learning for Graph Classification”
Simon Zhang, Soham Mukherjee and Tamal. Dey · 2022
Later among the works it cites.
“Topological Pooling on Graphs”
Yuzhou Chen and Yulia. Gel · 2023
Closest in time.
“Ollivier–Ricci Curvature for Hypergraphs: A Unified Framework”
Corinna Coupette, Sebastian Dalleiger and Bastian Rieck · 2023
Closest in time.
“Going beyond persistent homology using persistent homology”
Johanna Immonen, Amauri Souza and Vikas Garg · 2023
Closest in time.
“On the Expressive Power of Geometric Graph Neural Networks”
Chaitanya. Joshi et al · 2023
Closest in time.
“Stability and Inference of the Euler Characteristic Transform”, 2023
Lewis Marsh and David Beers · 2023
Closest in time.
“An Invitation to the Euler Characteristic Transform”, 2023
Elizabeth Munch · 2023
Closest in time.
“Curvature Filtrations for Graph Generative Model Evaluation”
Joshua Southern, Jeremy Wayland, Michael Bronstein and Bastian Rieck · 2023
Closest in time.
“Towards Better Evaluation of GNN Expressiveness with BREC Dataset”, 2023
Yanbo Wang and Muhan Zhang · 2023
Closest in time.
“TREPH: A Plug-In Topological Layer for Graph Neural Networks”
Xue Ye, Fang Sun and Shiming Xiang · 2023
Closest in time.
“Topological Data Analysis for Neural Network Analysis: A Comprehensive Survey”, 2024
Rubén Ballester, Carles Casacuberta and Sergio Escalera · 2024
Closest in time.
“Computational complexity of the Weisfeiler-Leman dimension”, 2024
Moritz Lichter, Simon Raßmann and Pascal Schweitzer · 2024
Closest in time.
“Simplicial Representation Learning with Neural k k -forms”
Kelly Maggs, Celia Hacker and Bastian Rieck · 2024
Closest in time.
“Differentiable Euler Characteristic Transforms for Shape Classification”
Ernst Röell and Bastian Rieck · 2024
Closest in time.
“Topological Neural Networks go Persistent, Equivariant, and Continuous”
Yogesh Verma, Amauri Souza and Vikas Garg · 2024
Closest in time.
“Boosting Graph Pooling with Persistent Homology”
Chaolong Ying, Xinjian Zhao and Tianshu Yu · 2024
Closest in time.