{"id":"https://openalex.org/W2915667782","doi":"https://doi.org/10.1017/s0963548320000310","title":"Robustness of randomized rumour spreading","display_name":"Robustness of randomized rumour spreading","publication_year":2020,"publication_date":"2020-08-12","ids":{"openalex":"https://openalex.org/W2915667782","doi":"https://doi.org/10.1017/s0963548320000310","mag":"2915667782"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000310","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000310","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/385AB29A7B1A2E44CC16EDE50718844F/S0963548320000310a.pdf/div-class-title-robustness-of-randomized-rumour-spreading-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/385AB29A7B1A2E44CC16EDE50718844F/S0963548320000310a.pdf/div-class-title-robustness-of-randomized-rumour-spreading-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rami Daknama","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rami Daknama","raw_affiliation_strings":["Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Konstantinos Panagiotou","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Konstantinos Panagiotou","raw_affiliation_strings":["Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":null,"display_name":"Simon Reisser","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Simon Reisser","raw_affiliation_strings":["Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, 80333Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":0.267,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49509538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"30","issue":"1","first_page":"37","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.6248000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.6248000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.10920000076293945,"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.10300000011920929,"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/robustness","display_name":"Robustness (evolution)","score":0.7702000141143799},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6916000247001648},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6187000274658203},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5092999935150146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5013999938964844},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.45820000767707825},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.3946000039577484},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3937000036239624}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7702000141143799},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6916000247001648},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5231000185012817},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5092999935150146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4650999903678894},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44690001010894775},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28619998693466187},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.27140000462532043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26840001344680786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.259799987077713},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.25699999928474426},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548320000310","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000310","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/385AB29A7B1A2E44CC16EDE50718844F/S0963548320000310a.pdf/div-class-title-robustness-of-randomized-rumour-spreading-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1902.07618","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.07618","pdf_url":"https://arxiv.org/pdf/1902.07618","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:epub.ub.uni-muenchen.de:97598","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bvb:19-epub-97598-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401845","display_name":"Open access LMU (Ludwid Maxmilian's Universitat Munchen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8204097","host_organization_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","host_organization_lineage":["https://openalex.org/I8204097"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics Probability & Computing","raw_type":"doc-type:article"},{"id":"doi:10.4230/lipics.esa.2019.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2019.36","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1017/s0963548320000310","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000310","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/385AB29A7B1A2E44CC16EDE50718844F/S0963548320000310a.pdf/div-class-title-robustness-of-randomized-rumour-spreading-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2915667782.pdf","grobid_xml":"https://content.openalex.org/works/W2915667782.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1569012753","https://openalex.org/W1571006103","https://openalex.org/W1910739950","https://openalex.org/W1970542229","https://openalex.org/W1971398013","https://openalex.org/W1992403724","https://openalex.org/W2016123342","https://openalex.org/W2018047324","https://openalex.org/W2019565283","https://openalex.org/W2036027002","https://openalex.org/W2047784567","https://openalex.org/W2051638203","https://openalex.org/W2052605628","https://openalex.org/W2059014957","https://openalex.org/W2068322213","https://openalex.org/W2117905067","https://openalex.org/W2157004711","https://openalex.org/W2243473225","https://openalex.org/W2289121796","https://openalex.org/W2797313639","https://openalex.org/W2885831468","https://openalex.org/W2949091638","https://openalex.org/W2953347513","https://openalex.org/W2962814541","https://openalex.org/W2964080237","https://openalex.org/W4248759188"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,79],"work":[3],"we":[4,77,112,162,212,225,238,273],"consider":[5],"three":[6,148],"well-studied":[7],"broadcast":[8,137],"protocols:":[9],"push":[10,168],",":[11],"pull":[12,153],"and":[13,93],"push&pull":[14,192],".":[15],"A":[16],"key":[17],"property":[18],"of":[19,55,73,89,104,118,181,220,229,246,249,270,276],"all":[20,159],"these":[21,74],"models,":[22],"which":[23,116],"is":[24,32,154,193,252],"also":[25],"an":[26,121,185],"important":[27],"reason":[28],"for":[29,217,241],"their":[30],"popularity,":[31],"that":[33,129,161,240,258],"they":[34,42],"are":[35,43,200],"presumed":[36],"to":[37,83,115,136,158,232,266],"be":[38,205],"very":[39],"robust,":[40],"since":[41],"simple,":[44],"randomized":[45,221],"and,":[46],"crucially,":[47],"do":[48],"not":[49],"utilize":[50],"explicitly":[51],"the":[52,56,71,90,101,119,130,138,147,165,175,179,182,209,218,227,235,244,247,271],"global":[53],"structure":[54],"underlying":[57,91],"graph.":[58],"While":[59],"sporadic":[60],"results":[61,260],"exist,":[62],"there":[63],"has":[64],"been":[65],"no":[66,196],"systematic":[67],"theoretical":[68],"treatment":[69],"quantifying":[70],"robustness":[72],"models.":[75,149],"Here":[76],"investigate":[78,113],"question":[80],"with":[81,109,156],"respect":[82,157],"two":[84,214],"orthogonal":[85],"aspects:":[86],"(adversarial)":[87],"modifications":[88,269],"graph":[92,243,272,282],"message":[94,197],"transmission":[95,198],"failures.":[96],"We":[97],"explore":[98],"in":[99,264],"particular":[100],"following":[102],"notion":[103,228],"local":[105],"resilience":[106],":":[107],"beginning":[108],"a":[110,144,277],"graph,":[111],"up":[114],"fraction":[117,189],"edges":[120],"adversary":[122,176],"may":[123,169,177,204],"delete":[124],"at":[125],"each":[126],"vertex,":[127],"so":[128,257],"protocols":[131],"need":[132],"significantly":[133,234],"more":[134],"rounds":[135],"information.":[139],"Our":[140],"main":[141],"findings":[142],"establish":[143],"separation":[145],"among":[146],"On":[150,164,208],"one":[151],"hand,":[152,167],"robust":[155,194],"parameters":[160],"consider.":[163],"other":[166],"slow":[170],"down":[171],"significantly,":[172],"even":[173],"if":[174],"modify":[178],"degrees":[180],"vertices":[183,251],"by":[184,254],"arbitrarily":[186],"small":[187],"positive":[188],"only.":[190],"Finally,":[191],"when":[195],"failures":[199],"considered,":[201],"otherwise":[202],"it":[203],"slowed":[206],"down.":[207],"technical":[210],"side,":[211],"develop":[213],"novel":[215],"methods":[216],"analysis":[219],"rumour-spreading":[222],"protocols.":[223],"First,":[224],"exploit":[226],"self-bounding":[230],"functions":[231],"facilitate":[233],"round-based":[236],"analysis:":[237],"show":[239],"any":[242],"variance":[245],"growth":[248],"informed":[250],"bounded":[253],"its":[255],"expectation,":[256],"concentration":[259],"follow":[261],"immediately.":[262],"Second,":[263],"order":[265],"control":[267],"adversarial":[268],"make":[274],"use":[275],"powerful":[278],"tool":[279],"from":[280],"extremal":[281],"theory,":[283],"namely":[284],"Szemer\u00e9di\u2019s":[285],"Regularity":[286],"Lemma.":[287]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-03-02T00:00:00"}