We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we apply our results to construct efficient algorithms for the person name disambiguation problem. We argue that when finding top-k Personalized PageRa...

T. Abe, Shin-Etsu Handotai S. Broydo, Applied Materials L. DeVito, Analog Devices, Inc. C. Fine, MIT N. Fiore, Walsin-Lihwa Corporation E. Fitzgerald, MIT S. Fuller, Analog Devices, Inc. M. Gentili, Pirelli F. Giacometti, Pirelli G. Grasso, Pirelli J. Haavisto, Draper Labs F. Hakimi, Draper Labs W. Harshbarger, Applied Materials H. Haus, MIT E. Ippen, MIT J. Joannopoulos, MIT C. Joyce, National...

We propose a restarted Arnoldi's method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the beneet obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. M ethode d'Arnoldi-Faber pour les probl emes aux valeurs propres no...