论文标题
可以操纵Pagerank中心以获得任何理想的排名吗？
Can the PageRank centrality be manipulated to obtain any desired ranking?
论文作者
论文摘要
Pagerank算法在塑造现代互联网方面的重要性不能被夸大，其复杂的网络理论基础仍然是研究的主题。在本文中，我们对Pagerank结果的结构和参数可控性进行了系统的研究，将光谱图理论问题转化为几何问题，其中其排名的自然表征出现了。此外，我们表明，所采用的透视图的变化可以应用于Biplex Pagerank提案，对真实和合成网络数据集进行数值计算以比较所使用的中心度度量。
The significance of the PageRank algorithm in shaping the modern Internet cannot be overstated, and its Complex Network theory foundations continue to be a subject of research. In this article we carry out a systematic study of the structural and parametric controllability of PageRank's outcomes, translating a spectral Graph Theory problem into a geometric one, where a natural characterization of its rankings emerges. Furthermore, we show that the change of perspective employed can be applied to the biplex PageRank proposal, performing numerical computations on both real and synthetic network datasets to compare centrality measures used.
