{"id":"https://openalex.org/W4366830462","doi":"https://doi.org/10.1145/3593426","title":"Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks","display_name":"Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks","publication_year":2023,"publication_date":"2023-04-24","ids":{"openalex":"https://openalex.org/W4366830462","doi":"https://doi.org/10.1145/3593426"},"language":"en","primary_location":{"id":"doi:10.1145/3593426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3593426","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082097899","display_name":"Aleksandar Kamenev","orcid":"https://orcid.org/0009-0000-7125-628X"},"institutions":[{"id":"https://openalex.org/I126863827","display_name":"Pace University","ror":"https://ror.org/047p7y759","country_code":"US","type":"education","lineage":["https://openalex.org/I126863827"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aleksandar Kamenev","raw_affiliation_strings":["Pace University, USA"],"raw_orcid":"https://orcid.org/0009-0000-7125-628X","affiliations":[{"raw_affiliation_string":"Pace University, USA","institution_ids":["https://openalex.org/I126863827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101948468","display_name":"Dariusz R. Kowalski","orcid":"https://orcid.org/0000-0002-1316-7788"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dariusz R. Kowalski","raw_affiliation_strings":["Augusta University, USA"],"raw_orcid":"https://orcid.org/0000-0002-1316-7788","affiliations":[{"raw_affiliation_string":"Augusta University, USA","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057244061","display_name":"Miguel A. Mosteiro","orcid":"https://orcid.org/0000-0001-5842-6256"},"institutions":[{"id":"https://openalex.org/I126863827","display_name":"Pace University","ror":"https://ror.org/047p7y759","country_code":"US","type":"education","lineage":["https://openalex.org/I126863827"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Miguel A. Mosteiro","raw_affiliation_strings":["Pace University, USA"],"raw_orcid":"https://orcid.org/0000-0001-5842-6256","affiliations":[{"raw_affiliation_string":"Pace University, USA","institution_ids":["https://openalex.org/I126863827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0435356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"2","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9984999895095825,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9984999895095825,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9962999820709229,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9944999814033508,"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/isoperimetric-inequality","display_name":"Isoperimetric inequality","score":0.8381813764572144},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.7384663224220276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.663123369216919},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4905783236026764},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4861864447593689},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46028605103492737},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42037418484687805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34537065029144287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3336185812950134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26060202717781067},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1566465198993683},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12994486093521118}],"concepts":[{"id":"https://openalex.org/C140142295","wikidata":"https://www.wikidata.org/wiki/Q617417","display_name":"Isoperimetric inequality","level":2,"score":0.8381813764572144},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.7384663224220276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.663123369216919},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4905783236026764},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4861864447593689},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46028605103492737},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42037418484687805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34537065029144287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3336185812950134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26060202717781067},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1566465198993683},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12994486093521118},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3593426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3593426","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G827378952","display_name":"SaTC: CORE: Small: A Robust Framework with Rigorous Semantics and Security Guarantees for Election-Day Voter Check-in","funder_award_id":"2131538","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1514589001","https://openalex.org/W1547358136","https://openalex.org/W1847535063","https://openalex.org/W1857402595","https://openalex.org/W1909387666","https://openalex.org/W1915300733","https://openalex.org/W1967764814","https://openalex.org/W1984661256","https://openalex.org/W1984768569","https://openalex.org/W1987242262","https://openalex.org/W1998692792","https://openalex.org/W2008620264","https://openalex.org/W2018047324","https://openalex.org/W2018934112","https://openalex.org/W2025284419","https://openalex.org/W2027199101","https://openalex.org/W2048958388","https://openalex.org/W2060084491","https://openalex.org/W2071695388","https://openalex.org/W2072211488","https://openalex.org/W2075984423","https://openalex.org/W2077862183","https://openalex.org/W2078381259","https://openalex.org/W2096628490","https://openalex.org/W2099257800","https://openalex.org/W2107396783","https://openalex.org/W2112090702","https://openalex.org/W2112753256","https://openalex.org/W2117905067","https://openalex.org/W2121489504","https://openalex.org/W2133901807","https://openalex.org/W2154834860","https://openalex.org/W2165744313","https://openalex.org/W2257404669","https://openalex.org/W2299671642","https://openalex.org/W2474953005","https://openalex.org/W2492815501","https://openalex.org/W2558481965","https://openalex.org/W2911725012","https://openalex.org/W2913507641","https://openalex.org/W2965405610","https://openalex.org/W3021008771","https://openalex.org/W3021721201","https://openalex.org/W3035864434","https://openalex.org/W3105297005","https://openalex.org/W3106753174","https://openalex.org/W3159566766","https://openalex.org/W3176978995","https://openalex.org/W3203243791","https://openalex.org/W4241610738","https://openalex.org/W4246684182","https://openalex.org/W4251986490","https://openalex.org/W4252973173","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W2393012656","https://openalex.org/W4293733602","https://openalex.org/W4387415199","https://openalex.org/W2587882711","https://openalex.org/W2799900090","https://openalex.org/W4297475888","https://openalex.org/W2042006853","https://openalex.org/W4299574858","https://openalex.org/W2047527454","https://openalex.org/W2037470587"],"abstract_inverted_index":{"How":[0],"do":[1],"we":[2,19,47,96,113,122],"reach":[3],"consensus":[4,26,56,108],"on":[5,98],"an":[6,77,162],"average":[7,24,60,82,106],"value":[8],"in":[9,27,70,150],"a":[10,103],"dynamic":[11,134,221,249],"crowd":[12],"without":[13],"revealing":[14],"identity?":[15],"In":[16],"this":[17],"work,":[18],"study":[20],"the":[21,37,49,53,59,71,81,86,90,99,155,159,167,199],"problem":[22],"of":[23,39,52,61,158,248],"network":[25,87,107,160],"Anonymous":[28,118],"Dynamic":[29],"Networks":[30],"(ADN).":[31],"Network":[32],"dynamicity":[33,51,157],"is":[34,58,68],"specified":[35],"by":[36,65],"sequence":[38],"topology-graph":[40],"isoperimetric":[41,50,115,156,168,211],"numbers":[42],"occurring":[43],"over":[44],"time,":[45],"which":[46,67,141],"call":[48,114],"network.":[54],"The":[55,152],"variable":[57],"values":[62],"initially":[63],"held":[64],"nodes,":[66,140],"customary":[69],"network-consensus":[72],"literature.":[73],"Given":[74],"that":[75,112,165,236],"having":[76],"algorithm":[78,109,153],"to":[79,145,202],"compute":[80,85],"one":[83],"can":[84],"size":[88],"(i.e.,":[89],"counting":[91],"problem)":[92],"and":[93,121,132,231],"vice":[94],"versa,":[95],"focus":[97],"latter.":[100],"We":[101],"present":[102],"deterministic":[104],"distributed":[105],"for":[110,126,148,195,218,228,245],"ADNs":[111,197,208],"Scalable":[116],"Coordinated":[117],"Local":[119],"Aggregation,":[120],"analyze":[123],"its":[124],"performance":[125,217],"different":[127],"scenarios,":[128],"including":[129],"worst-case":[130,205],"(adversarial)":[131],"stochastic":[133,229],"topologies.":[135],"Our":[136],"solution":[137],"utilizes":[138],"supervisor":[139],"have":[142],"been":[143],"shown":[144],"be":[146,176,242],"necessary":[147],"computations":[149],"ADNs.":[151],"uses":[154],"as":[161,185,187],"input,":[163],"meaning":[164],"only":[166],"number":[169],"parameters":[170],"(or":[171],"their":[172],"lower":[173],"bound)":[174],"must":[175],"given,":[177],"but":[178],"topologies":[179],"may":[180],"occur":[181],"arbitrarily":[182],"or":[183,226],"stochastically":[184],"long":[186],"they":[188],"comply":[189],"with":[190,204,209,223],"those":[191],"parameters.":[192],"Previous":[193],"work":[194],"adversarial":[196],"overestimates":[198],"running":[200],"time":[201,225],"deal":[203],"scenarios.":[206],"For":[207],"given":[210],"dynamicity,":[212],"our":[213,232,237],"analysis":[214],"shows":[215],"improved":[216,244],"some":[219,246],"practical":[220],"topologies,":[222],"cubic":[224],"better":[227],"ADNs,":[230],"experimental":[233],"evaluation":[234],"indicates":[235],"theoretical":[238],"bounds":[239],"could":[240],"not":[241],"substantially":[243],"models":[247],"networks.":[250]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}