{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:31:19Z","timestamp":1760488279066,"version":"build-2065373602"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007511","name":"Universidad Rey Juan Carlos","doi-asserted-by":"publisher","award":["M3707","PREDOC-21-026-2164"],"award-info":[{"award-number":["M3707","PREDOC-21-026-2164"]}],"id":[{"id":"10.13039\/501100007511","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013410","name":"Instituto Nacional de Ciberseguridad","doi-asserted-by":"publisher","award":["M3386\/2024\/0031\/001"],"award-info":[{"award-number":["M3386\/2024\/0031\/001"]}],"id":[{"id":"10.13039\/501100013410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s40314-025-03336-2","type":"journal-article","created":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T06:59:47Z","timestamp":1754031587000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fully personalized PageRank and algebraic methods to distribute a random walker"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8118-6403","authenticated-orcid":false,"given":"Gonzalo","family":"Contreras-Aso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7954-6169","authenticated-orcid":false,"given":"Regino","family":"Criado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9259-9716","authenticated-orcid":false,"given":"Miguel","family":"Romance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"8","key":"3336_CR1","doi-asserted-by":"publisher","DOI":"10.1063\/5.0203824","volume":"34","author":"D Aleja","year":"2024","unstructured":"Aleja D, Flores J, Primo E, Romance M (2024) Time-dependent personalized PageRank for temporal networks: discrete and continuous scales. Chaos An Interdiscip J Nonlinear Sci 34(8):083145. https:\/\/doi.org\/10.1063\/5.0203824","journal-title":"Chaos An Interdiscip J Nonlinear Sci"},{"issue":"2235","key":"3336_CR2","first-page":"20190653","volume":"476","author":"F Arrigo","year":"2020","unstructured":"Arrigo F, Higham DJ, Noferini V (2020) Beyond non-backtracking: non-cycling network centrality measures. Proc R Soc A Math Phys Eng Sci 476(2235):20190653","journal-title":"Proc R Soc A Math Phys Eng Sci"},{"doi-asserted-by":"publisher","unstructured":"Avrachenkov K, Litvak N (2006) The effect of new links on google PageRank. Stoch Model 22(2):319\u2013331. https:\/\/doi.org\/10.1080\/15326340600649052","key":"3336_CR3","DOI":"10.1080\/15326340600649052"},{"doi-asserted-by":"crossref","unstructured":"Avrachenkov K, Hofstad R, Sokol M (2014) Personalized PageRank with node-dependent restart. In: Bonato A, Graham FC, Pra\u0142at P (eds) Algorithms and models for the web graph. Springer, Cham, pp 23\u201333","key":"3336_CR4","DOI":"10.1007\/978-3-319-13123-8_3"},{"issue":"5439","key":"3336_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"issue":"3","key":"3336_CR6","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1111\/j.1083-6101.2007.00356.x","volume":"12","author":"J Bar-Ilan","year":"2007","unstructured":"Bar-Ilan J (2007) Google bombing from a time perspective. J Comput-Mediat Commun 12(3):910\u2013938","journal-title":"J Comput-Mediat Commun"},{"issue":"4\u20135","key":"3336_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424(4\u20135):175\u2013308","journal-title":"Phys Rep"},{"doi-asserted-by":"publisher","unstructured":"Boldi P, Santini M, Vigna S (2005) PageRank as a function of the damping factor. In: Proceedings of the 14th international conference on world wide web, pp 557\u2013566. Association for computing machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1060745.1060827","key":"3336_CR8","DOI":"10.1145\/1060745.1060827"},{"key":"3336_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/270732","volume":"4","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Technique for analyzing overlapping memberships. Sociol Methodol 4:176\u2013185","journal-title":"Sociol Methodol"},{"unstructured":"Borkar VS, Sowmya S, Tripathi R (2025) Small noise limits of markov chains and the pagerank. arXiv preprint arXiv:2503.05137","key":"3336_CR10"},{"doi-asserted-by":"crossref","unstructured":"Bowater D, Stefanakis E (2023) PageRank centrality with non-local random walk-based teleportation. J Complex Networks 11(4):024","key":"3336_CR11","DOI":"10.1093\/comnet\/cnad024"},{"unstructured":"CASOS Network Datasets","key":"3336_CR12"},{"key":"3336_CR13","volume-title":"Search engine optimization-best practice guide","author":"D Chaffey","year":"2009","unstructured":"Chaffey D, Lake C, Friedlein A (2009) Search engine optimization-best practice guide. Econsultancy, London"},{"issue":"3","key":"3336_CR14","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1287\/moor.2021.1186","volume":"47","author":"R Cominetti","year":"2022","unstructured":"Cominetti R, Quattropani M, Scarsini M (2022) The buck-passing game. Math Oper Res 47(3):1731\u20131756","journal-title":"Math Oper Res"},{"issue":"8","key":"3336_CR15","doi-asserted-by":"publisher","first-page":"083152","DOI":"10.1063\/5.0156226","volume":"33","author":"G Contreras-Aso","year":"2023","unstructured":"Contreras-Aso G, Criado R, Romance M (2023) Can the PageRank centrality be manipulated to obtain any desired ranking? Chaos Interdiscip J Nonlinear Sci 33(8):083152. https:\/\/doi.org\/10.1063\/5.0156226","journal-title":"Chaos Interdiscip J Nonlinear Sci"},{"doi-asserted-by":"crossref","unstructured":"Cs\u00e1ji BC, Jungers RM, Blondel VD (2014) PageRank optimization by edge selection. Discret Appl Math 169:73\u201387","key":"3336_CR16","DOI":"10.1016\/j.dam.2014.01.007"},{"issue":"1","key":"3336_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/TAC.2012.2226103","volume":"58","author":"O Fercoq","year":"2013","unstructured":"Fercoq O, Akian M, Bouhtou M, Gaubert S (2013) Ergodic control and polyhedral approaches to pagerank optimization. IEEE Trans Autom Control 58(1):134\u2013148. https:\/\/doi.org\/10.1109\/TAC.2012.2226103","journal-title":"IEEE Trans Autom Control"},{"unstructured":"Frobenius GF (1912) \u00dcber Matrizen aus Nicht Negativen Elementen. K\u00f6nigliche Akademie der Wissenschaften. https:\/\/books.google.es\/books?id=LjCDtAEACAAJ","key":"3336_CR18"},{"issue":"3","key":"3336_CR19","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.laa.2012.10.051","volume":"439","author":"E Garc\u00eda","year":"2013","unstructured":"Garc\u00eda E, Pedroche F, Romance M (2013) On the localization of the personalized pagerank of complex networks. Linear Algebra Appl 439(3):640\u2013652. https:\/\/doi.org\/10.1016\/j.laa.2012.10.051","journal-title":"Linear Algebra Appl"},{"doi-asserted-by":"publisher","unstructured":"Gleich DF (2015) PageRank beyond the web. SIAM Rev 57(3):321\u2013363. https:\/\/doi.org\/10.1137\/140976649","key":"3336_CR20","DOI":"10.1137\/140976649"},{"unstructured":"Govan AY (2008) Ranking theory with application to popular sports","key":"3336_CR21"},{"doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT\u2014The Koblenz network collection. In: Proceedings of international conference on world wide web companion http:\/\/dl.acm.org\/citation.cfm?id=2488173, pp 1343\u20131350. http:\/\/dl.acm.org\/citation.cfm?id=2488173","key":"3336_CR22","DOI":"10.1145\/2487788.2488173"},{"doi-asserted-by":"publisher","unstructured":"Langville A, Meyer C (2004) Deeper inside PageRank. Int Math 1:335\u2013380. https:\/\/doi.org\/10.1080\/15427951.2004.10129091","key":"3336_CR23","DOI":"10.1080\/15427951.2004.10129091"},{"doi-asserted-by":"crossref","unstructured":"Langville AN, Meyer CD (2006) Google\u2019s PageRank and beyond, the science of search engine rankings. Princeton University Press, Princeton","key":"3336_CR24","DOI":"10.1515\/9781400830329"},{"key":"3336_CR25","volume-title":"Linear algebra and its applications","author":"PD Lax","year":"2007","unstructured":"Lax PD (2007) Linear algebra and its applications, 2nd edn. Wiley-Interscience, Hoboken, NJ","edition":"2"},{"key":"3336_CR26","volume-title":"Matrix analysis and applied linear algebra","author":"CD Meyer","year":"2001","unstructured":"Meyer CD (2001) Matrix analysis and applied linear algebra. SIAM, Philadelphia"},{"key":"3336_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1186\/1471-2105-6-233","volume":"6","author":"J Morrison","year":"2005","unstructured":"Morrison J, Breitling R, Higham D, Gilbert D (2005) Generank: using search engine technology for the analysis of microarray experiments. BMC Bioinform 6:233. https:\/\/doi.org\/10.1186\/1471-2105-6-233","journal-title":"BMC Bioinform"},{"key":"3336_CR28","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford, New York"},{"key":"3336_CR29","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1038\/srep00218","volume":"2","author":"V Nicosia","year":"2012","unstructured":"Nicosia V, Criado R, Romance M, Russo G, Latora V (2012) Controlling centrality in complex networks. Sci Rep 2:218. https:\/\/doi.org\/10.1038\/srep00218","journal-title":"Sci Rep"},{"doi-asserted-by":"crossref","unstructured":"Olsen M (2010) Maximizing PageRank with new backlinks. In: Calamoneri T, Diaz J (eds) Algorithms and complexity. Springer, Berlin, Heidelberg, pp 37\u201348","key":"3336_CR30","DOI":"10.1007\/978-3-642-13073-1_5"},{"unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the web. In: Proceedings of the 7th international world wide web conference, pp 161\u2013172","key":"3336_CR31"},{"issue":"2","key":"3336_CR32","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BF01449896","volume":"64","author":"O Perron","year":"1907","unstructured":"Perron O (1907) Zur theorie der matrices. Math Ann 64(2):248\u2013263","journal-title":"Math Ann"},{"unstructured":"Saxena A, Iyengar S (2020) Centrality measures in complex networks: a survey. https:\/\/arxiv.org\/abs\/2011.07190","key":"3336_CR33"},{"unstructured":"Sheldon D (2010) Manipulation of PageRank and collective hidden Markov models. PhD thesis, Cornell University","key":"3336_CR34"},{"issue":"4","key":"3336_CR35","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/nws.2016.21","volume":"4","author":"S Vigna","year":"2016","unstructured":"Vigna S (2016) Spectral ranking. Netw Sci 4(4):433\u2013445","journal-title":"Netw Sci"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03336-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03336-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03336-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:12:42Z","timestamp":1760440362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03336-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["3336"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03336-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"383"}}