{"id":"https://openalex.org/W7154983853","doi":"https://doi.org/10.48550/arxiv.2604.16069","title":"Convergence Time Distributions for Max-Consensus over Unreliable Networks","display_name":"Convergence Time Distributions for Max-Consensus over Unreliable Networks","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7154983853","doi":"https://doi.org/10.48550/arxiv.2604.16069"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16069","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.2604.16069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119232306","display_name":"Katharina Stich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stich, Katharina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099984505","display_name":"Bastian Perner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Perner, Bastian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035971695","display_name":"Friedemann Laue","orcid":"https://orcid.org/0000-0002-7477-8312"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laue, Friedemann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045413798","display_name":"Torsten Rei\u00dfland","orcid":"https://orcid.org/0000-0002-2263-3875"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reissland, Torsten","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036049022","display_name":"Norman Franchi","orcid":"https://orcid.org/0000-0002-2777-4722"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franchi, Norman","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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9053999781608582,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9053999781608582,"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.03310000151395798,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.009999999776482582,"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/convergence","display_name":"Convergence (economics)","score":0.7505000233650208},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6384000182151794},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.529699981212616},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4993000030517578},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4975999891757965},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48989999294281006},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.4797999858856201},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4788999855518341},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4075999855995178}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7505000233650208},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6384000182151794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5529999732971191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5494999885559082},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.529699981212616},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4993000030517578},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4975999891757965},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48989999294281006},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.4797999858856201},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4788999855518341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4341000020503998},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4032000005245209},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3467000126838684},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.33550000190734863},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.30809998512268066},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.296999990940094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.29249998927116394},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2881999909877777},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2596000134944916}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16069","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.2604.16069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16069","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"the":[3,11,35,42,47,78,83,108],"LiFE-CD":[4,39,93],"algorithm":[5,13,80],"for":[6,97,101,121,126],"convergence":[7,37,48,109],"time":[8,49,110],"analysis":[9,137],"of":[10,46],"max-consensus":[12],"in":[14],"multi-agent":[15],"systems":[16],"under":[17],"Bernoulli-distributed":[18],"link":[19,55,76],"failures.":[20],"Unlike":[21],"existing":[22,133],"approaches,":[23],"which":[24],"either":[25],"assume":[26],"ideal":[27],"communication":[28],"or":[29],"provide":[30],"asymptotic":[31],"upper":[32,105],"bounds":[33,106],"on":[34,73,107],"expected":[36],"time,":[38],"deterministically":[40],"computes":[41],"full":[43,61],"probability":[44,62],"distribution":[45,63],"from":[50],"network":[51,85],"topology":[52,86],"and":[53,90,129,151],"individual":[54],"failure":[56],"probabilities,":[57],"without":[58],"simulation.":[59],"The":[60],"enables":[64],"deadline-aware":[65],"protocol":[66],"design":[67],"with":[68],"specified":[69],"reliability":[70],"guarantees.":[71],"Based":[72],"geometrically":[74],"distributed":[75],"delays,":[77],"proposed":[79],"iteratively":[81],"reduces":[82],"given":[84],"considering":[87],"both":[88],"unicast":[89],"broadcast":[91],"transmissions.":[92],"yields":[94],"exact":[95],"results":[96,117,155],"acyclic":[98,122],"networks":[99],"and,":[100],"cyclic":[102,127],"networks,":[103,123,128],"tight":[104],"via":[111],"shortest-path":[112],"spanning":[113],"tree":[114],"construction.":[115],"Numerical":[116],"confirm":[118],"analytical":[119],"exactness":[120],"validate":[124],"tightness":[125],"demonstrate":[130],"improvement":[131],"over":[132],"approaches.":[134],"Our":[135],"complexity":[136],"shows":[138],"reduced":[139],"computational":[140],"cost":[141],"compared":[142],"to":[143,158],"Monte":[144],"Carlo":[145],"simulations,":[146],"while":[147],"eliminating":[148],"stochastic":[149],"variability":[150],"enhancing":[152],"reproducibility.":[153],"All":[154],"extend":[156],"directly":[157],"min-consensus":[159],"by":[160],"structural":[161],"equivalence.":[162]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-21T00:00:00"}