A centrality notion for graphs based on Tukey depth

作者：

Highlights：

• We propose novel centrality measures for the vertices of graphs.

• The measures translate to the framework of graphs established concepts from multivariate statistics related to Tukey depth, in a very natural way.

• The measures (that range from one to the number of vertices of the graph) have a clear interpretation, and accurately capture the intuition on the centrality of the nodes in networks.

摘要

•We propose novel centrality measures for the vertices of graphs.•The measures translate to the framework of graphs established concepts from multivariate statistics related to Tukey depth, in a very natural way.•The measures (that range from one to the number of vertices of the graph) have a clear interpretation, and accurately capture the intuition on the centrality of the nodes in networks.

论文关键词：Centrality measures,Median points,Convexity,Unimodal distribution,Quasi-concave function,Computational complexity,Social networks

论文评审过程：Received 29 January 2021, Revised 19 May 2021, Accepted 23 May 2021, Available online 8 June 2021, Version of Record 8 June 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126409