Skip to main content Accessibility help

Rank monotonicity in centrality measures

  • Please note a correction has been issued for this article.


A measure of centrality is rank monotone if after adding an arc xy, all nodes with a score smaller than (or equal to) y have still a score smaller than (or equal to) y. If, in particular, all nodes with a score smaller than or equal to y get a score smaller than y (i.e., all ties with y are broken in favor of y), the measure is called strictly rank monotone. We prove that harmonic centrality is strictly rank monotone, whereas closeness is just rank monotone on strongly connected graphs, and that some other measures, including betweenness, are not rank monotone at all (sometimes not even on strongly connected graphs). Among spectral measures, damped scores such as Katz's index and PageRank are strictly rank monotone on all graphs, whereas the dominant eigenvector is strictly monotone on strongly connected graphs only.



Hide All
Altman, A., & Tennenholtz, M. (2008). Axiomatic foundations for ranking systems. Journal of Artificial Intelligence Research, 31 (1), 473495.
Anthonisse, J. M. (1971). The rush in a directed graph. Tech. rept. BN 9/71. Mathematical Centre, Amsterdam.
Bavelas, A. (1948). A mathematical model for group structures. Human Organization, 7 (3), 1630.
Bavelas, A., Barrett, D. & American Management Association. (1951). An experimental approach to organizational communication. Publications (Massachusetts Institute of Technology. Dept. of Economics and Social Science). Industrial Relations. New York: American Management Association.
Beauchamp, M. A. (1965). An improved index of centrality. Behavioral Science, 10 (2), 161163.
Berge, C. (1958). Théorie des graphes et ses applications. Paris, France: Dunod.
Berman, A., & Plemmons, R. J. (1994). Nonnegative matrices in the mathematical sciences, Classics in Applied Mathematics. Philadelphia, PA: SIAM.
Boldi, P., & Vigna, S. (2014). Axioms for centrality. Internet Mathematics, 10 (3–4), 222262.
Bonacich, P. (1991). Simultaneous group and individual centralities. Social Networks, 13 (2), 155168.
Brandes, U., Kosub, S., & Nick, B. (2012). Was messen Zentralitätsindizes? In Hennig, M., & Stegbauer, C., (Eds.), Die integration von theorie und methode in der netzwerkforschung (pp. 3352). Springer VS Verlag für Sozialwissenschaften, Springer Fachmedien Wiesbaden.
Chien, S., Dwork, C., Kumar, R., Simon, D. R., & Sivakumar, D. (2004). Link evolution: Analysis and algorithms. Internet Mathematics, 1 (3), 277304.
Cohn, B. S., & Marriott, M. (1958). Networks and centres of integration in Indian civilization. Journal of Social Research, 1, 19.
Dequiedt, V., & Zenou, Y. (2014). Local and consistent centrality measures in networks. Tech. rept. 2014:4. Stockholm University, Department of Economics.
Elsner, L. F., Johnson, C. R., & Neumann, M. M. (1982). On the effect of the perturbation of a nonnegative matrix on its Perron eigenvector. Czechoslovak Mathematical Journal, 32 (1), 99109.
Fishburn, P. C. (1982). Monotonicity paradoxes in the theory of elections. Discrete Applied Mathematics, 4 (2), 119134.
Freeman, L. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1 (3), 215239.
Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40 (1), 3541.
Garg, M. (2009). Axiomatic foundations of centrality in networks. Social Science Research Network.
Hubbell, C. H. (1965). An input-output approach to clique identification. Sociometry, 28 (4), 377399.
Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 18 (1), 3943.
Kitti, M. (2016). Axioms for centrality scoring with principal eigenvectors. Social Choice and Welfare, 46 (3), 639653.
Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM, 46 (5), 604632.
Leavitt, H. J. (1951). Some effects of certain communication patterns on group performance. Journal of Abnormal Psychology, 46 (1), 3850.
Lempel, R., & Moran, S. (2001). SALSA: The stochastic approach for link-structure analysis. ACM Transactions on Information Systems, 19 (2), 131160.
Lin, N. (1976). Foundations of social research. New York: McGraw-Hill.
Mackenzie, K. (1966). Structural centrality in communications networks. Psychometrika, 31 (1), 1725.
McDonald, J. J., Neumann, M., Schneider, H., & Tsatsomeros, M. J. (1995). Inverse M-matrix inequalities and generalized ultrametric matrices. Linear Algebra and its Applications, 220, 321341.
Nieminen, U. J. (1973). On the centrality in a directed graph. Social Science Research, 2 (4), 371378.
Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranking: Bringing order to the web. Tech. rept. SIDL-WP-1999-0120. Stanford Digital Library Technologies Project, Stanford University.
Palacios-Huerta, I., & Volij, O. (2004). The measurement of intellectual influence. Econometrica, 72 (3), 963977.
Pinski, G., & Narin, F. (1976). Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Information Processing & Management, 12 (5), 297312.
Pitts, F. R. (1965). A graph theoretic approach to historical geography. The Professional Geographer, 17 (5), 1520.
Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31 (4), 581603.
Seeley, J. R. (1949). The net of reciprocal influence: A problem in treating sociometric data. Canadian Journal of Psychology, 3 (4), 234240.
Vigna, S. (2016). Spectral ranking. Network Science, 4 (4), 433445.
Wei, T.-H. (1952). The Algebraic Foundations of Ranking Theory. Ph.D. thesis, University of Cambridge.
Willoughby, R. A. (1977). The inverse M-matrix problem. Linear Algebra and its Applications, 18 (1), 7594.


Related content

Powered by UNSILO

Rank monotonicity in centrality measures

  • Please note a correction has been issued for this article.


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

A correction has been issued for this article: