network analysis
Recently Published Documents


TOTAL DOCUMENTS

18178
(FIVE YEARS 9829)

H-INDEX

150
(FIVE YEARS 43)

2022 ◽  
Vol 9 (3) ◽  
pp. 533-546
Author(s):  
Hao Wu ◽  
Xin Luo ◽  
MengChu Zhou ◽  
Muhyaddin J. Rawa ◽  
Khaled Sedraoui ◽  
...  

2022 ◽  
Vol 148 ◽  
pp. 105648
Author(s):  
Vanessa Becker Bertoni ◽  
Tarcisio Abreu Saurin ◽  
Flávio Sanson Fogliatto

2022 ◽  
Vol 7 ◽  
pp. 100153
Author(s):  
Bruna de Paula Fonseca ◽  
Priscila Costa Albuquerque ◽  
Raphael de Freitas Saldanha ◽  
Fabio Zicker

2022 ◽  
Vol 27 (2) ◽  
pp. 1-25
Author(s):  
Somesh Singh ◽  
Tejas Shah ◽  
Rupesh Nasre

Betweenness centrality (BC) is a popular centrality measure, based on shortest paths, used to quantify the importance of vertices in networks. It is used in a wide array of applications including social network analysis, community detection, clustering, biological network analysis, and several others. The state-of-the-art Brandes’ algorithm for computing BC has time complexities of and for unweighted and weighted graphs, respectively. Brandes’ algorithm has been successfully parallelized on multicore and manycore platforms. However, the computation of vertex BC continues to be time-consuming for large real-world graphs. Often, in practical applications, it suffices to identify the most important vertices in a network; that is, those having the highest BC values. Such applications demand only the top vertices in the network as per their BC values but do not demand their actual BC values. In such scenarios, not only is computing the BC of all the vertices unnecessary but also exact BC values need not be computed. In this work, we attempt to marry controlled approximations with parallelization to estimate the k -highest BC vertices faster, without having to compute the exact BC scores of the vertices. We present a host of techniques to determine the top- k vertices faster , with a small inaccuracy, by computing approximate BC scores of the vertices. Aiding our techniques is a novel vertex-renumbering scheme to make the graph layout more structured , which results in faster execution of parallel Brandes’ algorithm on GPU. Our experimental results, on a suite of real-world and synthetic graphs, show that our best performing technique computes the top- k vertices with an average speedup of 2.5× compared to the exact parallel Brandes’ algorithm on GPU, with an error of less than 6%. Our techniques also exhibit high precision and recall, both in excess of 94%.


2022 ◽  
Vol 13 (1) ◽  
pp. 1-29
Author(s):  
Marcin Waniek ◽  
Tomasz P. Michalak ◽  
Michael Wooldridge ◽  
Talal Rahwan

Centrality measures are the most commonly advocated social network analysis tools for identifying leaders of covert organizations. While the literature has predominantly focused on studying the effectiveness of existing centrality measures or developing new ones, we study the problem from the opposite perspective, by focusing on how a group of leaders can avoid being identified by centrality measures as key members of a covert network. More specifically, we analyze the problem of choosing a set of edges to be added to a network to decrease the leaders’ ranking according to three fundamental centrality measures, namely, degree, closeness, and betweenness. We prove that this problem is NP-complete for each measure. Moreover, we study how the leaders can construct a network from scratch, designed specifically to keep them hidden from centrality measures. We identify a network structure that not only guarantees to hide the leaders to a certain extent but also allows them to spread their influence across the network.


Sign in / Sign up

Export Citation Format

Share Document