Node-weighted centrality: a new way of centrality hybridization
نویسندگان
چکیده
منابع مشابه
Eigenvector-centrality - a node-centrality?
Networks of social relations can be represented by graphs and socioor adjacency-matrices and their structure can be analyzed using different concepts, one of them called centrality. We will provide a new formalization of a “node-centrality” which leads to some properties a measure of centrality has to satisfy. These properties allow to test given measures, for example measures based on degree, ...
متن کاملLaplacian centrality: A new centrality measure for weighted networks
The centrality of vertices has been a key issue in network analysis. For unweighted networks where edges are just present or absent and have no weight attached, many centrality measures have been presented, such as degree, betweenness, closeness, eigenvector and subgraph centrality. There has been a growing need to design centrality measures for weighted networks, because weighted networks wher...
متن کاملNode centrality in weighted networks: Generalizing degree and shortest paths
Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been operationalized as weights. A few network measures have been proposed for weighted networks, including three common measures of node centrality: degree, closeness, and betweenness. However, these generalizations have solely focused on tie weights, and not on the number of tie...
متن کاملAttachment Centrality for Weighted Graphs
Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity. Unfortunately, the Attachment Centrality is defined only for unwei...
متن کاملPath Centrality: A New Centrality Measure in Social Networks
Processing large graphs is an emerging and increasingly important computation in a variety of application domains, from social networking to genomics and marketing. One of the important and computationally challenging structural graph metrics is node betweenness centrality, a measure of influence of a node in the graph. The best known algorithm for computing exact betweenness centrality runs in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Social Networks
سال: 2020
ISSN: 2197-4314
DOI: 10.1186/s40649-020-00081-w