\begin{thebibliography}{10} 

\bibitem{Krylov1}
{\sc M.~Afanasjew, M.~Eiermann, O.~G.~Ernst, and S.~G\"uttel},
{\em Implementation of a restarted Krylov subspace method for the 
evaluation of matrix functions},
Lin.~Algebra Appl., 429 (2008), pp.~2293--2314.

\bibitem{stareig}
{\sc M.~A.~M.~de~Aguiar and Y.~Bar-Yam},
{\em Spectral analysis and the dynamic response of complex networks},
Phys.~Rev.~E, 71 (2005), 016106.

\bibitem{errorandattack}
{\sc R.~Albert, H.~Jeong, and A.~L.~Barab\'asi},
{\em Error and attack tolerance of complex networks},
Nature 406 (2000), pp.~378--382.

\bibitem{Bar-Yossef}
{\sc Z.~Bar-Yossef and L.-T.~Mashiach},
{\em Local approximation of PageRank and Reverse PageRank},
Proceedings CKIM'08, October 26--30, 2008, Napa Valley, California.

\bibitem{prefattach}
{\sc A.~L.~Barab\'asi and R.~Albert},
{\em Emergence of scaling in random networks},
Science, 286 (1999), pp.~509--512.

\bibitem{Benzi}
{\sc M.~Benzi},
{\em A note on walk entropies in graphs},
Linear Algebra Appl., published online, 2013.
DOI: 10.1016/j.laa.2013.12.014.

\bibitem{BenziBoito}{\sc M.~Benzi and P.~Boito}, 
{\em Quadrature rule-based bounds for functions of adjacency matrices}, 
Lin.~Algebra Appl., 433 (2010), pp.~637--652.

\bibitem{BEK}
{\sc M.~Benzi, E.~Estrada, C.~Klymko},
{\em Ranking hubs and authorities using matrix functions},
Lin.~Algebra Appl., 438 (2013), pp.~2447--2474.

\bibitem{BenziGolub}{\sc M.~Benzi and G.~H.~Golub},
{\em Bounds on the entries of matrix functions with applications
to preconditioning}, BIT, 39 (1999), pp.~417--438.

\bibitem{BKlym13}
{\sc M.~Benzi and C.~Klymko},
{\em Total communicability as a centrality measure},
Journal of Complex Networks 1 (2013), pp.~124-149.

\bibitem{BK12}
{\sc M.~Benzi and V.~Kuhlemann},
{\em Chebyshev Acceleration of the GeneRank Algorithm},
Electronic Transactions on Numerical Analysis, 40 (2013), pp.~311--320.

\bibitem{Bianchini05}
{\sc M.~Bianchini, M.~Gori, and F.~Scarselli},
{\em Inside PageRank},
ACM Trans. on Internet Technology, 5 (2005), pp.~92--128.

\bibitem{Bocca06}
{\sc S.~Boccaletti, V.~Latora, Y.~Moreno, M.~Chavez, and D.-U.~Hwang},
{\em Complex networks: structure and dynamics}, Phys.~Rep., 424 (2006),
pp.~175--308.

\bibitem{Boldi}
{\sc P.~Boldi},
{\em TotalRank: Ranking Without Damping},
in Proceedings of WWW'05, Special interest tracks and posters of the 14th 
international conference on World Wide Web, 
Association for Computing Machinery, New York, NY (2005),
pp.~898--899. 

\bibitem{Bollobas}
{\sc B. Bollob\'as}, 
{\em Modern Graph Theory}, 
Graduate Texts in Mathematics, Springer, Verlag, New York, 1998.

\bibitem{Bonacich}
{\sc P.~Bonacich},
{\em Power and centrality: a family of measures},
Amer.~J.~Sociology, 92 (1987), pp.~1170--1182.

\bibitem{BL01}
{\sc P.~Bonacich and P.~Lloyd},
{\em Eigenvector-like measures of centrality for asymmetric
relations},
Social Networks, 23 (2001), pp.~191--201.

\bibitem{bonchietal}
{\sc F.~Bonchi, P.~Esfandiar, D.~F.~Gleich, C.~Greif, and L.~V.~S.~Lakshmanan}, 
{\em Fast matrix computations for pair-wise and column-wise commute times and 
Katz scores}, Internet Math., 8 (2012), pp.~73--112.

\bibitem{BE06}
{\sc S.~P.~Borgatti and M.~G.~Everett},
{\em A graph-theoretic perspective on centrality},
Social Networks, 28 (2006), pp.~466--484.

\bibitem{LinkStructure}
{\sc A.~Borodin, G.~O.~Roberts, J.~S.~Rosenthal, and 
P.~Tsaparas}, 
\emph{Finding authorities and hubs from link structures on the World Wide Web}, 
Proceedings WWW10 (2001), ACM 1-58113-348-0/01/0005.

\bibitem{Brandes}
{\sc U.~Brandes and T.~Erlebach}, eds., 
\emph{Network Analysis: Methodological Foundations}, 
Lecture Notes in Computer Science Vol.~3418, Springer, New York, 2005. 

\bibitem{Br08}
{\sc U.~Brandes},
{\em On variants of shortest-path betweenness centrality and their generic computation},
Social Networks 30 (2008), pp.~136--145.

\bibitem{BrPa98}
{\sc S.~Brin and L.~Page},
{\em The anatomy of a large-scale hypertextual Web search algorithm},
Comput. Net. ISDN Syst, 33 (1998), pp.~107--117.

\bibitem{Caldarelli}
{\sc G.~Caldarelli},
\emph{Scale-free Networks}, Oxford University Press,
Oxford, UK, 2007.

\bibitem{ChKrLaPe11}
{\sc T.~P.~Chartier, E.~Kreutzer, A.~N.~Langville, and K.~E.~Pedings},
{\em Sensitivity and stability of ranking vectors},
SIAM J. Sci. Comput., 33 (2011), pp.~1077--1102.

\bibitem{ClNeMo04}
{\sc A.~Clauset, M.~E.~J.~Newman, and C.~Moore},
{\em Finding community structure in very large networks},
 Physical Review E, 70 (2004), 066111.

\bibitem{Randomalpha}
{\sc P.~ Constantine, D.~Gleich}
{\em Random Alpha PageRank},
Internet Mathematics, 6 (2009), pp.~199--236.

\bibitem{crofootetal}
{\sc M.~C.~Crofoot, D.~I.~Rubenstein, A.~S.~Maiya, and T.~Y.~Berger-Wolf},
\emph{Aggression, grooming and group-level cooperation in white-faced
capuchins ({\rm Cebus capucinus}): Insights from social networks},
Amer.~J.~Primatology, 73 (2011), pp.~821--833.

\bibitem{croftetal}
{\sc J.~J.~Crofts, E.~Estrada, D.~J.~Higham, and A.~Taylor},
{\em Mapping directed networks}, 
Electr.~Trans.~Numer.~Anal., 37 (2010), 
pp.~337--350.
 
 \bibitem{CvRoSi97}
{\sc D. ~Cvetkovi\'c, P.~Rowlinson, S.~Simi\'c},
{\em Eigenspaces of Graphs},
Cambridge University Press, Cambridge, 1997.
 
\bibitem{UFL}
{\sc T.~A.~Davis and Y.~Hu},
{\em The University of Florida Sparse Matrix Collection},
ACM Trans.~Math.~Soft., 38(1) (2011), Article 1. 

\bibitem{Die00}
{\sc  R.~Diestel},
{\em Graph Theory},
Springer-Verlag, Berlin, 2000.

\bibitem{Dingetal}
{\sc C.~H.~Q.~Ding, H.~Zha, X.~He, P.~Husbands, and H.~D.~Simon},
{\em Link analysis: hubs and authorities on the World Wide Web},
SIAM Rev., 46 (2004), pp.~256--268.

\bibitem{Krylov2}
{\sc M.~Eiermann and O.~G.~Ernst},
{\em A restarted Krylov subspace method for the evaluation of matrix functions},
SIAM J.~Numer.~Anal., 44 (2006), pp.~2481--2504. 

\bibitem{ErRe59}
{\sc P.~Erd\"os and A.~R\'enyi},
{\em  On Random Graphs. I},
 Publicationes Mathematicae, 6 (1959), pp.~290--297.

\bibitem{ErRe60}
{\sc P.~Erd\"os and A.~R\'enyi},
 {\em On the evolution of random graphs}, 
 Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5 (1960), pp.~17--61.

\bibitem{EstradaPC}
{\sc E.~Estrada},
Personal communication, February 2013. 

\bibitem{E13}
{\sc E.~Estrada},
\emph{About the discriminant power of the subgraph centrality
and other centrality measures (Working paper)}, arXiv:1305.6836.

\bibitem{Es13}
{\sc E.~Estrada},
{\em Communicability in temporal networks},
Phys. Rev. E 88 (2013), 042811.

\bibitem{Ebook11}
{\sc E.~Estrada}, 
\emph{The Structure of Complex Networks}, Oxford University Press, 
Oxford, UK, 2011.

\bibitem{Ebook10}
{\sc E.~Estrada, M.~Fox, D.~Higham, and G.-L. Oppo}, eds.,
\emph{Network Science. Complexity in Nature and Technology},
Springer, New York, 2010.

\bibitem{Proteomics}
{\sc E.~Estrada},
{\em Virtual identification of essential proteins within the protein interaction network of yeast},
Proteomics, 6 (2006), pp.35--40.

\bibitem{Proteome}
{\sc E.~Estrada}
{\em Protein bipartivity and essentiality in the yeast Protein-Protein Interaction network},
J.~Proteome~Res., 5 (2006), pp.~ 2177--2184.

\bibitem{EdH13}
{\sc E.~Estrada, J.~A.~de la Pe\~na, and N.~Hatano},
\emph{Walk entropies in graphs}, Linear Algebra Appl.,
443 (2014), pp.~235--244.

\bibitem{estradahatano2}
{\sc E.~Estrada and N.~Hatano},
\emph{Communicability in complex networks}, 
Phys.~Rev.~E, 77 (2008), article 036111.

\bibitem{EHB11}
{\sc E.~Estrada, N.~Hatano, and M.~Benzi},
\emph{The physics of communicability in complex networks},
Phys.~Reports, 514 (2012), pp.~89-119.  

\bibitem{NetworkProp}{\sc E.~Estrada and D.~J.~Higham}, 
{\em Network properties revealed through matrix functions}, 
SIAM Rev., 52 (2010), pp.~671--696.

\bibitem{estradarodriguez05}
{\sc E.~Estrada and J.~A.~Rodr\'iguez-Vel\'azquez},
\emph{Subgraph centrality in complex networks}, Phys.~Rev.~E,
71 (2005), 056103.

\bibitem{Euler}
{\sc L.~Euler}, 
{\em Solutio problematis ad geometriam situs pertinentis}, 
Commentarii Academiae Scientiarum Imperialis Petropolitanae, 8 (1736) pp.~128--140.

\bibitem{Faginetal}
{\sc R.~Fagin, R.~Kumar, and D.~Sivakumar},
\emph{Comparing top $k$ lists},
SIAM J.~Discr.~Math., 17 (2003), pp.~134--160.

\bibitem{FaFaFa99}
{\sc M.~Faloutsos, P.~Faloutsos, and C.~Faloutsos},
{\em On Power-Law Relationships of the Internet Topology},
In SIGCOMM (1999), pp.~252--262.

\bibitem{EIHITS}
{\sc A.~Farahat, T.~Lofaro, J.~C.~Miller, G.~Rae, and L.~A.~Ward},
\emph{Authority rankings from HITS, PageRank, and SALSA: existence,
uniqueness, and effect of initialization},
SIAM J.~Sci.~Comput., 27 (2006), pp.~1181--1201.

\bibitem{fmrr12}
{\sc C.~Fenu, D.~Martin, L.~Reichel, and G.~Rodriguez},
{\em Network Analysis via Partial Spectral Factorization and Gauss Quadrature},
SIAM~J.~Sci.~Comput., 35 (2013), pp.~A2046--A2068.

\bibitem{fogaras}
{\sc D.~Fogaras},
\emph{Where to start browsing the Web?},
in T.~B\"ohme, G.~Heyer, and H.~Unger (Eds.), {\em Proceedings
IICS 2003}, Lecture Notes in Computer Science, 2877 (2003),
pp.~65--79.

\bibitem{franceschet}
{\sc M.~Franceschet},
\emph{PageRank: Standing on the shoulders of giants},
Comm.~ACM, 54 (2011), pp.~92--101.

\bibitem{Fr77}
{\sc L.~C.~Freeman},
{\em A set of measures of centrality based on betweenness},
Sociometry,  40 (1977), pp.~35--41.

\bibitem{Fr79}
{\sc L.~C.~Freeman},
{\em Centrality in networks : I. Conceptual clarification},
Social Networks, 1 (1979), pp.~215--239.

\bibitem{Gleich07}
{\sc D.~Gleich, P.~Glynn, G.~Golub, and C.~Greif},
{\em Three results on the PageRank vector: Eigenstructure, sensitivity and the derivative}, in
{\em Web Information Retrieval and Linear Algebra Algorithms}, eds. {\sc A.~Frommer, M.~W.~Mahoney, and D.~B.~Szyld}, 
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

\bibitem{Gohetal}
{\sc K.~I.~Goh, B.~Kahng, and D.~Kim},
{\em Spectra and eigenvectors of scale-free networks},
Phys. Rev. E 64 (2001), 051903.

\bibitem{golubmeurantbook}
{\sc G.~H.~Golub and G.~Meurant},
\emph{Matrices, Moments and Quadrature with Applications},
Princeton University Press, Princeton, NJ, 2010.

\bibitem{GolVan96}
{\sc G.~H.~Golub and C.~Van Loan},
{\em Matrix Computations},
The Johns Hopkins University press, 3rd edition, Baltimore
and London, 1996.

\bibitem{GH13}
{\sc P.~Grindrod and D.~Higham},
\emph{A matrix iteration for dynamic network summaries},
SIAM Review, 55 (2013), pp.~118--128.

\bibitem{funmkryl}
{\sc S.~G\"uttel},
{\em funm\_kryl toolbox for MATLAB},\\ %\texttt{http://pagesperso-orange.fr/gerard.meurant/}.
www.mathe.tu-freiberg.de/$\sim$guettels/funm\_kryl/.

\bibitem{higham}
{\sc N.~J.~Higham},
\emph{The scaling and squaring method for the matrix exponential
revisited}, SIAM J.~Matrix Anal.~Applic., 26 (2006), pp.~1179--1193.

\bibitem{highambook}
{\sc N.~J.~Higham},
\emph{Functions of Matrices. Theory and Computation}, Society for
Industrial and Applied Mathematics, Philadelphia, PA, 2008.

\bibitem{Ipsen06}
{\sc I.~C.~F.~Ipsen and R.~S.~Wills}
{\em Mathematical Properties and Analysis of Google's PageRank}
Bol. Soc. Esp. Mat. Apl., 34 (2006), pp.~191--196.

\bibitem{Katz}
{\sc L.~Katz},
\emph{A new status index derived from sociometric data analysis},
Psychometrika, 18 (1953), pp.~39--43.

\bibitem{HITS}{\sc J.~Kleinberg}, 
{\em Authoritative sources in a hyperlinked environment}, 
J.~ACM, 46 (1999), pp.~604--632.

\bibitem{BTER}
{\sc T.~G.~Kolda, A.~Pinar, T.~Plantenga, and C.~Seshadhri}
{\em A Scalable Generative Graph Model with Community Structure},
arXiv:1302.6636 [cs.SI], March 2013.

\bibitem{KG11}
{\sc G.~Kollias and E.~Gallopoulos},
{\em Functional Rankings with Multidamping: Generalizing
PageRank with Inhomogeneous Matrix Products},
Tech.~Rep.~TR HPCLAB-SCG 01/09-11, University of Patras, 
Greece, 2011.

\bibitem{KrRoRe01}
{\sc P.~L.~Krapivsky, G.~J.~Rodgers, and S.~Redner},
{\em Degree distributions of growing networks},
Phys. Rev. Lett., 86 (2001), pp.~5401--5404.

\bibitem{IRSurvey}{\sc A.~N.~Langville and C.~D.~Meyer}, 
{\em A survey of eigenvector methods for Web information retrieval}, 
SIAM Rev., 47 (2005), pp.~135--161.

\bibitem{Pagerank}
{\sc A.~N.~Langville and C.~D.~Meyer},
{\em Google's PageRank and Beyond: The Science of Search Engine Rankings},
Princeton University Press, Princeton, NJ, 2006.

\bibitem{Whos}
{\sc A.~N.~Langville and C.~D.~Meyer},
{\em Who's $\# 1$? The Science of Rating and Ranking}, 
Princeton University Press, Princeton, NJ, 2012.

\bibitem{SALSA} 
{\sc R.~Lempel and S.~Moran},
{\em The stochastic approach for link-structure analysis (SALSA)
and the TKC effect}, in Proceedings of the Ninth 
International Conference on the World Wide Web, 2000, pp.~387--401.

\bibitem{Me06}
{\sc G.~Meurant},
{\em The Lanczos and Conjugate Gradient Algorithms: From Theory to Finite Precision Computations},
SIAM, Philadelphia, Pa, 2006.

\bibitem{mmq}
{\sc G.~Meurant},
{\em MMQ toolbox for MATLAB}, %\texttt{http://pagesperso-orange.fr/gerard.meurant/}.
http://pagesperso-orange.fr/gerard.meurant/.

\bibitem{Meyer00}
{\sc C.~D.~Meyer},
{\em Matrix Analysis and Applied Linear Algebra},
SIAM, Philadelphia, 2000.

\bibitem{MiPapa}
{\sc M.~Mihail and C.~Papadimitriou}, 
{\em On the eigenvalue power law},
in J.~D.~P.~Rolim and S.~Vadhan (Eds.), {\em Proceedings of
RANDOM 2002}, Lectures Notes in Computer Science, 2483 (2002), 
pp.~254--262. 

\bibitem{MiQi09}
{\sc L.~Min and Z.~Qinggui},
{\em Degree Distribution of a Mixed Attachments Model for Evolving Networks},
Proceedings of WRCS 2009, pp.~815--822.

\bibitem{MoBrHiGi05}
{\sc J.~L.~Morrison, R.~Breitling, D.~J.~Higham, and D.~R.~Gilbert}, 
{\em GeneRank: Using search engine technology for the analysis of microarray experiments}, 
BMC Bioinformatics, 6:233 (2005).

\bibitem{New01}
{\sc M.~E.J.~Newman},
{\em The structure of scientific collaboration networks},
Proc. Natl. Acad. Sci. USA, 98 (2001), pp.~404-409.

%\bibitem{New02}
%{\sc M.~E.J.~Newman},
%{\em Assortative Mixing in Networks},
%Phys, Rev. Lett 89. (2002), 208701.

\bibitem{New03}
{\sc M.~E.~J.~Newman},
{\em The structure and function of complex networks},
SIAM Rev., 45 (2003), pp.~167--256.

\bibitem{New10}
{\sc M.~E.~J.~Newman},
{\em Networks: An Introduction},
Cambridge University Press, Cambridge, UK, 2010.

\bibitem{NewBarWat03}
{\sc M.~E.~J.~Newman, A.~L.~Barab\'asi, and D.~J.~Watts},
{\em The Structure and Dynamics of Networks},
Princeton University Press, Princeton, NJ, 2003.

\bibitem{M-matrix}
{\sc G.~Poole and T.~Boullion},
{\em A survey on M-matrices},
SIAM Review, 16 (1974), pp.~419--427.

\bibitem{RP13}
{\sc M.~Puck Rombach and M.~Porter},
{\em Discriminating power of centrality measures},
arXiv:1305.3146.

\bibitem{dhillon}
{\sc B.~Savas and I.~Dhillon},
\emph{Clustered low rank approximation of graphs in information
science applications},
Proceedings of the 2011 SIAM Conference on Data Mining,
April 2011.

\bibitem{DS13}
{\sc D.~Stevanovi\'c},
{\em Comment on ``Subgraph centrality in complex networks"},
Phys.~Rev.~E, 88 (2013), 026801.

\bibitem{Strang}
{\sc G.~Strang},
{\em Introduction to Linear Algebra, 3rd Edition},
Wellesley-Cambridge Press, Cambridge, Ma, 2003.

\bibitem{contest}
{\sc A.~Taylor and D.~J.~Higham}, \emph{CONTEST: Toolbox files and documentation}, \\
\texttt{http://www.mathstat.strath.ac.uk/research/groups/}
 \texttt{numerical\_analysis/contest/toolbox} .

\bibitem{contest09}
{\sc A.~Taylor and D.~J.~Higham},
\emph{CONTEST: A Controllable Test Matrix Toolbox for MATLAB},
ACM Trans.~Math.~Software, 35 (2009), pp.~26:1--26:17.

\bibitem{datasets}{\sc P.~Tsaparas}, 
\emph{Datasets for Experiments on Link Analysis Ranking Algorithms},
available at
http://www.cs.toronto.edu/$\sim$tsap/experiments/datasets/ index.html 
(last accessed June 2012).

\bibitem{vigna}
{\sc S.~Vigna},
\emph{Spectral Ranking},
arXiv:0912.0238v9 [cs.IR], 2 March 2011.

\bibitem{smallw}
{\sc D.~J.~Watts and S.~H.~Strogatz},
{\em Collective dynamics of `small-world' networks},
Nature, 393 (1998), pp.~440--442.

\bibitem{WuLi}
{\sc G.~Wu and J.~Li},
\emph{SWRank: an approach for ranking semantic web reversely and
consistently}, in Third International Conference on Semantics,
Knowledge and Grid, IEEE, 2007. DOI: 10.1109/SKG.2007.81

\bibitem{WuLietal}
{\sc G.~Wu, J.~Li, L.~Feng, and K.~Wang},
\emph{Identifying potentially important concepts and relations
in an ontology},
in A.~Sheth et al. (Eds.), Proceedings of ISWC 2008, Lecture Notes
in Computer Science, 5318 (2008), pp.~33--49.

\bibitem{karate}
{\sc W.~W.~Zachary}, 
{\em An information flow model for conflict and fission in small groups}, 
Journal of Anthropological Research 33 (1977), pp.~452--473.

\bibitem{ZoPeLiHeCh07}
{\sc L.~Zou, W.~Pei, T.~Li, Z.~He, and Y.~Cheung},
{\em Topological fractal networks introduced by mixed degree distribution},
Physica A, 380 (2007), pp.~592--600.

\end{thebibliography} 