{"id":"https://openalex.org/W4417529635","doi":"https://doi.org/10.48550/arxiv.2512.16087","title":"Instance-Optimality in PageRank Computation","display_name":"Instance-Optimality in PageRank Computation","publication_year":2025,"publication_date":"2025-12-18","ids":{"openalex":"https://openalex.org/W4417529635","doi":"https://doi.org/10.48550/arxiv.2512.16087"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2512.16087","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.16087","pdf_url":"https://arxiv.org/pdf/2512.16087","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.16087","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thorup, Mikkel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101787393","display_name":"Hanzhi Wang","orcid":"https://orcid.org/0000-0002-0995-5546"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Hanzhi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.47749999165534973,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.47749999165534973,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.24210000038146973,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.07240000367164612,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.7314000129699707},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.70169997215271},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6836000084877014},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6169000267982483},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.460999995470047},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45750001072883606},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4449999928474426},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3959999978542328}],"concepts":[{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.7314000129699707},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.70169997215271},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6836000084877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6416000127792358},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6169000267982483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5777000188827515},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45750001072883606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45100000500679016},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39329999685287476},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.36809998750686646},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.30799999833106995},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3019999861717224},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C53105687","wikidata":"https://www.wikidata.org/wiki/Q173227","display_name":"Physical constant","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2512.16087","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.16087","pdf_url":"https://arxiv.org/pdf/2512.16087","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:arXiv.org:2512.16087","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2512.16087","pdf_url":"https://arxiv.org/pdf/2512.16087","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.16087","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.16087","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.16087","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.16087","pdf_url":"https://arxiv.org/pdf/2512.16087","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,17,81,132,139],"study":[1],"the":[2,24,84,117,142,158],"problem":[3],"of":[4,23,40,54,96],"estimating":[5],"a":[6,10,33,51,78,93,113],"vertex's":[7],"PageRank":[8],"within":[9],"constant":[11,15,52],"relative":[12],"error,":[13],"with":[14,106],"probability.":[16],"prove":[18],"that":[19,64,116,141],"an":[20],"adaptive":[21],"variant":[22],"simple":[25,153,164],"classic":[26],"bidirectional":[27,118,143],"algorithm":[28,63,70,119,144],"is":[29,60,120,145],"instance-optimal":[30,122,146],"up":[31],"to":[32,86,130],"polylogarithmic":[34,79,94],"factor":[35],"for":[36,123,151,162],"all":[37,87,103],"directed":[38],"graphs":[39,88,105,124,136],"order":[41],"$n$":[42],"whose":[43,125],"maximum":[44],"in-":[45],"and":[46,137],"out-degrees":[47],"are":[48,127],"at":[49,91],"most":[50,92],"fraction":[53],"$n$.":[55,131],"In":[56,109],"other":[57],"words,":[58],"there":[59],"no":[61],"correct":[62],"can":[65],"be":[66],"faster":[67],"than":[68,77],"our":[69],"on":[71,147],"any":[72],"such":[73],"graph":[74],"by":[75],"more":[76],"factor.":[80],"further":[82],"extend":[83],"instance-optimality":[85],"in":[89],"which":[90],"number":[95],"vertices":[97],"have":[98,156],"unbounded":[99],"degrees.":[100],"This":[101],"covers":[102],"sparse":[104],"$\\tilde{O}(n)$":[107],"edges.":[108],"addition,":[110],"we":[111,155],"provide":[112],"counterexample":[114],"showing":[115],"not":[121],"degrees":[126],"mostly":[128],"equal":[129],"also":[133],"consider":[134],"weighted":[135,152],"multigraphs.":[138],"show":[140],"\\emph{all}":[148],"multigraphs,":[149],"but":[150],"graphs,":[154],"almost":[157],"same":[159],"limitations":[160],"as":[161],"unweighted":[163],"graphs.":[165]},"counts_by_year":[],"updated_date":"2026-05-09T06:09:20.037420","created_date":"2025-12-21T00:00:00"}