On the limiting behavior of parameter-dependent network centrality measures

SIAM Journal on Matrix Analysis and Applications

Volumn 36, Issue 2, 2015, Pages 686-706

  Benzi, Michele ^a   Klymko, Christine ^b  

^a EMORY UNIVERSITY   (United States)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

Adjacency matrix; Centrality; Communicability; Matrix functions; Network analysis; PageRank; Spectral gap

Indexed keywords

ELECTRIC NETWORK ANALYSIS; MATRIX ALGEBRA;

ADJACENCY MATRICES; CENTRALITY; COMMUNICABILITY; MATRIX FUNCTIONS; PAGERANK; SPECTRAL GAP;

LINEAR ALGEBRA;

EID: 84936754293     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/130950550     Document Type: Article

References (54)

1. A.-L. BARABASI, Linked: The New Science of Networks, Perseus, Cambridge, UK, 2002.
2. A. BARRAT, M. BARTHELEMY, and A. VESPIGNANI, Dynamical Processes on Complex Networks, Cambridge University Press, Cambridge, UK, 2008.
3. M. BENZI and P. BOITO, Quadrature rule-based bounds for functions of adjacency matrices, Linear Algebra Appl., 433 (2010), pp. 637-652.
4. M. BENZI, E. ESTRADA, and C. KLYMKO, Ranking hubs and authorities using matrix functions, Linear Algebra Appl., 438 (2013), pp. 2447-2474.
5. M. BENZI and C. KLYMKO, Total communicability as a centrality measure, J. Complex Networks, 1 (2013), pp. 124-149.
6. S. BOCCALETTI, V. LATORA, Y. MORENO, M. CHAVEZ, and D.-U. HWANG, Complex networks: Structure and dynamics, Phys. Rep., 424 (2006), pp. 175-308.
7. P. BOLDI, M. SANTINI, and S. VIGNA, PageRank as a function of the damping factor, in Proceedings of the 14th International Conference on World Wide Web, ACM, New York, 2005, pp. 557-566.
8. P. BOLDI, M. SANTINI, and S. VIGNA, PageRank: Functional dependencies, ACM Trans. Inf. Sys., 27 (2009), pp. 1-23.
9. P. BONACICH, Power and centrality: A family of measures, Amer. J. Sociology, 92 (1987), pp. 1170-1182.
10. P. BONACICH and P. LLOYD, Eigenvector-like measures of centrality for asymmetric relations, Social Networks, 23 (2001), pp. 191-201.
11. 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), pp. 73-112.
12. U. BRANDES, On variants of shortest-path betweenness centrality and their generic computation, Social Networks, 30 (2008), pp. 136-145.
13. U. BRANDES and T. ERLEBACH, eds., Network Analysis: Methodological Foundations, Lecture Notes in Comput. Sci. 3418, Springer, New York, 2005.
14. S. L. CAMPBELL and C. D. MEYER, Generalized Inverses of Linear Transformations, Dover, New York, 1991
15. Published as Classics Appl. Math. 56, SIAM, Philadelphia, 2009.
16. T. P. CHARTIER, E. KREUTZER, A. N. LANGVILLE, and K. E. PEDINGS, Sensitivity and stability of ranking vectors, SIAM J. Sci. Comput., 33 (2011), pp. 1077-1102.
17. F. CHUNG, The heat kernel as the PageRank of a graph, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 19735-19740.
18. R. COHEN and S. HAVLIN, Complex Networks: Structure, Robustness and Function, Cambridge University Press, Cambridge, UK, 2010.
19. P. CONSTANTINE and D. GLEICH, Random alpha PageRank, Internet Math., 6 (2009), pp. 199-236.
20. D. CVETKOVIĆ, P. ROWLINSON, and S. SIMIĆ, Eigenspaces of Graphs, Cambridge University Press, Cambridge, UK, 1997.
21. R. DIESTEL, Graph Theory, Springer-Verlag, Berlin, 2000.
22. 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), pp. 256-268.
23. S. N. DOROGOVTSEV and J. F. F. MENDES, Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford University Press, Oxford, UK, 2003.
24. E. ESTRADA, Spectral scaling and good expansion properties in complex networks, Euro-phys. Lett., 73 (2006), pp. 649-655.
25. E. ESTRADA, The Structure of Complex Networks, Oxford University Press, Oxford, UK, 2011.
26. E. ESTRADA, N. HATANO, and M. BENZI, The physics of communicability in complex networks, Phys. Rep., 514 (2012), pp. 89-119.
27. E. ESTRADA and D. J. HIGHAM, Network properties revealed through matrix functions, SIAM Rev., 52 (2010), pp. 696-714.
28. E. ESTRADA and J. A. RODRÍGUEZ-VELÁZQUEZ, Subgraph centrality in complex networks, Phys. Rev. E (3), 71 (2005), 056103.
29. C. FENU, D. MARTIN, L. REICHEL, and G. RODRIGUEZ, Network analysis via partial spectral factorization and Gauss quadrature, SIAM J. Sci. Comput., 35 (2013), pp. A2046-A2068.
30. C. FENU, D. MARTIN, L. REICHEL, and G. RODRIGUEZ, Block Gauss and anti-Gauss quadrature with application to networks, SIAM J. Matrix Anal. Appl., 34 (2013), pp. 1655-1684.
31. L. FREEMAN, A set of measures of centrality based on betweenness, Sociometry, 40 (1977), pp. 35-41.
32. L. FREEMAN, Centrality in networks. I: Conceptual clarification, Social Networks, 1 (1979), pp. 215-239.
33. J. R. FURLAN RONQUI and G. TRAVIESO, Analyzing Complex Networks through Correlations in Centrality Measurements, preprint, arXiV:1405.7724v2, 2014; to appear in J. Stat. Mech.: Theory and Experiment.
34. R. GHOSH and K. LERMAN, Parameterized centrality metric for network analysis, Phys. Rev. E (3), 83 (2011), 066118.
35. N. J. HIGHAM, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, 2008.
36. R. A. HORN and C. R. JOHNSON, Matrix Analysis, 2nd ed., Cambridge University Press, Cambridge, UK, 2013.
37. L. KATZ, A new status index derived from sociometric data analysis, Psychometrika, 18 (1953), pp. 39-43.
38. J. KLEINBERG, Authoritative sources in a hyperlinked environment, J. ACM, 46 (1999), pp. 604-632.
39. C. F. KLYMKO, Centrality and Communicability Measures in Complex Networks: Analysis and Algorithms, Ph.D. thesis, Emory University, Atlanta, GA, 2013.
40. A. N. LANGVILLE and C. D. MEYER, Google's PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ, 2006.
41. A. N. LANGVILLE and C. D. MEYER, Who's #1? The Science of Rating and Ranking, Princeton University Press, Princeton, NJ, 2012.
42. C.-Y. LEE, Correlations among Centrality Measures in Complex Networks, preprint, arXiv: physics/0605220v1, 2006.
43. J. E. MARSDEN and I. HOFFMAN, Basic Complex Analysis, 4th ed., W. H. Freeman and Co., New York, 1987.
44. C. D. MEYER, JR., Limits and the index of a square matrix, SIAM J. Appl. Math., 26 (1974), pp. 469-478.
45. C. D. MEYER, Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, 2000.
46. M. MIHAIL and C. PAPADIMITRIOU, On the eigenvalue power law, in Proceedings of RANDOM 2002, Lectures Notes in Comput. Sci. 2483, J. D. P. Rolim and S. Vadhan, eds., Springer, Berlin, 2002, pp. 254-262.
47. M. E. J. NEWMAN, The structure and function of complex networks, SIAM Rev., 45 (2003), pp. 167-256.
48. M. E. J. NEWMAN, Networks: An Introduction, Oxford University Press, Oxford, UK, 2010.
49. L. PAGE, S. BRIN, R. MOTWANI, and T. WINOGRAD, The PageRank Citation Ranking: Bringing Order to the Web, Technical Report, Stanford Digital Libraries Technology Project, 1999.
50. J. A. RODRÍGUEZ, E. ESTRADA, and A. GUTÍERREZ, Functional centrality in graphs, Linear Multilinear Algebra, 55 (2007), pp. 293-302.
51. M. ROMANCE, Local estimates for eigenvector-like centralities of complex networks, J. Comput. Appl. Math., 235 (2011), pp. 1868-1874.
52. M. SHIMBO, T. ITO, D. MOCHIHASHI, and Y. MATSUMOTO, On the properties of von Neumann kernels for link analysis, Mach. Learn., 75 (2009), pp. 37-67.
53. S. VIGNA, Spectral Ranking, preprint, arXiv:0912.0238v13, 2013.
54. H. YANG, I. KING, and M. R. LYU, Diffusion Rank: A possible penicillin for Web spamming, in Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Amsterdam, The Netherlands, 2007, pp. 431-438.