PageRank centrality and algorithms for weighted, directed networks with applications to World Input-Output Tables

by   Panpan Zhang, et al.

PageRank (PR) is a fundamental tool for assessing the relative importance of the nodes in a network. In this paper, we propose a measure, weighted PageRank (WPR), extended from the classical PR for weighted, directed networks with possible non-uniform node-specific information that is dependent or independent of network structure. A tuning parameter leveraging node degree and strength is introduced. An efficient algorithm based on R program has been developed for computing WPR in large-scale networks. We have tested the proposed WPR on widely used simulated network models, and found it outperformed other competing measures in the literature. By applying the proposed WPR to the real network data generated from World Input-Output Tables, we have seen the results that are consistent with the global economic trends, which renders it a preferred measure in the analysis.



There are no comments yet.


page 8

page 10


Assortativity measures for weighted and directed networks

Assortativity measures the tendency of a vertex in a network being conne...

Nonequilibrium Thermodynamics in Measuring Carbon Footprints: Disentangling Structure and Artifact in Input-Output Accounting

Multiregional input-output (MRIO) tables, in conjunction with Leontief a...

Regional and Sectoral Structures and Their Dynamics of Chinese Economy: A Network Perspective from Multi-Regional Input-Output Tables

A multi-regional input-output table (MRIOT) containing the transactions ...

Hierarchical Clustering and Matrix Completion for the Reconstruction of World Input-Output Tables

World Input-Output (I/O) matrices provide the networks of within- and cr...

An Efficient Algorithm for Generating Directed Networks with Predetermined Assortativity Measures

Assortativity coefficients are important metrics to analyze both directe...

Overlapping and nonoverlapping models

Consider a directed network with K_r row communities and K_c column comm...

Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior

Learning the network structure underlying data is an important problem i...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.