LinkRank: PageRank for edges

[szhorvat]

What is the feature or improvement you would like to see?

Implement LinkRank, which is the equivalent of PageRank: what fraction of its time does a random walker spend on each edge?

This is already implemented in IGraph/M.

Use cases for the feature

This is a straightforward to implement edge centrality measure.

Implementation

Please see the comments in the IGraph/M docs (in references). The steps are:

1. Compute PageRank
2. For each vertex v, set the LinkRank of each of its outgoing edges e to pagerank(v) * weight(e) / strength(v).

References

• https://arxiv.org/abs/0902.3728
• http://szhorvat.net/mathematica/IGDocumentation/#linkrank