There are no vertices of zero outdegree. The total rank for the graph with numIter = 10 is 4.99 and for the graph with numIter = 100 is 5.99 I do not know why so much variation.
On Tue, Nov 18, 2014 at 3:22 PM, Ankur Dave <ankurd...@gmail.com> wrote: > At 2014-11-18 12:02:52 +0530, Deep Pradhan <pradhandeep1...@gmail.com> > wrote: > > I just ran the PageRank code in GraphX with some sample data. What I am > > seeing is that the total rank changes drastically if I change the number > of > > iterations from 10 to 100. Why is that so? > > As far as I understand, the total rank should asymptotically approach the > number of vertices in the graph, assuming there are no vertices of zero > outdegree. Does that seem to be the case for your graph? > > Ankur >
