{"id":"https://openalex.org/W2808031467","doi":"https://doi.org/10.1145/3209688","title":"Better Bounds for Coalescing-Branching Random Walks","display_name":"Better Bounds for Coalescing-Branching Random Walks","publication_year":2018,"publication_date":"2018-03-31","ids":{"openalex":"https://openalex.org/W2808031467","doi":"https://doi.org/10.1145/3209688","mag":"2808031467"},"language":"en","primary_location":{"id":"doi:10.1145/3209688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209688","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3209688","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["Northeastern University, Boston MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston MA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075798943","display_name":"Scott Roche","orcid":null},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Roche","raw_affiliation_strings":["Akamai Technologies, Cambridge MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Akamai Technologies, Cambridge MA","institution_ids":["https://openalex.org/I10734018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062318856"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":1.0946,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73828407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976000189781189,"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/T11478","display_name":"Caching and Content Delivery","score":0.9952999949455261,"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/random-walk","display_name":"Random walk","score":0.7301995158195496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7084458470344543},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6326918005943298},{"id":"https://openalex.org/keywords/cobra","display_name":"Cobra","score":0.586264967918396},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5696032047271729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5535953044891357},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4850420355796814},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4704916477203369},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4588802754878998},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.4501294791698456},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4496423006057739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2180761992931366},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1271854043006897}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7301995158195496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7084458470344543},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6326918005943298},{"id":"https://openalex.org/C2779547071","wikidata":"https://www.wikidata.org/wiki/Q608565","display_name":"Cobra","level":2,"score":0.586264967918396},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5696032047271729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5535953044891357},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4850420355796814},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4704916477203369},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4588802754878998},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.4501294791698456},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4496423006057739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2180761992931366},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1271854043006897},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3209688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209688","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":{"id":"doi:10.1145/3209688","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209688","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209688","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3370793288","display_name":null,"funder_award_id":"CCF-1422715","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4392828662","display_name":"AF: Small: Network Algorithms Under Adversarial and Stochastic Uncertainty","funder_award_id":"1422715","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4583879618","display_name":null,"funder_award_id":"CNS-1228598, CCF-1320231, CCF-1535795, CCF-1422715, CCF-1535929","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G467264487","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535929","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6050657354","display_name":null,"funder_award_id":"CNS-1228598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6133564518","display_name":null,"funder_award_id":"CCF-1535795","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6289631934","display_name":"AF: Small: Data Synchronization : Theory, Algorithms, and Practice","funder_award_id":"1320231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6647242665","display_name":"TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation","funder_award_id":"1228598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8648019094","display_name":"AitF: FULL: Collaborative Research: Better Hashing for Applications:  From Nuts & Bolts to Asymptotics","funder_award_id":"1535795","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/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338298","display_name":"Office of Naval Research Global","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808031467.pdf","grobid_xml":"https://content.openalex.org/works/W2808031467.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1548210024","https://openalex.org/W1595409123","https://openalex.org/W1600293573","https://openalex.org/W1914027636","https://openalex.org/W1975694313","https://openalex.org/W1988770614","https://openalex.org/W1997918610","https://openalex.org/W2029596791","https://openalex.org/W2046480269","https://openalex.org/W2046919262","https://openalex.org/W2047784567","https://openalex.org/W2056760934","https://openalex.org/W2063513700","https://openalex.org/W2066068060","https://openalex.org/W2067883080","https://openalex.org/W2069992656","https://openalex.org/W2078980950","https://openalex.org/W2108386843","https://openalex.org/W2111933629","https://openalex.org/W2160504298","https://openalex.org/W2169397725","https://openalex.org/W2170807097","https://openalex.org/W2171032320","https://openalex.org/W2206897606","https://openalex.org/W2281441226","https://openalex.org/W2494834885","https://openalex.org/W2568511220","https://openalex.org/W2737814453","https://openalex.org/W2963680590","https://openalex.org/W3100745927","https://openalex.org/W4230376356"],"related_works":["https://openalex.org/W3013135944","https://openalex.org/W3082827772","https://openalex.org/W3040253843","https://openalex.org/W2420328433","https://openalex.org/W3020570327","https://openalex.org/W2265857976","https://openalex.org/W4213166692","https://openalex.org/W1975564741","https://openalex.org/W2336106727","https://openalex.org/W2099601775"],"abstract_inverted_index":{"Coalescing-branching":[0],"random":[1,13,53,265],"walks,":[2],"or":[3,26,103],"cobra":[4,85,116],"walks":[5,14,86,117,266],"for":[6,84,115,127,173,208,223,259,264],"short,":[7],"are":[8,46,70],"a":[9,34,41,174,202,224,228],"natural":[10,80],"variant":[11],"of":[12,22,29,43,254],"on":[15,131,150,177,227],"graphs":[16,210],"that":[17,61,123,148,169,205,219,251],"can":[18,267],"model":[19],"the":[20,27,44,65,71,76,88,94,105,124,128,142,157,170,220,247,252,260],"spread":[21,28],"disease":[23],"through":[24],"contacts":[25],"information":[30],"in":[31,118],"networks.":[32],"In":[33,108],"k":[35,52],"-cobra":[36],"walk,":[37],"at":[38,64,75],"each":[39,48],"timestep,":[40],"subset":[42],"vertices":[45,74,232],"active;":[47],"active":[49,63,73],"vertex":[50],"chooses":[51],"neighbors":[54],"(sampled":[55],"independently":[56],"and":[57,68,233],"uniformly":[58],"with":[59,184,211,230],"replacement)":[60],"become":[62,101],"next":[66,77],"step,":[67],"these":[69],"only":[72,207],"step.":[78],"A":[79],"quantity":[81],"to":[82,93],"study":[83],"is":[87,136,188,236,246],"cover":[89,125,158,171,221,262],"time,":[90],"which":[91],"corresponds":[92],"expected":[95],"time":[96,126,159,172,222,263],"when":[97],"all":[98],"nodes":[99],"have":[100],"infected":[102],"received":[104],"disseminated":[106],"information.":[107],"this":[109,245],"article,":[110],"we":[111,217],"extend":[112],"previous":[113,153,203],"results":[114],"multiple":[119],"ways.":[120],"We":[121,167],"show":[122,168,218],"2-cobra":[129,175,225,271],"walk":[130,176,226],"[0,":[132],"n":[133,139,163,165,179,198,231,243,256],"]":[134],"d":[135,151,181,191],"O":[137,161,189,238],"(":[138,162,190,239],")":[140,258],"(where":[141],"order":[143],"notation":[144],"hides":[145],"constant":[146],"factors":[147],"depend":[149],");":[152],"work":[154],"had":[155],"shown":[156],"was":[160],"\u22c5polylog(":[164],")).":[166],"an":[178],"-vertex":[180],"-regular":[182],"graph":[183,229],"conductance":[185],"\u03c6":[186,193],"G":[187,195],"4":[192],"\u22122":[194],"log":[196,242],"2":[197],"),":[199],"significantly":[200],"generalizing":[201],"result":[204,249],"held":[206],"expander":[209],"sufficiently":[212],"high":[213],"expansion.":[214],"And,":[215],"finally,":[216],"m":[234],"edges":[235],"always":[237],"mn":[240],"3/4":[241],";":[244],"first":[248],"showing":[250],"bound":[253],"\u0398(":[255],"3":[257],"worst-case":[261],"be":[268],"beaten":[269],"using":[270],"walks.":[272]},"counts_by_year":[{"year":2019,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}