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.
REFERENCES
1.
L.
Page
, S.
Brin
, R.
Motwani
, and T.
Winograd
, “The PageRank citation ranking: Bringing order to the web,” in Proceedings of the 7th International World Wide Web Conference (Elsevier, 1998), pp. 161–172.2.
M.
Bianchini
, M.
Gori
, and F.
Scarselli
, “Inside PageRank
,” ACM Trans. Int. Tech.
5
, 92
–128
(2005
). 3.
A.
Langville
and C.
Meyer
, “Deeper inside PageRank
,” Internet Math.
1
, 335
–380
(2004
). 4.
P.
Boldi
, M.
Santini
, and S.
Vigna
, “PageRank as a function of the damping factor,” in Proceedings of the 14th International Conference on World Wide Web (Association for Computing Machinery, New York, NY, 2005), pp. 557–566.5.
P.
Boldi
, M.
Santini
, and S.
Vigna
, “PageRank: Functional dependencies
,” ACM Trans. Inf. Syst.
27
, 19 (2009
). 6.
A. N.
Langville
and C. D.
Meyer
, Google’s PageRank and Beyond
(Princeton University Press
, 2006
).7.
D. F.
Gleich
, “PageRank beyond the web
,” SIAM Rev.
57
, 321
–363
(2015
). 8.
D.
Chaffey
, C.
Lake
, and A.
Friedlein
, Search Engine Optimization—Best Practice Guide (Econsultancy.com Ltd, 2009).9.
10.
M. R.
Henzinger
, “Hyperlink analysis for the web
,” IEEE Internet Comput.
5
, 45
–50
(2001
). 11.
P. R.
Olsen
, “A future in directing online traffic,” The New York Times 10 (2009).12.
E.
García
, F.
Pedroche
, and M.
Romance
, “On the localization of the personalized PageRank of complex networks
,” Linear Algebra Appl.
439
, 640
–652
(2013
). 13.
V.
Nicosia
, R.
Criado
, M.
Romance
, G.
Russo
, and V.
Latora
, “Controlling centrality in complex networks
,” Sci. Rep.
2
, 218
(2012
), arXiv:1109.4521. 14.
K.
Avrachenkov
and N.
Litvak
, “The effect of new links on Google PageRank
,” Stoch. Models
22
, 319
–331
(2006
). 15.
C.
de Kerchove
, L.
Ninove
, and P.
van Dooren
, “Maximizing PageRank via outlinks
,” Linear Algebra Appl.
429
, 1254
–1276
(2008
). 16.
M.
Olsen
, “Maximizing PageRank with new backlinks,” in Algorithms and Complexity, edited by T. Calamoneri and J. Diaz (Springer Berlin Heidelberg, 2010), pp. 37–48.17.
V.
Carchiolo
, M.
Grassia
, A.
Longheu
, M.
Malgeri
, and G.
Mangioni
, “Long distance in-links for ranking enhancement,” in Intelligent Distributed Computing XII, edited by J. Del Ser, E. Osaba, M. N. Bilbao, J. J. Sanchez-Medina, M. Vecchio, and X.-S. Yang (Springer International Publishing, Cham, 2018), pp. 3–10.18.
F.
Pedroche
, M.
Romance
, and R.
Criado
, “A biplex approach to PageRank centrality: From classic to multiplex networks
,” Chaos
26
, 065301
(2016
). 19.
M.
Rosvall
and C. T.
Bergstrom
, “Maps of random walks on complex networks reveal community structure
,” Proc. Natl. Acad. Sci. U. S. A.
105
, 1118
–1123
(2008
). 20.
R.
Lambiotte
and M.
Rosvall
, “Ranking and clustering of nodes in networks with smart teleportation
,” Phys. Rev. E
85
, 056107
(2012
). 21.
22.
When there are dangling nodes involved, one can resort to the standard trickery of substituting
, where
is the distribution of dangling nodes and
is the distribution of imposed outgoing links from them (see, for instance, Ref. 12).
23.
A.-L.
Barabási
and R.
Albert
, “Emergence of scaling in random networks
,” Science
286
, 509
–512
(1999
), arXiv:cond-mat/9910332. 24.
It should be noted that in order to perform this computation we had to deal with the issue of the dangling nodes, which we glossed over at the beginning of this section. We deemed adding a single, random connection from each dangling node to another, non-danging node as the simplest, least intrusive way to remove this issue.
25.
J.
Kunegis
, “KONECT—The Koblenz Network Collection,” in Proceedings of the Internatioinal Conference on World Wide Web Companion (International World Wide Web Conferences Steering Committee, 2013), pp. 1343–1350.26.
See http://www.casos.cs.cmu.edu/tools/data2.php for “Casos network datasets.”
27.
J.
Morrison
, R.
Breitling
, D.
Higham
, and D.
Gilbert
, “Generank: Using search engine technology for the analysis of microarray experiments
,” BMC Bioinf.
6
, 233
(2005
). 28.
V.
Freschi
, “Protein function prediction from interaction networks using a random walk ranking algorithm,” in 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering (IEEE, 2007), pp. 42–48.29.
J.-Y.
Pan
, H.-J.
Yang
, C.
Faloutsos
, and P.
Duygulu
, “Automatic multimedia cross-modal correlation discovery,” in Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’04 (Association for Computing Machinery, New York, NY, 2004), pp. 653–658.30.
S.
Boccaletti
, G.
Bianconi
, R.
Criado
, C.
del Genio
, J.
Gómez-Gardeñes
, M.
Romance
, I.
Sendiña-Nadal
, Z.
Wang
, and M.
Zanin
, “The structure and dynamics of multilayer networks
,” Phys. Rep.
544
, 1
–122
(2014
). 31.
F.
Pedroche
, E.
García
, M.
Romance
, and R.
Criado
, “Sharp estimates for the personalized Multiplex PageRank
,” J. Comput. Appl. Math.
330
, 1030
–1040
(2018
). 32.
J.
Flores
, E.
García
, F.
Pedroche
, and M.
Romance
, “Parametric controllability of the personalized PageRank: Classic model vs biplex approach
,” Chaos
30
, 023115
(2020
). 33.
B.
Bollobás
, C.
Borgs
, J. T.
Chayes
, and O.
Riordan
, “Directed scale-free graphs,” in ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, 2003).34.
G.
Contreras-Aso
, R.
Criado
, and M.
Romance
(2022
). “PageRank centrality control,” GitHub. https://github.com/LaComarca-Lab/PageRank_CentralityControl.© 2023 Author(s). Published under an exclusive license by AIP Publishing.
2023
Author(s)
You do not currently have access to this content.