# Why is my PageRank result in Mathematica converging this way?

I am using this technique to find the PR of these 3 pages. It converges to something it shouldn't be. I tried the same iteration in Java and 2 pages come up with 1.333 and the other one as 0.666. Mathematica is calculating something differently. Here's my code:

g = {"Netscape" -> "Amazon", "Netscape" -> "Netscape",
"Amazon" -> "Netscape", "Amazon" -> "Microsoft",
"Microsoft" -> "Amazon"};
pr = PageRankVector[g]
GraphPlot[g,
VertexRenderingFunction -> (Text[
Framed[#2 <> "\n" <>
ToString[pr[[#3]]], {Background -> RGBColor[1, 1, 0.8],
FrameStyle -> RGBColor[0.94, 0.85, 0.36]}], #1] &),
DirectedEdges -> True]
-
You probably have a problem in your Java code or others settings for TeleportProbability. But 1.333 and 0.666 doesn't add up to one, which it should, so I am positive that you have an error in your Java code. –  Pickett Jan 27 at 21:44
How do I set Teleport in Mathematica to 0? And in my Java, I am not using any damping at all, so it's the plain PR formula, as described here infolab.stanford.edu/~ullman/mining/websearch.pdf. I am getting the same results as Stanford, so probably because Mathematica is indeed using a teleportation probability. –  Ali Gajani Jan 27 at 22:35
You have to look in the documentation.  PageRankVector[g,TeleportProbability->0] –  Ajasja Jan 28 at 21:38