The Push Algorithm for Spectral Ranking

Details The Push Algorithm for Spectral Ranking The Push Algorithm for Spectral Ranking

2011-09-22

arxiv.org/abs/1109.4680v1

Computer Science

Social and Information Networks

Scientific paper

The push algorithm was proposed first by Jeh and Widom in the context of personalized PageRank computations (albeit the name "push algorithm" was actually used by Andersen, Chung and Lang in a subsequent paper). In this note we describe the algorithm at a level of generality that make the computation of the spectral ranking of any nonnegative matrix possible. Actually, the main contribution of this note is that the description is very simple (almost trivial), and it requires only a few elementary linear-algebra computations. Along the way, we give new precise ways of estimating the convergence of the algorithm, and describe some of the contribution of the existing literature, which again turn out to be immediate when recast in our framework.

Affiliated with

Also associated with

No associations

Rating

The Push Algorithm for Spectral Ranking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Push Algorithm for Spectral Ranking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Push Algorithm for Spectral Ranking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262026