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 outer-degree of u.
|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|
|© 2013 Wolfram Research, Inc.|