 |
SOLUTIONS
|
|
|
|
||
|
|
| GRAPH UTILITIES PACKAGE SYMBOL | Tutorials »|See Also »|More About » |
| LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge  is defined as the PageRanks of u, divided by the outer-degree of u. |
, you first need to load the Graph Utilities Package using 
.| 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 |
to vertex 
is defined as page rank of i, as given by PageRanks[g], divided by the outdegree of i.
has the same options as PageRanks.
|
Choose Language
  |
EXAMPLES
Basic Examples 
