Teaching or conference talk
Stanford CS224W: Machine Learning with Graphs | 2021 | Lecture 4.1 - PageRank
PageRank, random walks and matrix factorisation are worked through in a Stanford lecture from Jure Leskovec, which treats graphs as matrices and builds towards node embeddings. Lecture 4.1 of the CS224W course.
Older: check current guidance