Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification.
Tamal K. DeySimon ZhangPublished in: CoRR (2021)
Keyphrases
- random walk
- graph theory
- directed graph
- structured data
- graph representation
- neighborhood graph
- pointwise
- weighted graph
- stable set
- graphical representation
- graph structure
- bipartite graph
- graph model
- connected components
- distance function
- distance measure
- edge weights
- graph mining
- graph theoretic
- graph clustering
- distance matrix
- graph structures
- directed acyclic graph
- path length
- search engine
- graph matching
- markov random field