A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
We study a simple embedding technique based on a matrix of personalized PageRank vectors seeded on a random set of nodes. We show that the embedding produced by the element-wise logarithm of this matrix (1) are related to the spectral embedding for a class of graphs where spectral embeddings are significant, and hence useful representation of the data, (2) can be done for the entire network or a smaller part of it, which enables precise local representation, and (3) uses a relatively small number of PageRank vectors compared to the size of the networks. Most importantly, the general nature of this embedding strategy opens up many emerging applications, where eigenvector and spectral techniques may not be well established, to the PageRank-based relatives. For instance, similar techniques can be used on PageRank vectors from hypergraphs to get "spectral-like" embeddings.
Code (1)
Tasks
Graph EmbeddingSimilar Papers 제목 키워드 기반
TigerLily: Finding drug interactions in silico with the Graph
Tigerlily is a TigerGraph based system designed to solve the drug interaction prediction task. In this machine learning task, we want to predict whether two drugs have an adverse interaction. Our framework allows us to s…
Graph MiningHomogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank
Given an input graph G and a node v in G, homogeneous network embedding (HNE) maps the graph structure in the vicinity of v to a compact, fixed-dimensional feature vector. This paper focuses on HNE for massive graphs, e.…
CPUGraph ReconstructionLink PredictionNetwork Embedding+1Mixture-of-PageRanks: Replacing Long-Context with Real-Time, Sparse GraphRAG
Recent advances have extended the context window of frontier LLMs dramatically, from a few thousand tokens up to millions, enabling entire books and codebases to fit into context. However, the compute costs of inferencin…
CPURAGRetrievalDifferentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
Personalized PageRank (PPR) is a fundamental tool in unsupervised learning of graph representations such as node ranking, labeling, and graph embedding. However, while data privacy is one of the most important recent con…
Graph EmbeddingGraph LearningNode ClassificationSensitivityMean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering
We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values of Personalized PageRank concentrate ar…
ClusteringGraph Clustering