Rankings in the Zerkani network by a game theoretical approach

02/11/2022
by   Encarnación Algaba, et al.
0

This paper introduces the Banzhaf and Banzhaf-Owen values as novel centrality measures for ranking terrorists in a network. This new approach let integrate the complete topology (i.e. nodes and edges) of the network and a coalitional structure on the nodes of the network. More precisely, the characteristics of the nodes (e.g., terrorists) of the network and their possible relationships (e.g., types of communication links), as well as coalitional information (e.g. level of hierarchies) independent of the network. First, for both centrality measures, we provide approximation algorithms and the corresponding R-codes. Second, as illustration, we rank the members of the Zerkani network, responsible for the attacks in Paris (2015) and Brussels (2016). Finally, we give a comparison between the rankings established by Banzhaf and Banzhaf-Owen and the rankings obtained when using the Shapley value (cf. Hamers et al., 2019) and the Owen value as centrality measures

READ FULL TEXT
research
01/28/2020

Nonlocal PageRank

In this work we introduce and study a nonlocal version of the PageRank. ...
research
07/10/2018

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

Network analysis defines a number of centrality measures to identify the...
research
04/21/2020

Rankings of countries based on rankings of universities

Although many methods have been designed for ranking universities, there...
research
11/10/2022

Can one hear the position of nodes?

Wave propagation through nodes and links of a network forms the basis of...
research
07/15/2015

Associative Measures and Multi-word Unit Extraction in Turkish

Associative measures are "mathematical formulas determining the strength...
research
10/27/2020

Concentric mixtures of Mallows models for top-k rankings: sampling and identifiability

In this paper, we consider mixtures of two Mallows models for top-k rank...
research
04/17/2023

On approximating the temporal betweenness centrality through sampling

We present a collection of sampling-based algorithms for approximating t...

Please sign up or login with your details

Forgot password? Click here to reset