Mathematica 9 is now available

SEARCH MATHEMATICA 8 DOCUMENTATION

THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

Graph Utilities Package >

Graph Utilities Package Symbol

Tutorials »|See Also »|More About »

PageRanks

PageRanks[g]
gives the page rank of the graph g as a rule list.

MORE INFORMATION

To use PageRanks, 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 page rank of a node measures the probability of a web surfer visiting that node. At any node, the surfer is assumed to follow all outlinks with equal probability; in addition, the surfer may visit any node randomly with a certain probability (TeleportProbability).

The page rank algorithm uses an iterative procedure to find the page ranks. When the average change in the page ranks is less than the setting for Tolerance, the iterative process terminates.

Basic Examples (1)

Needs["GraphUtilities`"]

This defines a small graph:

This finds the page rank of each node:

This boost the page rank of the "home" page by adding more feedback links:

PageRankVector LinkRanks LinkRankMatrix

Graph Utilities Package

Graph Utilities Package

© 2013 Wolfram Research, Inc.

Ask a question about this page | Suggest an improvement | Leave a message for the team