How to choose the most appropriate centrality measure? A decision tree approach

arXiv2003.01052MaRDI QIDQ6335986FDOQ6335986

Authors: Pavel Chebotarev, Dmitriĭ A. Gubanov 

Publication date: 2 March 2020

Abstract: We propose a new method for selecting the most appropriate network centrality measure based on the user's opinion on how such a measure should work on simple graphs. The method consists in: (1) forming a set $calF$ of candidate measures; (2) generating a list $calG$ of fairly simple graphs such that for every pair of measures in $calF$, the centrality rankings they define differ on some graph $GincalG$; (3) compiling a survey that consists of questions on comparing the centrality of test nodes in some graphs $GincalG$; (4) completing this survey, which yields a centrality measure consistent with all user responses. We develop algorithms that implement the proposed method, called culling, for an arbitrary finite set $calF$ that does not contain order-equivalent measures. The culling method can be used either for rapid analysis or in combination with a normative approach by compiling a survey on the subset of measures that satisfy chosen axioms. As an example, this method is applied to a set of forty diverse centrality measures. Abbreviated surveys are constructed on the subsets of measures that satisfy the Self-consistency or Bridge axioms.

Has companion code repository: https://github.com/dagubanov/centralities_dec_tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

This page was built for publication: How to choose the most appropriate centrality measure? A decision tree approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6335986)