Results 11 to 20 of about 28,178 (293)

Betweenness centrality for temporal multiplexes [PDF]

open access: yesScientific Reports, 2021
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   +10 more sources

Uniform edge betweenness centrality [PDF]

open access: yesElectronic Journal of Graph Theory and Applications, 2020
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   +4 more sources

Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths

open access: yesMathematics, 2022
Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng, Huaixi Wang
exaly   +4 more sources

Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation [PDF]

open access: yesScientific Reports, 2023
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]

open access: yesPLoS ONE, 2022
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]

open access: yesScientific Reports, 2022
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]

open access: yesPeerJ Computer Science, 2021
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

A faster algorithm for betweenness centrality* [PDF]

open access: yesJournal of Mathematical Sociology, 2001
Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n + m) space and run in O(nm) and O(nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Ulrik Brandes
exaly   +3 more sources

Betweenness centrality in Cartesian product of graphs [PDF]

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
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

Betweenness centrality profiles in trees [PDF]

open access: yesJournal of Complex Networks, 2017
Abstract Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The $k$-betweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most $k$. The sequence of $
Benjamin Fish   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy