Results 1 to 10 of about 54,974 (279)
Betweenness centrality for temporal multiplexes [PDF]
Betweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers.
Silvia Zaoli +2 more
doaj +8 more sources
Uniform edge betweenness centrality [PDF]
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. It is
Heather Newman +3 more
doaj +3 more sources
Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation [PDF]
Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks.
Nan Xiang, Qilin Wang, Mingwei You
doaj +2 more sources
A spatial interaction incorporated betweenness centrality measure. [PDF]
Betweenness centrality (BC) is widely used to identify critical nodes in a network by exploring the ability of all nodes to act as intermediaries for information exchange. However, one of its assumptions, i.e., the contributions of all shortest paths are
Xiaohuan Wu +5 more
doaj +2 more sources
Edge betweenness centrality as a failure predictor in network models of structurally disordered materials [PDF]
Network theoretical measures such as geodesic edge betweenness centrality (GEBC) have been proposed as failure predictors in network models of load-driven materials failure.
Mahshid Pournajar +2 more
doaj +2 more sources
ABCDE: Approximating Betweenness-Centrality ranking with progressive-DropEdge [PDF]
Betweenness-centrality is a popular measure in network analysis that aims to describe the importance of nodes in a graph. It accounts for the fraction of shortest paths passing through that node and is a key measure in many applications including ...
Martin Mirakyan
doaj +3 more sources
Betweenness Centrality in Large Complex Networks [PDF]
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent $\eta$. We find that for trees or networks with a small loop density $\eta=2$ while a larger
Barthelemy, Marc
core +4 more sources
Betweenness centrality correlation in social networks [PDF]
Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative and neutral networks according to the behavior of the degree-degree correlation coefficient.
Goh, K. -I., Kahng, B., Kim, D., Oh, E.
core +4 more sources
Two betweenness centrality measures based on Randomized Shortest Paths. [PDF]
This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods ...
Kivimäki I +3 more
europepmc +2 more sources
Betweenness centrality in Cartesian product of graphs [PDF]
Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +4 more sources

