A New Vertex Connectivity Metric

TL;DR

This paper introduces a novel vertex connectivity metric for graphs, suitable for social networks, that considers all-path impacts, supports various graph types, and is efficiently computable for large graphs.

Contribution

It presents a new connectivity metric, an efficient $O(V+E)$ implementation, and comparative analysis with existing methods.

Findings

Effective in social network analysis

Supports directed, undirected, and weighted graphs

Computationally efficient for large graphs

Abstract

A new metric for quantifying pairwise vertex connectivity in graphs is defined and an implementation presented. While general in nature, it features a combination of input features well-suited for social networks, including applicability to directed or undirected graphs, weighted edges, and computes using the impact from all-paths between the vertices. Moreover, the $O(V+E)$ method is applicable to large graphs. Comparisons with other techniques are included.