On PageRank versatility for multiplex networks: properties and some useful bounds
MATHEMATICAL METHODS IN THE APPLIED SCIENCES(2020)
Abstract
In this paper, some results concerning the PageRank versatility measure for multiplex networks are given. This measure extends to the multiplex setting the well-known classic PageRank. Particularly, we focus on some spectral properties of the Laplacian matrix of the multiplex and on obtaining boundaries for the ranking value of a given node when some personalization vector is added, as in the classic setting.
MoreTranslated text
Key words
versatility,Laplacian matrices,PageRank,centrality measures,multiplex networks
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined