A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
DOI10.1007/s41468-023-00129-6WikidataQ123345582 ScholiaQ123345582MaRDI QIDQ6650230
Unnamed Author, David F. Gleich, Yufan Huang
Publication date: 6 December 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
networksgraphsspectral embeddingpersonalized PageRankLaplacian eigenvectorslow dimensional embeddings
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inference from stochastic processes and spectral analysis (62M15) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)
This page was built for publication: A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings