arXiv:2002.05158
Fast and Scalable Complex Network Descriptor Using PageRank and Persistent Homology
원문 초록
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 article, we use the PageRank function along with persistent homology to obtain a scalable graph descriptor and utilize it to compare the similarities between graphs. For a given graph $G(V,E)$, our descriptor can be computed in $O(|E|\alpha(|V|))$, where $\alpha$ is the inverse Ackermann function which makes it scalable and computable on massive graphs. We show the effectiveness of our method by utilizing it on multiple shape mesh datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval
HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity
Quality Measures for Dynamic Graph Generative Models
Neural Network Graph Similarity Computation Based on Graph Fusion
GraSP: Simple yet Effective Graph Similarity Predictions
Covered Forest: Fine-grained generalization analysis of graph neural networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.