{"id":"https://openalex.org/W7130567044","doi":"https://doi.org/10.48550/arxiv.2602.16222","title":"Near-optimal population protocols on bounded-degree trees","display_name":"Near-optimal population protocols on bounded-degree trees","publication_year":2026,"publication_date":"2026-02-18","ids":{"openalex":"https://openalex.org/W7130567044","doi":"https://doi.org/10.48550/arxiv.2602.16222"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.16222","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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/A5091604054","display_name":"Joel Rybicki","orcid":"https://orcid.org/0000-0002-6432-6646"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rybicki, Joel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122185609","display_name":"Jakob Solnerzik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Solnerzik, Jakob","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039607367","display_name":"Robin Vacus","orcid":"https://orcid.org/0000-0002-7368-4912"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vacus, Robin","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9362999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9362999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.023900000378489494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/population","display_name":"Population","score":0.5767999887466431},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5534999966621399},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5521000027656555},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5253999829292297},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4675000011920929},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4546000063419342}],"concepts":[{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5767999887466431},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5534999966621399},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5521000027656555},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5253999829292297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4772999882698059},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4505000114440918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.382099986076355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3479999899864197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.3125},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2563999891281128}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.16222","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.16222","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16222","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":"pmh:doi:10.48550/arxiv.2602.16222","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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],"investigate":[1],"space-time":[2,16,39,76],"trade-offs":[3,17,77],"for":[4,20,78,134,177],"population":[5,66],"protocols":[6,67,90,100,175],"in":[7,62,161,199],"sparse":[8],"interaction":[9,13,136],"graphs.":[10,53],"In":[11,54],"complete":[12,63],"graphs,":[14,137],"optimal":[15,162],"are":[18,111,120],"known":[19],"the":[21,107],"leader":[22,79,182],"election":[23,80,183],"and":[24,81,184],"exact":[25,82,185,197],"majority":[26,186,198],"problems.":[27],"However,":[28],"it":[29],"has":[30],"remained":[31],"open":[32],"if":[33],"other":[34],"graph":[35],"families":[36],"exhibit":[37,73],"similar":[38],"complexity":[40],"trade-offs,":[41],"as":[42],"existing":[43],"lower":[44],"bound":[45,142],"techniques":[46],"do":[47,71],"not":[48,72],"extend":[49],"beyond":[50],"highly":[51],"dense":[52],"this":[55],"work,":[56],"we":[57,87,118,125,141,149,170,190],"show":[58,191],"that":[59,91,156,192],"--":[60,65],"unlike":[61],"graphs":[64],"on":[68,113,164,204],"bounded-degree":[69],"trees":[70,179],"significant":[74],"asymptotic":[75],"majority.":[83],"For":[84,188],"these":[85],"problems,":[86],"give":[88,126,150],"constant-space":[89],"have":[92],"near-optimal":[93],"worst-case":[94],"expected":[95],"stabilisation":[96,139],"time.":[97],"These":[98],"new":[99,128],"achieve":[101],"a":[102,127,144,151,158,168],"linear":[103],"speed-up":[104],"compared":[105],"to":[106,180],"state-of-the-art.":[108],"Our":[109],"results":[110],"based":[112],"two":[114],"novel":[115],"protocols,":[116],"which":[117],"believe":[119],"of":[121],"independent":[122],"interest.":[123],"First,":[124],"fast":[129],"self-stabilising":[130,152],"2-hop":[131],"colouring":[132],"protocol":[133],"general":[135],"whose":[138],"time":[140,163],"using":[143],"stochastic":[145],"drift":[146],"argument.":[147],"Second,":[148],"tree":[153,160],"orientation":[154],"algorithm":[155],"builds":[157],"rooted":[159],"any":[165],"tree.":[166],"As":[167],"consequence,":[169],"can":[171],"use":[172],"simple":[173],"constant-state":[174],"designed":[176],"directed":[178,205],"solve":[181,196],"fast.":[187],"example,":[189],"``directed''":[193],"annihilation":[194],"dynamics":[195],"$O(n^2":[200],"\\log":[201],"n)$":[202],"steps":[203],"trees.":[206]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-20T00:00:00"}