Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.
problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.
Proposes deep graph persistence to address neural persistence issues in deep learning.
problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.
Persistent homology enhances graph classification by capturing long-range graph properties.
problem Lack of formal assessment of persistent homology in graph learning.
method Brief introduction and theoretical discussion of persistent homology in graph context, followed by empirical analysis.
result Persistent homology improves graph classification, especially for data with prominent topological structures.
Unified pipeline classifies time series using complex networks and persistent homology.
problem Classifying univariate time series using various graph constructions and metrics.
method Time series to graph, graph to dissimilarity matrix, filtration to persistence diagrams, vectorization to features.
result Persistence-based features are robust to noise and optimal graph type depends on signal structure.
The article uses PageRank and persistent homology for scalable graph comparison.
problem Comparing the similarities between complex networks.
method Combines PageRank and persistent homology to compute a scalable graph descriptor.
result Shows the effectiveness of the method on shape mesh datasets.
Persistence diagrams, the most common descriptors of Topological Data Analysis, encode topological properties of data and have already proved pivotal in many different applications of data science. However, since the (metric) space of persistence diagrams is not Hilbert, they end up being difficult inputs for most Mach…
New method enhances graph neural networks using contractions and hourglass persistence.
problem Limitations of traditional persistent homology in graph neural networks.
method Hourglass Persistence, Contraction Homology, contractions as a topological operation.
result Hourglass Persistence boosts expressivity, learnability, and stability in graph representation learning.
TopInG improves graph interpretability using persistent homology.
problem Lack of interpretability in Graph Neural Networks (GNNs).
method TopInG uses persistent homology to identify persistent rationale subgraphs in graphs.
result TopInG improves predictive accuracy and interpretability compared to state-of-the-art methods.
Enhances graph embeddings by preserving graph topology.
problem Node2vec struggles to recreate the topology of input graphs.
method Introduces a topological loss term to Node2vec, aligning the persistence diagram of the embedding to that of the input graph.
result Reconstructs both geometry and topology of input graphs.
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …
This work characterizes topological descriptors of graph products and their expressive power.
problem Capturing multiscale structural information in graph products using topological descriptors.
method Analysis of various filtrations on graph products, including Euler characteristic and persistent homology.
result Persistent homology of graph products contains more information than individual graphs.
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this end, we leverage persistent homology computed via a real-valued, learnable, filte…
Recently many efforts have been made to incorporate persistence diagrams, one of the major tools in topological data analysis (TDA), into machine learning pipelines. To better understand the power and limitation of persistence diagrams, we carry out a range of experiments on both graph data and shape data, aiming to de…
We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these …
Enhances graph neural networks with spectral and topological information.
problem Improving graph neural networks' expressivity beyond Weisfeiler-Leman hierarchy.
method Integrates spectral information into Persistent Homology diagrams.
result SpectRe is strictly more expressive than PH and spectral information alone.
PES method reduces bias in gradient estimation for unrolled graphs.
problem High variance and bias in gradient estimation for unrolled computation graphs.
method Divide graph into unrolls, apply ES update, accumulate correction terms.
result PES provides unbiased, low-variance gradient estimates.
PHLP uses persistent homology to interpret graph link prediction.
problem Interpreting why graph neural network models perform well in link prediction.
method Employing persistent homology to analyze graph topology and extract features.
result PHLP outperforms state-of-the-art models on most benchmark datasets.
We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning than existing topological invariants, such as persistence barcodes and Reeb graph…
Framework for universal graph function approximators outperforms existing methods.
problem Graph classification and separation of graph classes.
method Inspired by persistent homology, dependency parsing, and multivalued functions, the framework constructs universal approximators on graph isomorphism classes.
result Achieves state-of-the-art performance on four graph datasets.
TOGL adds topological info to GNNs, improving graph and node classification.
problem Graph neural networks lack substructure awareness, especially cycles.
method Integrates global topological information using persistent homology.
result Improves predictive performance for graph and node classification.
This study uses persistent homology to analyze complex transitional networks from time series data.
problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.
PMP extends GNNs to handle past states efficiently.
problem Efficient querying of data structures dependent on previous states.
method Persistent Message Passing (PMP) which persists past states through new nodes.
result Significantly outperforms GNNs in handling out-of-distribution data.
Z-GCNETs uses topological data to improve time series forecasting.
problem Improving time series forecasting accuracy.
method Integrates topological data into graph convolutional networks (GCNs) using zigzag persistence.
result Z-GCNETs outperforms 13 state-of-the-art methods in traffic forecasting and Ethereum price prediction.
While many approaches to make neural networks more fathomable have been proposed, they are restricted to interrogating the network with input data. Measures for characterizing and monitoring structural properties, however, have not been developed. In this work, we propose neural persistence, a complexity measure for ne…
Although the computational and statistical trade-off for modeling single graphs, for instance, using block models is relatively well understood, extending such results to sequences of graphs has proven to be difficult. In this work, we take a step in this direction by proposing two models for graph sequences that captu…
The evolution with time of the correlation structure of equity returns is studied by means of a filtered network approach investigating persistences and recurrences and their implications for risk diversification strategies. We build dynamically Planar Maximally Filtered Graphs from the correlation structure over a rol…
With emergence of blockchain technologies and the associated cryptocurrencies, such as Bitcoin, understanding network dynamics behind Blockchain graphs has become a rapidly evolving research direction. Unlike other financial networks, such as stock and currency trading, blockchain based cryptocurrencies have the entire…
Novel TRI-GNN framework improves graph classification robustness.
problem Graph neural networks suffer from over-smoothing and vulnerability to graph perturbations.
method Integrates higher-order graph information via persistent homology and local graph structure learning.
result TRI-GNN outperforms state-of-the-art baselines on node classification tasks.
Improved persistence spheres map measures to functions, stable under partial transport.
problem Representing and comparing measures in topological machine learning.
method Persistence spheres map measures to continuous functions on the sphere, stable under 1-Wasserstein partial transport.
result Persistence spheres provide a stable, parameter-free representation of measures, improving upon existing methods.
New method recovers graph latent positions under edge differential privacy.
problem Recovering latent graph information from privatized graphs.
method Applying geometric insights to adjust statistical inference for privatized graphs.
result Achieves consistent recovery of latent positions under local edge differential privacy constraints.
We study soft persistence (existence in subsequent temporal layers of motifs from the initial layer) of motif structures in Triangulated Maximally Filtered Graphs (TMFG) generated from time-varying Kendall correlation matrices computed from stock prices log-returns over rolling windows with exponential smoothing. We ob…
New method reduces spatial graphs while preserving their topological features.
problem Finding a smaller spatial graph with the same structure.
method Topological spatial graph coarsening approach based on triangle-aware graph filtration.
result Significant reduction in graph size while preserving topological information.
STRAND: A single representation for hypothesis testing and vectorisation of persistence diagrams
problem Comparing persistence diagrams
method Survival topological representation analysis
result Non-parametric two-sample test with calibrated Type I error and high power
DYMAG uses dynamic waveforms to improve graph neural networks.
problem Improving graph neural networks for better graph understanding.
method DYMAG employs dynamical system-based waveforms for message aggregation in graph neural networks.
result DYMAG outperforms baseline models in graph recovery, property prediction, and random graph generation.
Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.
problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.
Estimates and quantizes expected persistence diagrams for efficient analysis.
problem Statistical summary of the topology of structured data.
method Expected Persistence Diagram (EPD) and its quantization.
result Optimal estimation of EPD with near-optimal quantization.
Algorithm estimates parameters over time-varying graphs without special assumptions.
problem Estimating parameters over time-varying graphs without assuming independence.
method Decentralized online regularized learning with innovation, consensus, and regularization terms.
result Estimations converge almost surely under certain conditions.
Survey on optimizing topological descriptors for machine learning.
problem Optimizing topological priors in machine learning models.
method Minimizing topologically-informed losses using gradient descent.
result Various techniques enable optimization of persistence-based loss functions.
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpose. However, most of existing Bayesian optimization algorithms can only handle vector data and canno…
Bi-filtration stabilizes TDA mapper results under noise.
problem Stability issues in TDA mapper results under data perturbation.
method Introduced bi-filtration approach to stabilize mapper graphs.
result Persistent homology of perturbed data set is 2δ-interleaved with original.
This study analyzes economic policy uncertainty indices using visibility graphs.
problem Understanding the role of economic policy uncertainty in global economies.
method Visibility graph algorithm applied to economic policy uncertainty indices.
result The economic policy uncertainty indices exhibit persistent behavior and scale-free networks.
We present an approach to model time series data from resting state fMRI for autism spectrum disorder (ASD) severity classification. We propose to adopt kernel machines and employ graph kernels that define a kernel dot product between two graphs. This enables us to take advantage of spatio-temporal information to captu…
Graph neural networks suffer from oversmoothing, but adding residual connections helps.
problem Oversmoothing in deep graph neural networks where features become indistinguishable.
method Analyzed asymptotic oversmoothing rates with and without residual connections using the multiplicative ergodic theorem.
result Adding residual connections effectively mitigates or prevents oversmoothing.
In this study, we present and analyze a framework for geometric and topological estimation for mapping of unknown environments. We consider agents mimicking motion behaviors of cyborg insects, known as biobots, and exploit coordinate-free local interactions among them to infer geometric and topological information abou…
SLIM model tackles graph classification by resolving part-interaction dilemmas.
problem Difficulty in modeling graph parts and their interactions in graph classification.
method SLIM model, which solves resolution dilemmas and leverages explicit interactions.
result SLIM offers improved interpretability, accuracy, and new insights in graph representation learning.
Approaches for approximating persistent homology for large datasets.
problem Inability to compute persistent homology for large datasets.
method Multiple subsampling framework for statistical approximation of persistent homology.
result Derivation of finite sample convergence rates for empirical means of persistent homology.
Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is that it allows one to apply tools from statistics and machine lea…
Paper proves k-means clustering works on persistence diagrams.
problem Complex geometry of persistence diagram space.
method Proves convergence of k-means on persistence diagram space. result Performance of k-means on persistence diagrams and measures is superior.