The Centrality of Edges based on their role in Induced Triads

Abstract The prevalence of induced triads play an important role in characterising complex networks. In this paper we introduce a new local edge-centrality measure that signifies the importance an edge plays within induced triads for a directed network. We observe that an edge can play one of two roles in providing connectivity within a particular triad, based on whether the edge supports connectivity to the third node or not. We call these alternative states overt and covert. As an edge may play alternative roles in different induced triads, this allows us to assess the local importance of an edge concerning global connectivity. We explore this concept by introducing a new minimum weight path problem applied to Erdos-Renyi and scale-free networks. We also show how the concept can be used to profile and associate diverse real-world networks. We observe that this approach contributes a simple alternative for aspects of motif-based analysis in network categorisation.
  • Lauren Hudson (Cardiff)
  • Roger Whitaker (Cardiff)
  • Stuart Allen (Cardiff)
  • Liam Turner (Cardiff)
  • Diane Felmlee (PSU)
Date Sep-2020
Venue 4th Annual Fall Meeting of the DAIS ITA, 2020