Wolfram Language & System 10.3 (2015)|Legacy Documentation
gives the link-rank centralities for edges in the graph g and weight α.
gives the link-rank centralities, using weight α and initial vertex page-rank centralities β.
uses rules to specify the graph g.
- Link-rank centralities represent the likelihood that a person randomly follows a particular link on the web graph.
- Link rank is a way of measuring the importance of links between vertices.
- The link-rank centrality of an edge is the page-rank centrality of its source vertex, divided by its out-degree.
- If β is a scalar, it is taken to mean .
- LinkRankCentrality[g,α] is equivalent to LinkRankCentrality[g,α,1/VertexCount[g]].
- Link-rank centralities are normalized.
- The option WorkingPrecision->p can be used to control the precision used in internal computations.
- LinkRankCentrality works with undirected graphs, directed graphs, multigraphs, and mixed graphs.