{"id":"https://openalex.org/W7128708552","doi":"https://doi.org/10.48550/arxiv.2602.10843","title":"Personalized PageRank Estimation in Undirected Graphs","display_name":"Personalized PageRank Estimation in Undirected Graphs","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128708552","doi":"https://doi.org/10.48550/arxiv.2602.10843"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.10843","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005918207","display_name":"Christian Bertram","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bertram, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5120023174","display_name":"Mads Vestergaard Jensen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jensen, Mads Vestergaard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3061999976634979,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3061999976634979,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.26350000500679016,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.09989999979734421,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.760699987411499},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5806999802589417},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.5763000249862671},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5625},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5570999979972839},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46239998936653137},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44859999418258667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4341000020503998}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.760699987411499},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5806999802589417},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.5763000249862671},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5625},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5570999979972839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5490000247955322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5231000185012817},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46239998936653137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46070000529289246},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44859999418258667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4341000020503998},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4049000144004822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39160001277923584},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.3424000144004822},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3034999966621399},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2854999899864197},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.27000001072883606}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.10843","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.10843","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10843","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.10843","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"an":[1,24],"undirected":[2,90,151,157,171],"graph":[3],"$G=(V,":[4],"E)$,":[5],"the":[6,21,36,67,79,108,154,170],"Personalized":[7],"PageRank":[8],"(PPR)":[9],"of":[10,39,78,86],"$t\\in":[11],"V$":[12],"with":[13,42],"respect":[14],"to":[15,97,150],"$s\\in":[16],"V$,":[17],"denoted":[18],"$\u03c0(s,t)$,":[19],"is":[20,52],"probability":[22],"that":[23,162,177],"$\u03b1$-discounted":[25],"random":[26],"walk":[27],"starting":[28],"at":[29,32],"$s$":[30],"terminates":[31],"$t$.":[33],"We":[34,59,81],"study":[35,66],"time":[37],"complexity":[38],"estimating":[40],"$\u03c0(s,t)$":[41,51],"constant":[43,47],"relative":[44],"error":[45],"and":[46,64,72,103,110,118,131,144],"failure":[48],"probability,":[49],"whenever":[50],"above":[53],"a":[54,83],"given":[55],"threshold":[56],"parameter":[57],"$\u03b4\\in(0,1)$.":[58],"consider":[60],"common":[61],"graph-access":[62],"models":[63],"furthermore":[65],"single":[68,70,73],"source,":[69],"target,":[71],"node":[74],"(PageRank":[75],"centrality)":[76],"variants":[77,105],"problem.":[80],"provide":[82],"complete":[84],"characterization":[85],"PPR":[87],"estimation":[88],"in":[89,106],"graphs":[91,158],"by":[92,126,173],"giving":[93],"tight":[94,182],"bounds":[95,122],"(up":[96],"logarithmic":[98],"factors)":[99],"for":[100,133],"all":[101],"problems":[102],"model":[104],"both":[107,115,179],"worst-case":[109],"average-case":[111],"setting.":[112],"This":[113],"includes":[114],"new":[116,175],"upper":[117],"lower":[119,138],"bounds.":[120,183],"Tight":[121],"were":[123],"recently":[124],"obtained":[125],"Bertram,":[127],"Jensen,":[128],"Thorup,":[129],"Wang,":[130],"Yan":[132],"directed":[134],"graphs.":[135,152],"However,":[136],"their":[137],"bound":[139],"constructions":[140],"rely":[141],"on":[142],"asymmetry":[143],"therefore":[145],"do":[146],"not":[147],"carry":[148],"over":[149],"At":[153],"same":[155],"time,":[156],"exhibit":[159],"additional":[160],"structure":[161],"can":[163],"be":[164],"exploited":[165],"algorithmically.":[166],"Our":[167],"results":[168],"resolve":[169],"case":[172],"developing":[174],"techniques":[176],"capture":[178],"aspects,":[180],"yielding":[181]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-13T00:00:00"}