The Method of Leader’s Overthrow in Networks

Abstract

Methods for leader’s detection and overthrow in networks are useful tools for decision-making in many real-life cases, such as criminal networks with hidden patterns or money laundering networks. In the given research, we represent the algorithms that detect and overthrow the most influential node to the weaker positions following the greedy method in terms of structural modifications. We employed the concept of Shapley value from the area of cooperative games to measure a node’s leadership and used it as the core of the developed leader’s overthrow algorithms. The approaches are illustrated based on the trivial network structures and tested on real-life networks. The results are represented in tabular and graphical formats.