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.

翻译：我们提出了一种基于顶点排序的定量方法，用于比较任意图中心性度量对。该方法概念简洁、数学优雅，能够将许多先前难以形式化的猜想转化为定量表述。此外，该方法产生的近似方案对网络科学研究者具有实用价值。我们探讨了部分应用场景，并提出了若干具有独立意义的新猜想。