A Centrality Measure for Directed Networks: m-Ranking Method

Author(s):  
Reji Kumar ◽  
Shibu Manuel
2019 ◽  
Author(s):  
J.R. (René) van den Brink ◽  
Agnieszka Rusinowska

2018 ◽  
Vol 7 (4.10) ◽  
pp. 566
Author(s):  
B Jaganathan ◽  
Kalyani Desikan

In today's era of computer technology where users want not only the most relevant data but they also want the data as quickly as possible. Hence, ranking web pages becomes a crucial task. The purpose of this research is to find a centrality measure that can be used in place of original page rank. In this article concept of Laplacian centrality measure for directed web graph has been introduced to identify the web page ranks. Comparison between the original page rank and Laplacian centrality based Page rank has been made. Kendall's  correlation co-efficient has been used as a measure to find the correlation between the original page rank and Laplacian centrality measure based page rank.  


Author(s):  
Stephen P. Borgatti ◽  
Martin G. Everett

This chapter presents three different perspectives on centrality. In part, the motivation is definitional: what counts as a centrality measure and what doesn’t? But the primary purpose is to lay out ways that centrality measures are similar and dissimilar and point to appropriate ways of interpreting different measures. The first perspective the chapter considers is the “walk structure participation” perspective. In this perspective, centrality measures indicate the extent and manner in which a node participates in the walk structure of a graph. A typology is presented that distinguishes measures based on dimensions such as (1) what kinds of walks are considered (e.g., geodesics, paths, trails, or unrestricted walks) and (2) whether the number of walks is counted or the length of walks is assessed, or both. The second perspective the chapter presents is the “induced centrality” perspective, which views a node’s centrality as its contribution to a specific graph invariant—typically some measure of the cohesiveness of the network. Induced centralities are computed by calculating the graph invariant, removing the node in question, and recalculating the graph invariant. The difference is the node’s centrality. The third perspective is the “flow outcomes” perspective. Here the chapter views centralities as estimators of node outcomes in some kind of propagation process. Generic node outcomes include how often a bit of something propagating passes through a node and the time until first arrival of something flowing. The latter perspective leads us to consider the merits of developing custom measures for different research settings versus using off-the-shelf measures that were not necessarily designed for the current purpose.


2021 ◽  
pp. 1-1
Author(s):  
Mohammadreza Doostmohammadian ◽  
Alireza Aghasi ◽  
Themistoklis Charalambous ◽  
Usman A. Khan

2021 ◽  
Vol 455 ◽  
pp. 109648
Author(s):  
Livia Paleari ◽  
Ermes Movedi ◽  
Michele Zoli ◽  
Andrea Burato ◽  
Irene Cecconi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document