Ranking hubs and authorities using matrix functions

Linear Algebra and Its Applications

Volumn 438, Issue 5, 2013, Pages 2447-2474

  Benzi, Michele ^a   Estrada, Ernesto ^b   Klymko, Christine ^a  

^a EMORY UNIVERSITY   (United States)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Authorities; Bipartite graphs; Centrality; Communicability; Digraphs; Directed networks; Gauss quadrature; HITS; Hubs; Katz; Matrix exponential; Pagerank

Indexed keywords

AUTHORITIES; BIPARTITE GRAPHS; CENTRALITY; COMMUNICABILITY; DIGRAPHS; DIRECTED NETWORK; GAUSS QUADRATURES; HITS; HUBS; KATZ; MATRIX EXPONENTIALS; PAGERANK;

ALGORITHMS; GRAPH THEORY;

TELECOMMUNICATION NETWORKS;

EID: 84872107434     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2012.10.022     Document Type: Article

References (43)

1. Z. Bar-Yossef, L.-T. Mashiach, Local approximation of PageRank and Reverse PageRank, in: Proceedings CKIM'08, October 26-30, 2008, Napa Valley, California.
2. M. Benzi, and P. Boito Quadrature rule-based bounds for functions of adjacency matrices Linear Algebra Appl. 433 2010 637 652
3. M. Benzi, E. Estrada, C. Klymko, Ranking Hubs and Authorities Using Matrix Functions, in: Math/CS Technical Report TR-2012-003, Emory University. Available at http://www.mathcs.emory.edu/publications.php #reports.
4. M. Benzi, and G.H. Golub Bounds on the entries of matrix functions with applications to preconditioning BIT 39 1999 417 438
5. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang Complex networks: structure and dynamics Phys. Rep. 424 2006 175 308
6. F. Bonchi, P. Esfandiar, D.F. Gleich, C. Greif, and L.V.S. Lakshmanan Fast matrix computations for pair-wise and column-wise commute times and Katz scores Internet Math. 8 2012 73 112
7. A. Borodin, G.O. Roberts, J.S. Rosenthal, P. Tsaparas, Finding authorities and hubs from link structures on the World Wide Web, in: Proceedings WWW10 (2001), ACM 1-58113-348-0/01/0005.
8. U. Brandes, and T. Erlebach Network Analysis: Methodological Foundations Lecture Notes in Computer Science vol. 3418 2005 Springer New York
9. G. Caldarelli Scale-free Networks 2007 Oxford University Press Oxford, UK
10. M.C. Crofoot, D.I. Rubenstein, A.S. Maiya, and T.Y. Berger-Wolf Aggression, grooming and group-level cooperation in white-faced capuchins (Cebus capucinus): Insights from social networks Amer. J. Primatol. 73 2011 821 833
11. J.J. Crofts, E. Estrada, D.J. Higham, and A. Taylor Mapping directed networks Electron. Trans. Numer. Anal. 37 2010 337 350
12. T.A. Davis, and Y. Hu The University of Florida Sparse Matrix Collection ACM Trans. Math. Soft. 38 1 2011 Article 1
13. R. Diestel Graph Theory 2000 Springer-Verlag Berlin
14. C.H.Q. Ding, H. Zha, X. He, P. Husbands, and H.D. Simon Link analysis: hubs and authorities on the World Wide Web SIAM Rev. 46 2004 256 268
15. E. Estrada The Structure of Complex Networks 2011 Oxford University Press Oxford, UK
16. E. Estrada, M. Fox, D. Higham, and G.-L. Oppo Network Science Complexity in Nature and Technology 2010 Springer New York
17. E. Estrada, and N. Hatano Communicability in complex networks Phys. Rev. E 77 2008 article 036111
18. E. Estrada, N. Hatano, and M. Benzi The physics of communicability in complex networks Phys. Rep. 514 2012 89 119
19. E. Estrada, and D.J. Higham Network properties revealed through matrix functions SIAM Rev. 52 2010 671 696
20. E. Estrada, and J.A. Rodríguez-Velázquez Subgraph centrality in complex networks Phys. Rev. E 71 2005 056103
21. A. Farahat, T. Lofaro, J.C. Miller, G. Rae, and L.A. Ward Authority rankings from HITS, PageRank, and SALSA: existence, uniqueness, and effect of initialization SIAM J. Sci. Comput. 27 2006 1181 1201
22. D. Fogaras, Where to start browsing the Web?, in: T. Böhme, G. Heyer, H. Unger (Eds.), Proceedings IICS 2003, Lecture Notes in Computer Science, 2877 (2003) 65-79.
23. M. Franceschet PageRank: Standing on the shoulders of giants Commun. ACM 54 2011 92 101
24. G.H. Golub, and G. Meurant Matrices, Moments and Quadrature with Applications 2010 Princeton University Press Princeton, NJ
25. N.J. Higham The scaling and squaring method for the matrix exponential revisited SIAM J. Matrix Anal. Appl. 26 2006 1179 1193
26. N.J. Higham Functions of Matrices. Theory and Computation 2008 Society for Industrial and Applied Mathematics Philadelphia, PA
27. S. Kamvar Numerical Algorithms for Personalized Search in Self-Organizing Information Networks 2010 Princeton University Press Princeton and Oxford
28. L. Katz A new status index derived from sociometric data analysis Psychometrika 18 1953 39 43
29. J. Kleinberg Authoritative sources in a hyperlinked environment J. ACM 46 1999 604 632
30. G. Kollias, E. Gallopoulos, Functional Rankings with Multidamping: Generalizing PageRank with Inhomogeneous Matrix Products, Tech. Rep. TR HPCLAB-SCG 01/09-11, University of Patras, Greece, 2011.
31. A.N. Langville, and C.D. Meyer A survey of eigenvector methods for Web information retrieval SIAM Rev. 47 2005 135 161
32. A.N. Langville, and C.D. Meyer Google's PageRank and Beyond: The Science of Search Engine Rankings 2006 Princeton University Press Princeton, NJ
33. A.N. Langville, and C.D. Meyer Who's # 1 ? The Science of Rating and Ranking 2012 Princeton University Press Princeton, NJ
34. G. Meurant, MMQ toolbox for MATLAB, http://pagesperso-orange.fr/gerard. meurant/.
35. M. Mihail, C. Papadimitriou, On the eigenvalue power law, in: J.D.P. Rolim, S. Vadhan (Eds.), Proceedings of RANDOM 2002, Lectures Notes in Computer Science, vol. 2483, 2002, pp. 254-262.
36. M.E.J. Newman The structure and function of complex networks SIAM Rev. 45 2003 167 256
37. M.E.J. Newman Networks: An Introduction 2010 Cambridge University Press Cambridge, UK
38. M.E.J. Newman, A.-L. Barabasi, and D.J. Watts The Structure and Dynamics of Networks 2003 Princeton University Press Princeton, NJ
39. B. Savas, I. Dhillon, Clustered low rank approximation of graphs in information science applications, in: Proceedings of the 2011 SIAM Conference on Data Mining, April 2011.
40. P. Tsaparas, Datasets for Experiments on Link Analysis Ranking Algorithms. Available at http://www.cs.toronto.edu/∼tsap/experiments/ datasets/index.html (last accessed June 2012).
41. S. Vigna, Spectral Ranking, arXiv:0912.0238v9 [cs.IR], 2 March 2011.
42. G. Wu, and J. Li SWRank: an approach for ranking semantic web reversely and consistently Third International Conference on Semantics Knowledge and Grid 2007 IEEE doi: 10.1109/SKG.2007.81
43. G. Wu, J. Li, L. Feng, K. Wang, Identifying potentially important concepts and relations in an ontology, in: A. Sheth et al. (Eds.), Proceedings of ISWC 2008, Lecture Notes in Computer Science, vol. 5318, 2008, pp. 33-49.