Results 31 to 40 of about 55,464 (281)
Relative edge betweenness centrality
We introduce a new edge centrality measure - relative edge betweenness γ(uv) = b(uv) / √(c(u)c(v)), where b(uv) is the standard edge betweenness and c(u) is the adjusted vertex betweenness. In this alternative definition, the importance of an edge is normalized with respect to the importance of its end-vertices. This gives a better presentation of the “
Škrekovski, Riste +2 more
openaire +5 more sources
Accelerating GPU betweenness centrality [PDF]
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.
McLaughlin, Adam, Bader, David A
openaire +3 more sources
Fast computing betweenness centrality with virtual nodes on large sparse networks. [PDF]
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
Betweenness Centrality – Incremental and Faster [PDF]
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,
Nasre, Meghana +2 more
openaire +2 more sources
Centrality Learning: Auralization and Route Fitting
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
Alpha Current Flow Betweenness Centrality [PDF]
A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge.
Avrachenkov, Konstantin +3 more
openaire +3 more sources
PERFORMANCE EVALUATION OF BETWEENNESS CENTRALITY USING CLUSTERING METHODS
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
Reducing agricultural carbon emissions is an important aspect of achieving China’s carbon peak and neutrality goals. Different agricultural centrality result in different agriculture status and role in different regions, affecting agricultural carbon ...
Huanhuan He, Rijia Ding
doaj +1 more source
Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks [PDF]
We study the betweenness centrality of fractal and non-fractal scale-free network models as well as real networks. We show that the correlation between degree and betweenness centrality $C$ of nodes is much weaker in fractal network models compared to ...
Havlin, Shlomo +5 more
core +3 more sources
Where to look for power Laws in urban road networks?
Spatial embeddedness and planarity of urban road networks limit the range of their node degree values. Therefore, pursuing analysis based on the distribution of node degrees e.g. scale free aspect could not be accomplished in urban road networks. We have
Meisam Akbarzadeh +2 more
doaj +1 more source

