Bringing order to network centrality measures

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Exarchakos, G., van der Hofstad, R., Nagy, O., Pandey, M.
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917219289530368
author Exarchakos, G.
van der Hofstad, R.
Nagy, O.
Pandey, M.
author_facet Exarchakos, G.
van der Hofstad, R.
Nagy, O.
Pandey, M.
contents We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative restatement of many conjectures that were previously cumbersome to formalize. Moreover, it produces an approximation scheme useful for network scientists. We explore some of these uses and formulate new conjectures that are of independent interest.
format Preprint
id arxiv_https___arxiv_org_abs_2601_16236
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Bringing order to network centrality measures
Exarchakos, G.
van der Hofstad, R.
Nagy, O.
Pandey, M.
Social and Information Networks
Discrete Mathematics
Probability
Data Analysis, Statistics and Probability
We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative restatement of many conjectures that were previously cumbersome to formalize. Moreover, it produces an approximation scheme useful for network scientists. We explore some of these uses and formulate new conjectures that are of independent interest.
title Bringing order to network centrality measures
topic Social and Information Networks
Discrete Mathematics
Probability
Data Analysis, Statistics and Probability
url https://arxiv.org/abs/2601.16236