Parametric control of PageRank centrality rankings: a geometrical approach

The PageRank algorithm is a landmark in the development of the Internet as we know it, and its network-theoretic properties are still being studied. Here we present a series of results regarding the parametric controllability of its centralities, and develop a geometric method to crack the problem of assessing the control of its rankings. We apply these methods to the biplex PageRank case, comparing both centrality measures by means of numerical computations on real and synthetic network datasets.