Results 21 to 30 of about 139,675 (284)
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 +2 more sources
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 +3 more sources
Jurnal Matematika Integratif, 2022 Energi listrik sangat penting untuk memenuhi kebutuhan masyarakat secara umum dan terkhusus instansi pendidikan yang kini mengandalkan teknologi dalam proses pembelajaran.
Jeane R. M. D. P Chantique +2 more
doaj +1 more source
Betweenness Centrality in Random Trees [PDF]
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2015 Betweenness centrality is a quantity that is frequently used in graph theory to measure how “central” a vertex v is. It is defined as the sum, over pairs of vertices other than v, of the proportions of shortest paths that pass through v. In this paper, we study the distribution of the betweenness centrality in random trees and related, subcritical ...
Kevin Durant, Stephan Wagner 0003
openaire +1 more source
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
A new measure of centrality for brain networks. [PDF]
PLoS ONE, 2010 Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components.
Karen E Joyce +3 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 +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
Relative edge betweenness centrality
Ars Mathematica Contemporanea, 2016 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 +6 more sources
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