Absolute Expressiveness of Subgraph Motif Centrality Measures

by   Andreas Pieris, et al.

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 that assess which vertices in a graph are the most important ones. Riveros and Salas, in an ICDT 2020 paper, proposed a family of centrality measures based on the following intuitive principle: the importance of a vertex in a graph is relative to the number of “relevant” connected subgraphs, known as subgraph motifs, surrounding it. We refer to the measures derived from the above principle as subgraph motif measures. It has been convincingly argued that subgraph motif measures are well-suited for graph database applications. Although the ICDT paper studied several favourable properties enjoyed by subgraph motif measures, their absolute expressiveness remains largely unexplored. The goal of this work is to precisely characterize the absolute expressiveness of the family of subgraph motif measures.


page 1

page 2

page 3

page 4


Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges

A strongly connected graph is strongly biconnected if after ignoring the...

Finding Densest k-Connected Subgraphs

Dense subgraph discovery is an important graph-mining primitive with a v...

Finding Connected Secluded Subgraphs

Problems related to finding induced subgraphs satisfying given propertie...

Robot Subset Selection for Swarm Lifetime Maximization in Computation Offloading with Correlated Data Sources

Consider robot swarm wireless networks where mobile robots offload their...

Better Fewer but Better: Community Search with Outliers

Given a set of vertices in a network, that we believe are of interest fo...

Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism

Let v(F) denote the number of vertices in a fixed connected pattern grap...

Escape times for subgraph detection and graph partitioning

We provide a rearrangement based algorithm for fast detection of subgrap...

Please sign up or login with your details

Forgot password? Click here to reset