{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:04:37Z","timestamp":1781197477239,"version":"3.54.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.amc.2026.130182","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T10:04:09Z","timestamp":1780308249000},"page":"130182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Effects of backtracking on PageRank"],"prefix":"10.1016","volume":"531","author":[{"given":"Cory","family":"Glover","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tyler","family":"Jones","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5963-0056","authenticated-orcid":false,"given":"Mark","family":"Kempton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alice","family":"Oveson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130182_bib0001","series-title":"Technical Report","article-title":"The PageRank Citation Ranking: Bringing Order to the Web","author":"Page","year":"1999"},{"key":"10.1016\/j.amc.2026.130182_bib0002","series-title":"Proc. COLING","first-page":"1126","article-title":"PageRank on semantic networks with application to word sense disambiguation","author":"Mihalcea","year":"2004"},{"key":"10.1016\/j.amc.2026.130182_bib0003","article-title":"Identifying key users in online social networks: a PageRank-based approach","volume":"79","author":"Heidemann","year":"2010","journal-title":"Proc. ICIS"},{"key":"10.1016\/j.amc.2026.130182_bib0004","series-title":"Proc. VLDB","article-title":"Combating web spam with TrustRank","author":"Gyongyi","year":"2004"},{"key":"10.1016\/j.amc.2026.130182_bib0005","article-title":"Application of modified PageRank algorithm for anomaly detection in movements of older adults","author":"Payandeh","year":"2019","journal-title":"Int. J. Telemed. Appl."},{"issue":"3","key":"10.1016\/j.amc.2026.130182_bib0006","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1007\/s10915-019-00981-8","article-title":"Non-backtracking PageRank","volume":"80","author":"Arrigo","year":"2019","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.amc.2026.130182_bib0007","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.chaos.2019.06.017","article-title":"Non-backtracking PageRank: from the classic model to Hashimoto matrices","volume":"126","author":"Aleja","year":"2019","journal-title":"Chaos Solit. Fractals"},{"key":"10.1016\/j.amc.2026.130182_bib0008","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cam.2018.09.048","article-title":"On the \u03b1-nonbacktracking centrality for complex networks: existence and limit cases","volume":"350","author":"Criado","year":"2019","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.amc.2026.130182_bib0009","series-title":"Proc. FOCS","first-page":"475","article-title":"Local graph partitioning using PageRank vectors","author":"Andersen","year":"2006"},{"key":"10.1016\/j.amc.2026.130182_bib0010","series-title":"Proc. WAW","first-page":"86","article-title":"Finding and visualizing graph clusters using PageRank optimization","author":"Graham","year":"2010"},{"key":"10.1016\/j.amc.2026.130182_bib0011","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.neucom.2015.10.020","article-title":"K-PRSCAN: a clustering method based on PageRank","volume":"175","author":"Liu","year":"2016","journal-title":"Neurocomputing"},{"key":"10.1016\/j.amc.2026.130182_bib0012","series-title":"Proc. ICOIN","first-page":"232","article-title":"Random walk on a graph with vicinity avoidance","author":"Kitaura","year":"2022"},{"issue":"2","key":"10.1016\/j.amc.2026.130182_bib0013","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/20M1352132","article-title":"Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization","volume":"3","author":"Torres","year":"2021","journal-title":"SIAM J. Math. Data Sci."},{"issue":"4","key":"10.1016\/j.amc.2026.130182_bib0014","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1142\/S0219199707002551","article-title":"Non-backtracking random walks mix faster","volume":"9","author":"Alon","year":"2007","journal-title":"Commun. Contemp. Math."},{"issue":"4","key":"10.1016\/j.amc.2026.130182_bib0015","doi-asserted-by":"crossref","first-page":"207","DOI":"10.4236\/ojdm.2016.64018","article-title":"Non-backtracking random walks and a weighted Ihara\u2019s theorem","volume":"6","author":"Kempton","year":"2016","journal-title":"Open J. Discrete Math."},{"key":"10.1016\/j.amc.2026.130182_bib0016","series-title":"Proc. Allerton Conf.","first-page":"765","article-title":"Balanced allocation on graphs with random walk-based sampling","author":"Tang","year":"2018"},{"key":"10.1016\/j.amc.2026.130182_bib0017","series-title":"Proc. IEEE DSC","first-page":"260","article-title":"Influence maximization in social networks based on non-backtracking random walk","author":"Pan","year":"2016"},{"key":"10.1016\/j.amc.2026.130182_bib0018","series-title":"Proc. BigComp","first-page":"114","article-title":"Estimating the clustering coefficient of a social network by a non-backtracking random walk","author":"Iwasaki","year":"2018"},{"issue":"5939","key":"10.1016\/j.amc.2026.130182_bib0019","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1126\/science.1173299","article-title":"Scale-free networks: a decade and beyond","volume":"325","author":"Barab\u00e1si","year":"2009","journal-title":"Science"},{"issue":"5","key":"10.1016\/j.amc.2026.130182_bib0020","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1038\/scientificamerican0503-60","article-title":"Scale-free networks","volume":"288","author":"Barab\u00e1si","year":"2003","journal-title":"Sci. Am."},{"issue":"2","key":"10.1016\/j.amc.2026.130182_bib0021","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/15427951.2006.10129120","article-title":"PageRank of scale-free growing networks","volume":"3","author":"Avrachenkov","year":"2006","journal-title":"Internet Math."},{"issue":"1","key":"10.1016\/j.amc.2026.130182_bib0022","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1214\/19-AAP1494","article-title":"Local weak convergence for PageRank","volume":"30","author":"Garavaglia","year":"2020","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"10.1016\/j.amc.2026.130182_bib0023","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevResearch.1.033034","article-title":"Scale-free networks well done","volume":"1","author":"Voitalov","year":"2019","journal-title":"Phys. Rev. Res."},{"key":"10.1016\/j.amc.2026.130182_bib0024","article-title":"The netzschleuder network catalogue and repository","author":"Peixoto","year":"2020","journal-title":"Zenodo"},{"key":"10.1016\/j.amc.2026.130182_bib0025","doi-asserted-by":"crossref","unstructured":"A.N. Langville, C.D. Meyer, Google\u2019s PageRank and beyond: the science of search engine rankings, Princeton University Press, (2011).","DOI":"10.2307\/j.ctt7t8z9"},{"key":"10.1016\/j.amc.2026.130182_bib0026","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1987","key":"10.1016\/j.amc.2026.130182_bib0027","doi-asserted-by":"crossref","DOI":"10.1098\/rsta.2012.0375","article-title":"Network science","volume":"371","author":"Barab\u00e1si","year":"2013","journal-title":"Philos. Trans. R. Soc. A"},{"issue":"290\u2013297","key":"10.1016\/j.amc.2026.130182_bib0028","first-page":"18","article-title":"On random graphs I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/j.amc.2026.130182_bib0029","series-title":"Random Geometric Graphs","volume":"Vol. 5","author":"Penrose","year":"2003"},{"issue":"1","key":"10.1016\/j.amc.2026.130182_bib0030","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.83.016107","article-title":"Stochastic blockmodels and community structure in networks","volume":"83","author":"Karrer","year":"2011","journal-title":"Phys. Rev. E-Stat. Nonlinear Soft Matter Phys."},{"issue":"5439","key":"10.1016\/j.amc.2026.130182_bib0031","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"issue":"7417","key":"10.1016\/j.amc.2026.130182_bib0032","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1038\/nature11459","article-title":"Popularity versus similarity in growing networks","volume":"489","author":"Papadopoulos","year":"2012","journal-title":"Nature"},{"issue":"4","key":"10.1016\/j.amc.2026.130182_bib0033","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1037\/h0045013","article-title":"Concerning Kendall\u2019s tau, a nonparametric correlation coefficient","volume":"53","author":"Schaeffer","year":"1956","journal-title":"Psychol. Bull."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:23:14Z","timestamp":1781194994000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326002341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":33,"alternative-id":["S0096300326002341"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130182","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Effects of backtracking on PageRank","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130182","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"130182"}}