Results 31 to 40 of about 28,178 (293)
k-step betweenness centrality [PDF]
Computational and Mathematical Organization Theory, 2019 The notions of betweenness centrality (BC) and group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between ...
Melda Kevser Akgün, Mustafa Kemal Tural
openaire +2 more sources
Approximation of Interactive Betweenness Centrality in Large Complex Networks
Complexity, 2020 The analysis of real-world systems through the lens of complex networks often requires a node importance function. While many such views on importance exist, a frequently used global node importance measure is betweenness centrality, quantifying the ...
Sebastian Wandelt +2 more
doaj +1 more source
Betweenness Centrality – Incremental and Faster [PDF]
, 2014 We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positive real edge-weights. The current widely used algorithm to compute the betweenness centrality of all vertices in G is the Brandes algorithm that runs in O(mn + n^2 log n) time,
Meghana Nasre +2 more
openaire +2 more sources
Accelerating GPU betweenness centrality [PDF]
Communications of the ACM, 2018 Graphs that model social networks, numerical simulations, and the structure of the Internet are enormous and cannot be manually inspected. A popular metric used to analyze these networks is Betweenness Centrality (BC), which has applications in community detection, power grid contingency analysis, and the study of the human brain.
Adam McLaughlin, David A. Bader
openaire +3 more sources
Promet (Zagreb), 2022 The centrality of stations is one of the most important issues in urban transit systems. The central stations of such networks have often been identified using network to-pological centrality measures.
Ruiyong Tong +4 more
doaj +1 more source
Efficient computation of the Shapley value for game-theoretic network centrality [PDF]
, 2013 The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in net-works.
Michalak, T +13 more
core +1 more source
Fast computing betweenness centrality with virtual nodes on large sparse networks. [PDF]
PLoS ONE, 2011 Betweenness centrality is an essential index for analysis of complex networks. However, the calculation of betweenness centrality is quite time-consuming and the fastest known algorithm uses O(N(M + N log N)) time and O(N + M) space for weighted networks,
Jing Yang, Yingwu Chen
doaj +1 more source
Centrality Learning: Auralization and Route Fitting
Entropy, 2023 Developing a tailor-made centrality measure for a given task requires domain- and network-analysis expertise, as well as time and effort. Thus, automatically learning arbitrary centrality measures for providing ground-truth node scores is an important ...
Xin Li, Liav Bachar, Rami Puzis
doaj +1 more source
PERFORMANCE EVALUATION OF BETWEENNESS CENTRALITY USING CLUSTERING METHODS
Studia Universitatis Babes-Bolyai: Series Informatica, 2020 Betweenness centrality measure is used as a general measure of centrality, which can be applied in many scientific fields like social networks, biological networks, telecommunication networks or even in any area that can be well modelled using complex ...
Bence SZABARI, Attila KISS
doaj +1 more source
Eigenvector centrality mapping for analyzing connectivity patterns in fMRI data of the human brain. [PDF]
PLoS ONE, 2010 Functional magnetic resonance data acquired in a task-absent condition ("resting state") require new data analysis techniques that do not depend on an activation model. In this work, we introduce an alternative assumption- and parameter-free method based
Gabriele Lohmann +9 more
doaj +1 more source