Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Persistent homology based Wasserstein distance for graph networks
View through CrossRef
The technique of measuring similarity between topological spaces using Wasserstein distance between persistence diagrams is extended to graph networks in this paper. A relationship between the Wasserstein distance of the Cartesian product of topological spaces and the Wasserstein distance of individual spaces is found to ease the comparative study of the Cartesian product of topological spaces. The Cartesian product and the strong product of weighted graphs are defined, and the relationship between the Wasserstein distance between graph products and the Wasserstein distance between individual graphs is determined. For this, clique complex filtration and the Vietoris- Rips filtration are used.
Hacettepe University
Title: Persistent homology based Wasserstein distance for graph networks
Description:
The technique of measuring similarity between topological spaces using Wasserstein distance between persistence diagrams is extended to graph networks in this paper.
A relationship between the Wasserstein distance of the Cartesian product of topological spaces and the Wasserstein distance of individual spaces is found to ease the comparative study of the Cartesian product of topological spaces.
The Cartesian product and the strong product of weighted graphs are defined, and the relationship between the Wasserstein distance between graph products and the Wasserstein distance between individual graphs is determined.
For this, clique complex filtration and the Vietoris- Rips filtration are used.
Related Results
Reflexive homology
Reflexive homology
Reflexive homology is the homology theory associated to the reflexive crossed simplicial group; one of the fundamental crossed simplicial groups. It is the most general way to exte...
Applications of the Bures-Wasserstein Distance in Linear Metric Learning
Applications of the Bures-Wasserstein Distance in Linear Metric Learning
<p><b>Metric Learning has proved valuable in information retrieval and classification problems, with many algorithms using statistical formulations to their advantage. ...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Problèmes variationnels pour l'interpolation dans l’espace de Wasserstein
Problèmes variationnels pour l'interpolation dans l’espace de Wasserstein
Cette thèse étudie des problèmes variationnels comprenant plusieurs fonctionnelles de transport optimal. Un exemple populaire est le barycentre Wasserstein qui peut être vu en tant...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Formation of machine learning features based on computational topology methods
Formation of machine learning features based on computational topology methods
The use of traditional methods of algebraic topology to obtain information about the shape of an object is associated with the problem of forming a small amount of information: Bet...
Vulnerability and robustness of networked infrastructures: beyond typical graph-based measures
Vulnerability and robustness of networked infrastructures: beyond typical graph-based measures
<p>The issue of vulnerability and robustness in networked systems can be addressed by several methods. The most widely used are based on a set of centrality and conne...
Isolation Graph Kernel
Isolation Graph Kernel
A recent Wasserstein Weisfeiler-Lehman (WWL) Graph Kernel has a distinctive feature: Representing the distribution of Weisfeiler-Lehman (WL)-embedded node vectors of a graph in a h...