On a Notion of Graph Centrality Based on L 1 Data Depth
提出一种新的L1中心性度量，用于评估无向连通图中顶点的重要性，可处理带权顶点和边，并提供了图形化与多尺度分析工具，通过漫威电影网络和韩国国会法案共同发起网络示例展示应用。
A new measure, L1 centrality, is proposed to assess the centrality of vertices in an undirected and connected graph. The proposed measure can adequately handle graphs with weights assigned to vertices and edges. This study provides tools for graphical and multiscale analysis based on the L1 centrality. Specifically, the suggested analysis tools include the target plot, L1 centrality-based neighborhood, and local L1 centrality. Most importantly, our work is closely associated with the concept of data depth for multivariate data, which allows for a wide range of practical applications of the proposed measure. Throughout this paper, we demonstrate our tools with two interesting examples: the Marvel Cinematic Universe movie network and the bill cosponsorship network of the 21st National Assembly of South Korea.