We outline an approach for re-interpreting methods for ranking web pages based on interesting recent work on matrix power series representations for PageRank and its variants, such as Linear Rank, HyperRank and TotalRank. This is based on some novel properties of Google type matrices. Multidamping can be generalized and could help in the exploration of new approximations of PageRank.