{"id":"https://openalex.org/W7167075948","doi":"https://doi.org/10.4230/lipics.wg.2026.12","title":"Geometric Routing in Geometric Inhomogeneous Random Graphs","display_name":"Geometric Routing in Geometric Inhomogeneous Random Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7167075948","doi":"https://doi.org/10.4230/lipics.wg.2026.12"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.wg.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.12","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.4230/lipics.wg.2026.12","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139904612","display_name":"Yu-Cheng Chiu","orcid":"https://orcid.org/0009-0002-9640-8221"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Chiu, Yu-Cheng","raw_affiliation_strings":["Department of Mathematics, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0002-9640-8221","affiliations":[{"raw_affiliation_string":"Department of Mathematics, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014595268","display_name":"Marc Kaufmann","orcid":"https://orcid.org/0000-0001-8489-2058"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Kaufmann, Marc","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-8489-2058","affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064676726","display_name":"Konstantinos Lakis","orcid":"https://orcid.org/0009-0004-5595-1839"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Lakis, Kostas","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0004-5595-1839","affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039041208","display_name":"Ulysse Schaller","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Schaller, Ulysse","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0002-1416-1086","affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35440088"],"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5794000029563904},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5185999870300293},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4749000072479248},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45660001039505005},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.43560001254081726},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4250999987125397},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.40549999475479126},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.3402000069618225}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6407999992370605},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5794000029563904},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5185999870300293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.498199999332428},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4749000072479248},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4129999876022339},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.3402000069618225},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3262999951839447},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C7305733","wikidata":"https://www.wikidata.org/wiki/Q207961","display_name":"Geometric shape","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C136520226","wikidata":"https://www.wikidata.org/wiki/Q302814","display_name":"Geometric data analysis","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27889999747276306},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.2621000111103058},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.wg.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.12","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.wg.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wg.2026.12","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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,63,75],"present":[1],"the":[2,20,33,66,108,135,143,150,153,159,162],"first":[3],"rigorous":[4],"analysis":[5,116],"of":[6,19,41,50,102,130],"decentralized":[7],"geometric":[8,86,92],"routing":[9,22,26,93],"in":[10,27,149],"Geometric":[11],"Inhomogeneous":[12],"Random":[13],"Graphs":[14],"(GIRGs),":[15],"a":[16,125,131],"weight-agnostic":[17],"variant":[18],"greedy":[21,25,113],"protocol.":[23],"While":[24],"GIRGs":[28],"is":[29,58,70],"known":[30],"to":[31,134,142,161],"explain":[32],"algorithmic":[34],"small-world":[35],"phenomenon":[36],"by":[37,139],"finding":[38],"ultra-short":[39,100],"paths":[40,101],"length":[42,103],"\u0398(log":[43,104],"log":[44,105],"n),":[45,106],"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,155],"alone":[69,156],"sufficient":[71],"for":[72,78,112],"efficient":[73,140],"navigation.":[74],"prove":[76],"power-law":[79],"weight":[80],"exponent":[81],"\u03c4":[82],"\u2208":[83],"(2,3)":[84],"and":[85,98],"decay":[87],"parameter":[88],"\u03b1":[89],">":[90],"\u03c4-1,":[91],"succeeds":[94],"with":[95],"constant":[96],"probability":[97],"finds":[99],"matching":[107],"optimal":[109],"asymptotic":[110],"guarantees":[111],"routing.":[114],"Our":[115],"further":[117],"reveals":[118],"that,":[119,148],"upon":[120],"success,":[121],"both":[122],"protocols":[123],"follow":[124],"similar":[126],"two-phase":[127],"trajectory,":[128],"consisting":[129],"rapid":[132],"ascent":[133],"heavy":[136],"vertices,":[137],"followed":[138],"navigation":[141],"target.":[144],"These":[145],"results":[146],"demonstrate":[147],"appropriate":[151],"regime,":[152],"network\u2019s":[154],"implicitly":[157],"guides":[158],"path":[160],"target":[163],"through":[164],"its":[165],"high-weight":[166],"core.":[167]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}