Graph Data Science

PageRank

A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are.

Example

Two people follow Dan, and Dan follows Eve. Two people follow Fay, and nobody follows either of them.

cypher
CALL gds.pageRank.stream('people')
YIELD nodeId, score
RETURN gds.util.asNode(nodeId).name AS person, score
ORDER BY score DESC

Eve scores highest, on one follower. That follower is Dan, whom two people follow. Fay has two followers of her own and scores exactly what Dan does, because neither Cleo nor Gus brings anything to pass on.

Lessons that use this term

The lesson and course links below open in a new tab.

No published lesson uses this term yet.

All glossary terms