Link rank centrality is an edge centrality measure derived from page rank centralities. In a directed graph, the link rank centrality of an edge is the page rank centrality of its source vertex distributed across that vertex's outgoing edges.
Link rank centrality has been used for finding communities in directed networks (Kim et al. 2010), where edge-level scores help describe how importance moves between vertices rather than only which vertices are important.
Link rank centrality is implemented in the Wolfram Language as LinkRankCentrality[g, alpha], and precomputed values for many named graphs can be obtained using GraphData[graph, "LinkRankCentralities"].
