Absolute Expressiveness of Subgraph-based Centrality Measures
Andreas Pieris, Jorge Salas

TL;DR
This paper characterizes the expressiveness of subgraph-based centrality measures in graphs, providing criteria to identify when other measures are subgraph-based and analyzing their structural properties.
Contribution
It offers a formal characterization of the absolute expressiveness of subgraph-based centrality measures in both directed and undirected graphs.
Findings
Provides criteria to identify subgraph-based centrality measures
Classifies well-known measures as subgraph-based or not
Offers insights into structural similarities among centrality measures
Abstract
In graph-based applications, a common task is to pinpoint the most important or ``central'' vertex in a (directed or undirected) graph, or rank the vertices of a graph according to their importance. To this end, a plethora of so-called centrality measures have been proposed in the literature. Such measures assess which vertices in a graph are the most important ones by analyzing the structure of the underlying graph. A family of centrality measures that are suited for graph databases has been recently proposed by relying on the following simple principle: the importance of a vertex in a graph is relative to the number of ``relevant'' connected subgraphs surrounding it; we refer to the members of this family as subgraph-based centrality measures. Although it has been shown that such measures enjoy several favourable properties, their absolute expressiveness remains largely unexplored.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
