{"id":"https://openalex.org/W2753506939","doi":"https://doi.org/10.1017/s0963548319000385","title":"The string of diamonds is nearly tight for rumour spreading","display_name":"The string of diamonds is nearly tight for rumour spreading","publication_year":2019,"publication_date":"2019-11-04","ids":{"openalex":"https://openalex.org/W2753506939","doi":"https://doi.org/10.1017/s0963548319000385","mag":"2753506939"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548319000385","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548319000385","pdf_url":null,"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":null,"license_id":null,"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"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1704.00874","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Omer Angel","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Omer Angel","raw_affiliation_strings":["Department of Mathematics, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of British Columbia, Vancouver, BC, V6T 1Z2, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Abbas Mehrabian","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Abbas Mehrabian","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, V6T 1Z4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, V6T 1Z4, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yuval Peres","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuval Peres","raw_affiliation_strings":["Microsoft Research, Redmond, WA98052, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA98052, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00432291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"2","first_page":"190","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.36340001225471497,"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.36340001225471497,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.3231000006198883,"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.11309999972581863,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6898000240325928},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6718999743461609},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6632000207901001},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.447299987077713},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.42480000853538513}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6898000240325928},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6718999743461609},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6632000207901001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5277000069618225},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.47679999470710754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3659000098705292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3264000117778778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32030001282691956},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30820000171661377}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548319000385","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548319000385","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1704.00874","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.00874","pdf_url":"https://arxiv.org/pdf/1704.00874","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1704.00874","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.00874","pdf_url":"https://arxiv.org/pdf/1704.00874","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W22683957","https://openalex.org/W2038562061","https://openalex.org/W2047784567","https://openalex.org/W2117905067","https://openalex.org/W2157004711","https://openalex.org/W2163301924","https://openalex.org/W2283391494","https://openalex.org/W2405987069","https://openalex.org/W2495546859"],"related_works":[],"abstract_inverted_index":{"Abstarct":[0],"For":[1],"a":[2,75,96],"rumour":[3,24],"spreading":[4,25],"protocol,":[5],"the":[6,12,17,21,43,58,85,111],"spread":[7,48,113],"time":[8,14],"is":[9,50,71,153],"defined":[10],"as":[11,82],"first":[13],"everyone":[15],"learns":[16],"rumour.":[18],"We":[19,90],"compare":[20],"synchronous":[22],"push&amp;pull":[23],"protocol":[26],"with":[27],"its":[28],"asynchronous":[29],"variant,":[30],"and":[31,39,66,118,129,144],"show":[32,92,146],"that":[33,93],"for":[34,95,109],"any":[35,40],"n":[36,80,116,119],"-vertex":[37],"graph":[38],"starting":[41],"vertex,":[42],"ratio":[44],"between":[45],"their":[46],"expected":[47],"times":[49,114],"bounded":[51],"by":[52,84],"$O({n^{1/3}}{\\log":[53],"^{2/3}}n)$":[54],".":[55],"This":[56],"improves":[57],"$O(\\sqrt":[59],"n)$":[60],"upper":[61],"bound":[62,70],"of":[63,77,87,101],"Giakkoupis,":[64],"Nazari":[65],"Woelfel":[67],"(2016).":[68],"Our":[69],"tight":[72],"up":[73],"to":[74],"factor":[76],"O":[78],"(log":[79],"),":[81],"illustrated":[83],"string":[86],"diamonds":[88],"graph.":[89],"also":[91],"if,":[94],"pair":[97,149],"\u03b1":[98,117,150],",":[99,151],"\u03b2":[100,120,152],"real":[102],"numbers,":[103],"there":[104],"exist":[105],"infinitely":[106],"many":[107],"graphs":[108],"which":[110],"two":[112],"are":[115],"in":[121],"expectation,":[122],"then":[123],"$0":[124],"\\le":[125,127,131,133],"\\alpha":[126,141],"1$":[128],"$\\alpha":[130],"\\beta":[132],"{1":[134],"\\over":[135,139],"3}":[136,140],"+":[137],"{2":[138],"$":[142],";":[143],"we":[145],"each":[147],"such":[148],"achievable.":[154]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-09-15T00:00:00"}
