{"id":"https://openalex.org/W2583780251","doi":"https://doi.org/10.1137/14099992x","title":"Rumor Spreading with No Dependence on Conductance","display_name":"Rumor Spreading with No Dependence on Conductance","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2583780251","doi":"https://doi.org/10.1137/14099992x","mag":"2583780251"},"language":"en","primary_location":{"id":"doi:10.1137/14099992x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099992x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["Department of Computer Science, Technion, Haifa 32000, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, Haifa 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Department of Computer Science, CMU, Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, CMU, Pittsburgh, PA 15213","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022068777","display_name":"Jonathan A. Kelner","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Kelner","raw_affiliation_strings":["School of Engineering, MIT, Cambridge, MA 02138"],"affiliations":[{"raw_affiliation_string":"School of Engineering, MIT, Cambridge, MA 02138","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055339186","display_name":"Petar Maymounkov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petar Maymounkov","raw_affiliation_strings":["The Go Circuit Project, 49 Kademlia st, Sofia 1505, Bulgaria"],"affiliations":[{"raw_affiliation_string":"The Go Circuit Project, 49 Kademlia st, Sofia 1505, Bulgaria","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5061279024"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.9479,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76322978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"46","issue":"1","first_page":"58","last_page":"79"},"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.9991999864578247,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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.9976000189781189,"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/gossip","display_name":"Gossip","score":0.9504165053367615},{"id":"https://openalex.org/keywords/rumor","display_name":"Rumor","score":0.885362446308136},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.612282931804657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5788167119026184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5395433902740479},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5250794291496277},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5208971500396729},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49763014912605286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4870222210884094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4523495137691498},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4481743574142456},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44779372215270996},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42947494983673096},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3875581622123718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38151612877845764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25394901633262634},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1036926805973053}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.9504165053367615},{"id":"https://openalex.org/C2780469804","wikidata":"https://www.wikidata.org/wiki/Q878352","display_name":"Rumor","level":2,"score":0.885362446308136},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.612282931804657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5788167119026184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5395433902740479},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5250794291496277},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5208971500396729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49763014912605286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4870222210884094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4523495137691498},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4481743574142456},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44779372215270996},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42947494983673096},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3875581622123718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38151612877845764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25394901633262634},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1036926805973053},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C39549134","wikidata":"https://www.wikidata.org/wiki/Q133080","display_name":"Public relations","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14099992x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099992x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1487838010","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G1507633083","display_name":null,"funder_award_id":"2015803","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G1739869781","display_name":null,"funder_award_id":"CCF-0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2168440041","display_name":null,"funder_award_id":"696/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G2805638855","display_name":null,"funder_award_id":"1696/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3141937714","display_name":null,"funder_award_id":"CCF-1527110 and CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4246297169","display_name":null,"funder_award_id":"CCF-093937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5454242832","display_name":"CCF-BSF: AF: Small: Coding for Distributed Computing","funder_award_id":"1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6244900323","display_name":null,"funder_award_id":"0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6759497661","display_name":null,"funder_award_id":"0843915","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7198194507","display_name":null,"funder_award_id":"0939370-CCF","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7659139977","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G835196829","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8925080215","display_name":null,"funder_award_id":"CCF-0843915","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","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"},{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1967546560","https://openalex.org/W2018963243","https://openalex.org/W2033607935","https://openalex.org/W2047784567","https://openalex.org/W2047993669","https://openalex.org/W2061507472","https://openalex.org/W2063860324","https://openalex.org/W2078958987","https://openalex.org/W2079522169","https://openalex.org/W2099237198","https://openalex.org/W2129575457","https://openalex.org/W2143858321","https://openalex.org/W2293928399","https://openalex.org/W4206696315","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W78560857","https://openalex.org/W4302064505","https://openalex.org/W2950408910","https://openalex.org/W2949310786","https://openalex.org/W4293571697","https://openalex.org/W4287865815","https://openalex.org/W3006777378","https://openalex.org/W1481974969","https://openalex.org/W2286231031","https://openalex.org/W2004634617"],"abstract_inverted_index":{"In":[0,23,107,142,202,240,254,298],"this":[1,24,76,111,198,241],"paper,":[2,242],"we":[3,243,256,300],"study":[4],"how":[5,79],"a":[6,14,42,58,69,151,188,203,210,234,272],"collection":[7],"of":[8,21,33,65,82,98,119,128,137,159,169,205,212,219,224,236,274,296,335],"interconnected":[9],"nodes":[10,26],"can":[11,317],"efficiently":[12,250],"perform":[13],"global":[15,31,160],"computation":[16,337],"in":[17,45,68,75,91,122,182,222,233,266,271,313,320,324],"the":[18,30,34,51,87,108,126,135,138,143,157,178,194,217,225,245,262,281,292,314,325],"$\\mathcal{GOSSIP}$":[19,144,326],"model":[20,25,110,316],"communication.":[22],"do":[27],"not":[28],"know":[29],"topology":[32],"network":[35,273],"and":[36,100,125,156,228],"may":[37,60],"only":[38],"initiate":[39],"contact":[40],"with":[41,50,63,277],"single":[43,70,152],"neighbor":[44,153,189],"each":[46,93,115,123,146,184],"round.":[47,71],"This":[48,283],"contrasts":[49],"much":[52],"less":[53],"restrictive":[54],"$\\mathcal{LOCAL}$":[55,109,315],"model,":[56,145],"where":[57],"node":[59,94,116,147,185],"simultaneously":[61],"communicate":[62],"all":[64,105,118],"its":[66,120],"neighbors":[67],"A":[72],"basic":[73],"question":[74],"setting":[77],"is":[78,101,112,196,284,305],"many":[80],"rounds":[81,129,220,270,312,323],"communication":[83,140],"are":[84,338],"required":[85,102,130,221],"for":[86],"information":[88,99,121,161,263],"dissemination":[89,264],"problem,":[90],"which":[92,183],"has":[95],"some":[96],"piece":[97],"to":[103,134,154,165,341],"collect":[104],"others.":[106],"quite":[113,200],"simple:":[114],"broadcasts":[117],"round,":[124],"number":[127,218],"will":[131],"be":[132,318],"equal":[133],"diameter":[136,275],"underlying":[139],"graph.":[141],"must":[148],"independently":[149,186],"choose":[150],"contact,":[155],"lack":[158],"makes":[162],"it":[163],"difficult":[164],"make":[166],"any":[167,252,307],"sort":[168],"principled":[170],"choice.":[171],"As":[172],"such,":[173],"researchers":[174,208],"have":[175],"focused":[176],"on":[177,216,251,280],"uniform":[179],"gossip":[180],"algorithm,":[181],"selects":[187],"uniformly":[190],"at":[191,267,285],"random.":[192],"When":[193],"graph":[195,229],"well-connected,":[197],"works":[199,249],"well.":[201],"string":[204],"beautiful":[206],"papers,":[207],"proved":[209],"sequence":[211],"successively":[213],"stronger":[214,304],"bounds":[215],"terms":[223],"conductance":[226],"$\\phi$":[227],"size":[230],"$n$,":[231],"culminating":[232],"bound":[235,295],"$\\Theta(\\phi^{-1}":[237],"\\log":[238],"n)$.":[239],"give":[244,257],"first":[246],"protocol":[247],"that":[248,260,302,309,331],"topology.":[253],"particular":[255],"an":[258,287,342],"algorithm":[259,308],"solves":[261],"problem":[265],"most":[268,286],"$O(D+\\text{polylog}{(n)})$":[269],"$D$,":[276],"no":[278],"dependence":[279],"conductance.":[282],"additive":[288,343],"polylogarithmic":[289,344],"factor":[290],"from":[291],"trivial":[293],"lower":[294],"$D$.":[297],"fact,":[299],"prove":[301,330],"something":[303],"true:":[306],"requires":[310],"$T$":[311],"simulated":[319],"$O(T":[321],"+\\mathrm{polylog}(n))$":[322],"model.":[327],"We":[328],"thus":[329],"these":[332],"two":[333],"models":[334],"distributed":[336],"equivalent":[339],"up":[340],"term.":[345]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}