{"id":"https://openalex.org/W7164937809","doi":"https://doi.org/10.48550/arxiv.2606.14995","title":"Optimality of Random Regular Graphs in Sparse Network Designs","display_name":"Optimality of Random Regular Graphs in Sparse Network Designs","publication_year":2026,"publication_date":"2026-06-12","ids":{"openalex":"https://openalex.org/W7164937809","doi":"https://doi.org/10.48550/arxiv.2606.14995"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.14995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14995","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":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.14995","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128756214","display_name":"Weijia Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Weijia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128793288","display_name":"Xiaochun Niu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niu, Xiaochun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138713139","display_name":"Yehua Wei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei, Yehua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138730944","display_name":"Jiaming Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Jiaming","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.19840000569820404,"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.19840000569820404,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.19439999759197235,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.17499999701976776,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7870000004768372},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46880000829696655},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4544999897480011},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4357999861240387},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4284999966621399},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4189000129699707},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4043000042438507},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.39149999618530273},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.3801000118255615}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7870000004768372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4945000112056732},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4544999897480011},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4357999861240387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43130001425743103},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41909998655319214},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4043000042438507},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.39149999618530273},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3799000084400177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37130001187324524},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3610999882221222},{"id":"https://openalex.org/C87414783","wikidata":"https://www.wikidata.org/wiki/Q1002603","display_name":"Degree distribution","level":3,"score":0.35519999265670776},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.33980000019073486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.28859999775886536},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C2911174283","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph Layout","level":4,"score":0.28040000796318054},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.26019999384880066},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.14995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14995","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.14995","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.14995","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":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":{"The":[0,101],"problems":[1],"of":[2,53,93,103,150],"designing":[3],"sparse":[4,19,61,104,196],"networks":[5,105,122],"arise":[6],"frequently":[7],"in":[8,177],"resource":[9],"allocation":[10],"and":[11,41,120,180],"operations":[12],"research.":[13],"In":[14,58,162],"production":[15],"systems,":[16],"for":[17,117,195],"example,":[18],"process":[20],"flexibility":[21,197],"designs":[22,116,133,199],"are":[23],"used":[24],"to":[25,33,51,80,91,153],"handle":[26],"uncertain":[27],"demand":[28,42,49],"effectively:":[29],"the":[30,35,77,82,94,136,142,147,168],"goal":[31,78],"is":[32,79],"construct":[34],"sparsest":[36,83],"bipartite":[37,119,179],"graph":[38,84,97,152,171],"between":[39],"supply":[40],"that":[43,52,64,92,134,167,200],"still":[44],"achieves":[45,172],"an":[46],"expected":[47],"fulfilled":[48],"comparable":[50,90],"a":[54,155,192],"fully":[55,95],"flexible":[56],"system.":[57],"middle-mile":[59],"transportation,":[60],"delivery-route":[62],"subgraphs":[63],"sustain":[65],"large":[66],"matchings":[67],"after":[68],"random":[69,169],"node":[70,99],"deletions":[71],"help":[72],"reduce":[73],"delivery":[74],"costs;":[75],"here,":[76],"design":[81,102],"whose":[85],"maximum":[86],"matching":[87],"size":[88],"remains":[89],"connected":[96],"under":[98,212],"deletions.":[100],"has":[106,159],"been":[107],"studied":[108],"extensively,":[109],"with":[110,204],"state-of-the-art":[111],"results":[112,190],"providing":[113],"order-wise":[114],"optimal":[115,175,210],"both":[118,178],"unipartite":[121,181],"(Chen":[123],"et":[124,128],"al.,":[125,129],"2015;":[126],"Feng":[127],"2024).":[130],"However,":[131],"identifying":[132],"achieve":[135,154,209],"sharp":[137,174],"theoretical":[138],"limit":[139],"--":[140],"where":[141],"average":[143],"degree":[144,202],"asymptotically":[145],"matches":[146],"lower":[148],"bound":[149],"any":[151],"given":[156],"loss":[157],"level,":[158],"remained":[160],"open.":[161],"this":[163,173,187],"paper,":[164],"we":[165],"prove":[166],"regular":[170],"condition":[176],"settings.":[182],"Numerical":[183],"experiments":[184],"further":[185],"validate":[186],"optimality.":[188],"Our":[189],"highlight":[191],"practical":[193],"guideline":[194],"networks:":[198],"combine":[201],"regularity":[203],"low":[205],"edge":[206],"correlations":[207],"can":[208],"performance":[211],"uncertainty.":[213]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-17T00:00:00"}