{"id":"https://openalex.org/W7163429045","doi":"https://doi.org/10.48550/arxiv.2606.02856","title":"Geometric Routing in Geometric Inhomogeneous Random Graphs","display_name":"Geometric Routing in Geometric Inhomogeneous Random Graphs","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7163429045","doi":"https://doi.org/10.48550/arxiv.2606.02856"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.02856","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.02856","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137776425","display_name":"Yu-Cheng Chiu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chiu, Yu-Cheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137784370","display_name":"Marc Kaufmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaufmann, Marc","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137780200","display_name":"Kostas Lakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lakis, Kostas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039041208","display_name":"Ulysse Schaller","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schaller, Ulysse","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.4018000066280365,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.4018000066280365,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.13050000369548798,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08739999681711197,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.59170001745224},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.4925000071525574},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4790000021457672},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4494999945163727},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4345000088214874},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4129999876022339},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4000000059604645},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.3474999964237213}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6247000098228455},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.59170001745224},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4925000071525574},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4790000021457672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4641999900341034},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38659998774528503},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C7305733","wikidata":"https://www.wikidata.org/wiki/Q207961","display_name":"Geometric shape","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3264000117778778},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30300000309944153},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.2660999894142151},{"id":"https://openalex.org/C136520226","wikidata":"https://www.wikidata.org/wiki/Q302814","display_name":"Geometric data analysis","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.26179999113082886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2563000023365021},{"id":"https://openalex.org/C104065381","wikidata":"https://www.wikidata.org/wiki/Q1002535","display_name":"Geometric modeling","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.02856","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.02856","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"We":[0,63,75],"present":[1],"the":[2,20,33,66,107,134,142,149,152,158,161],"first":[3],"rigorous":[4],"analysis":[5,115],"of":[6,19,41,50,101,129],"decentralized":[7],"geometric":[8,85,91],"routing":[9,22,26,92],"in":[10,27,148],"Geometric":[11],"Inhomogeneous":[12],"Random":[13],"Graphs":[14],"(GIRGs),":[15],"a":[16,124,130],"weight-agnostic":[17],"variant":[18],"greedy":[21,25,112],"protocol.":[23],"While":[24],"GIRGs":[28],"is":[29,58,70],"known":[30],"to":[31,133,141,160],"explain":[32],"algorithmic":[34],"small-world":[35],"phenomenon":[36],"by":[37,138],"finding":[38],"ultra-short":[39,99],"paths":[40,100],"length":[42,102],"$\u0398(\\log":[43,103],"\\log":[44,104],"n)$,":[45,105],"it":[46],"assumes":[47],"additional":[48],"knowledge":[49],"vertex":[51],"weights":[52],"beyond":[53],"geometry,":[54],"an":[55],"assumption":[56],"that":[57,77],"often":[59],"restrictive":[60],"or":[61],"unavailable.":[62],"investigate":[64],"whether":[65],"underlying":[67],"geometry":[68,154],"alone":[69,155],"sufficient":[71],"for":[72,78,111],"efficient":[73,139],"navigation.":[74],"prove":[76],"power-law":[79],"weight":[80],"exponent":[81],"$\u03c4\\in":[82],"(2,3)$":[83],"and":[84,97],"decay":[86],"parameter":[87],"$\u03b1>":[88],"\u03c4-":[89],"1$,":[90],"succeeds":[93],"with":[94],"constant":[95],"probability":[96],"finds":[98],"matching":[106],"optimal":[108],"asymptotic":[109],"guarantees":[110],"routing.":[113],"Our":[114],"further":[116],"reveals":[117],"that,":[118,147],"upon":[119],"success,":[120],"both":[121],"protocols":[122],"follow":[123],"similar":[125],"two-phase":[126],"trajectory,":[127],"consisting":[128],"rapid":[131],"ascent":[132],"heavy":[135],"vertices,":[136],"followed":[137],"navigation":[140],"target.":[143],"These":[144],"results":[145],"demonstrate":[146],"appropriate":[150],"regime,":[151],"network's":[153],"implicitly":[156],"guides":[157],"path":[159],"target":[162],"through":[163],"its":[164],"high-weight":[165],"core.":[166]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-04T00:00:00"}