Previous | Next --- Slide 18 of 42
Back to Lecture Thumbnails

Whenever a vertex is not converged, it will schedule all its neighbours to be updated. So the changes in pagerank of a vertex will be propagated to its neighbors, and potentially the neighbors of neighbors, if it makes some neighbor not converged, etc.


But this is a necessary step because otherwise we may preemptively decide that the pagerank has converged when actually by updating a vertex, we drastically change the values of nearby vertices.