According to this source (https://www.mathworks.com/help/matlab/ref/graph.centrality.html#inputarg_type) PageRank can be directed or undirected whereas eigenvalue centrality is strictly undirected. I'm having a hard time understanding why this is true (e.g. what is the core difference between eigenvalue centrality vs undirected PageRank) – I'm hoping once I understand this perhaps I'll have a better understanding of the fundamental differences between how these two methods work. Any help would be much appreciated!
MATLAB: Eigenvector centrality vs pagerank
eigenvector centralitygraph theorygraphsnodespagerank
Best Answer