Selection of Centrality Measures Using Self-Consistency and Bridge Axioms

DOI10.1093/COMNET/CNAD035arXiv2301.00084MaRDI QIDQ6422166FDOQ6422166

Publication date: 30 December 2022

Abstract: We consider several families of network centrality measures induced by graph kernels, which include some well-known measures and many new ones. The Self-consistency and Bridge axioms, which appeared earlier in the literature, are closely related to certain kernels and one of the families. We obtain a necessary and sufficient condition for Self-consistency, a sufficient condition for the Bridge axiom, indicate specific measures that satisfy these axioms, and show that under some additional conditions they are incompatible. PageRank centrality applied to undirected networks violates most conditions under study and has a property that according to some authors is ``hard to imagine for a centrality measure. We explain this phenomenon. Adopting the Self-consistency or Bridge axiom leads to a drastic reduction in survey time in the culling method designed to select the most appropriate centrality measures.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Matrix exponential and similar functions of matrices (15A16) Applications of graph theory to circuits and networks (94C15) Numerical computation of matrix exponential and similar matrix functions (65F60)

This page was built for publication: Selection of Centrality Measures Using Self-Consistency and Bridge Axioms

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