Random walk with restart on large graphs using block elimination

DOI10.1145/2901736MaRDI QIDQ5012556zbMATH OpenOpenAlexFDO

Authors Jinhong Jung, Kijung Shin, Lee Sael, U. Kang

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2901736

zbMATH Keywords

proximityrandom walk with restartranking in graphrelevance score

Mathematics Subject Classification ID

Random walks on graphs (05C81) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Computational aspects of data analysis and big data (68T09)

Recommendations

• Random walk with restart: fast solutions and applications
• A matrix sampling approach for efficient SimRank computation
• An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
• Fast, memory-efficient low-rank approximation of SimRank
• Scalable Katz ranking computation in large static and dynamic graphs

Cited in

(3)

• Relational retrieval using a combination of path-constrained random walks
• Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
• Random walk with restart: fast solutions and applications

This page was built for publication: Random walk with restart on large graphs using block elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012556)