A straightforward edge centrality concept derived from generalizing degree and strength

Abstract

AbstractVertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and dynamics. Unlike many other centrality concepts, for which joint metrics have been proposed for both vertices and edges, by now there is no concept for an edge centrality analogous to vertex degree. Here, we propose such a concept—termed nearest-neighbor edge centrality—and demonstrate its suitability for a non-redundant identification of central edges in paradigmatic network models as well as in real-world networks from various scientific domains.