DeepAI AI Chat
Log In Sign Up

Graph Similarity Using PageRank and Persistent Homology

by   Mustafa Hajij, et al.
Michigan State University
University of South Florida

The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph. In this work, we utilize the PageRank function on the lower-star filtration of the graph as input to persistent homology to study the problem of graph similarity. By representing each graph as a persistence diagram, we can then compare outputs using the bottleneck distance. We show the effectiveness of our method by utilizing it on two shape mesh datasets.


page 1

page 2


Persistent Homology and Graphs Representation Learning

This article aims to study the topological invariant properties encoded ...

Mesh Learning Using Persistent Homology on the Laplacian Eigenfunctions

We use persistent homology along with the eigenfunctions of the Laplacia...

Graph Filtration Learning

We propose an approach to learning with graph-structured data in the pro...

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to thi...

Persistence Diagram Bundles: A Multidimensional Generalization of Vineyards

A persistence diagram (PD) summarizes the persistent homology of a filtr...

Stable Signatures for Dynamic Graphs and Dynamic Metric Spaces via Zigzag Persistence

When studying flocking/swarming behaviors in animals one is interested i...

A fast and robust algorithm to count topologically persistent holes in noisy clouds

Preprocessing a 2D image often produces a noisy cloud of interest points...