Power method and centrality
The Endeavour 2024-06-12
Summary:
A few days ago I wrote about eigenvector centrality, a way of computing which nodes in a network are most important. Rather than simply looking for the most highly connected nodes, it looks for nodes that are highly connected to nodes that are highly connected. It’s the idea behind Google’s PageRank algorithm. Adjacency matrices One […]
The post Power method and centrality first appeared on John D. Cook.