LinkRankMatrix
LinkRankMatrix[g]
returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u->v is defined as the PageRanks of u, divided by the out-degree of u.
Details and Options
- LinkRankMatrix functionality is now available in the built-in Wolfram Language function LinkRankCentrality.
- To use LinkRankMatrix, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The following options can be given:
-
Tolerance Automatic tolerance used for convergence check TeleportProbability 0.15 probability of visiting random nodes RemoveSinks True whether to remove sinks by linking them with every node - The link rank of a link from vertex i to vertex j is defined as page rank of i, as given by PageRanks[g], divided by the out-degree of i.
- The link rank reflects the probability that a random surfer follows that link.
- LinkRankMatrix has the same options as PageRanks.
Examples
open all close allBasic Examples (2)
This shows a small network of web pages:
This calculates the link ranks:
LinkRankMatrix has been superseded by LinkRankCentrality:
Text
Wolfram Research (2007), LinkRankMatrix, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/LinkRankMatrix.html.
CMS
Wolfram Language. 2007. "LinkRankMatrix." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/LinkRankMatrix.html.
APA
Wolfram Language. (2007). LinkRankMatrix. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/LinkRankMatrix.html