Detection Implicit Links and G-betweenness

TL;DR

This paper introduces the concept of implicit links and a cohesion factor for complex networks, along with a generalized betweenness measure, to better evaluate and rank nodes based on their hidden connections, demonstrated through numerical examples.

Contribution

The paper proposes new metrics for detecting implicit links and ranking nodes in complex networks, enhancing analysis beyond traditional methods.

Findings

Cohesion factor effectively identifies implicit links.

Generalized betweenness provides more detailed node ranking.

Numerical examples demonstrate the usefulness of the proposed concepts.

Abstract

A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a generalization of such characteristics as the betweenness, which allows to rank network nodes in more details. The effectiveness of the proposed concepts is shown by the numerical examples.