{"id":"https://openalex.org/W2985731870","doi":"https://doi.org/10.1145/3364206","title":"New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs","display_name":"New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs","publication_year":2019,"publication_date":"2019-09-30","ids":{"openalex":"https://openalex.org/W2985731870","doi":"https://doi.org/10.1145/3364206","mag":"2985731870"},"language":"en","primary_location":{"id":"doi:10.1145/3364206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364206","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":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/ws/files/122130627/New_Cover_Time_Bounds_COOPER_Acc5Aug2019Epub30Nov2019_GREEN_AAM.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022238950","display_name":"Colin Cooper","orcid":"https://orcid.org/0000-0002-5264-4401"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Colin Cooper","raw_affiliation_strings":["King\u2019s College London, London, United Kingdom","King's College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070579616","display_name":"Tomasz Radzik","orcid":"https://orcid.org/0000-0002-7776-5461"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tomasz Radzik","raw_affiliation_strings":["King\u2019s College London, London, United Kingdom","King's College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King\u2019s College London, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028837655","display_name":"Nicol\u00e1s Rivera","orcid":"https://orcid.org/0000-0003-3368-9708"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicolas Rivera","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"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":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24705211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"24"},"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.9983999729156494,"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.9983999729156494,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9919999837875366,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.8043934106826782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6146607995033264},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6025353670120239},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5827932357788086},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5424355864524841},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4777326285839081},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.45349299907684326},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4384578466415405},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4289501905441284}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8043934106826782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6146607995033264},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6025353670120239},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5827932357788086},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5424355864524841},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4777326285839081},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.45349299907684326},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4384578466415405},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4289501905441284},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3364206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364206","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"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/ddedf4ef-1b5a-4e66-ab18-0fe0c6654ccd","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ddedf4ef-1b5a-4e66-ab18-0fe0c6654ccd","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/122130627/New_Cover_Time_Bounds_COOPER_Acc5Aug2019Epub30Nov2019_GREEN_AAM.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper , C D , Radzik , T & Rivera Aburto , N 2019 , ' New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs ' , ACM Transactions on Parallel Computing , vol. 6 , no. 3 , 16 , pp. 1-24 . https://doi.org/10.1145/3364206","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/ddedf4ef-1b5a-4e66-ab18-0fe0c6654ccd","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ddedf4ef-1b5a-4e66-ab18-0fe0c6654ccd","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/122130627/New_Cover_Time_Bounds_COOPER_Acc5Aug2019Epub30Nov2019_GREEN_AAM.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper , C D , Radzik , T & Rivera Aburto , N 2019 , ' New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs ' , ACM Transactions on Parallel Computing , vol. 6 , no. 3 , 16 , pp. 1-24 . https://doi.org/10.1145/3364206","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1159596240","display_name":null,"funder_award_id":"EP/M005038/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3229677935","display_name":"Randomized Algorithms for Computer Networks","funder_award_id":"EP/M005038/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4518460442","display_name":null,"funder_award_id":"679660","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2985731870.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1975564741","https://openalex.org/W1989274820","https://openalex.org/W2039765418","https://openalex.org/W2046919262","https://openalex.org/W2047784567","https://openalex.org/W2072211488","https://openalex.org/W2094887806","https://openalex.org/W2167167562","https://openalex.org/W2281441226","https://openalex.org/W2311405147","https://openalex.org/W2737814453","https://openalex.org/W2780822466","https://openalex.org/W2797313639","https://openalex.org/W2963680590"],"related_works":["https://openalex.org/W2078123803","https://openalex.org/W1491170033","https://openalex.org/W2023901860","https://openalex.org/W2168798728","https://openalex.org/W2587059372","https://openalex.org/W1834996468","https://openalex.org/W1560329019","https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2099601775"],"abstract_inverted_index":{"We":[0,339],"present":[1],"new":[2,329],"bounds":[3,146,189,224,369],"on":[4,167],"the":[5,9,49,52,66,70,91,103,108,127,137,168,215,248,268,272,290,293,300,327,333,336,349,374],"cover":[6,124,170],"time":[7,125,171],"of":[8,32,102,116,130,147,190,271,292,310,335,343,376],"coalescing-branching":[10],"random":[11,98],"walk":[12],"process":[13,79,104,274,302],"COBRA.":[14],"The":[15,77,100,122,295],"COBRA":[16,78,123,169,273,301,337,371],"process,":[17,345,356],"introduced":[18],"in":[19,38,51,220],"Dutta":[20],"et":[21],"al.":[22],"[9],":[23],"can":[24,360],"be":[25,361],"viewed":[26,362],"as":[27,363],"spreading":[28],"a":[29,97,113,308,341],"single":[30],"item":[31],"information":[33,50,71,109,138],"throughout":[34],"an":[35],"undirected":[36],"graph":[37,183],"synchronised":[39],"rounds.":[40],"In":[41],"each":[42,44],"round,":[43],"vertex":[45,119],"that":[46,358],"has":[47],"received":[48,136],"previous":[53,250,297],"round":[54],"(possibly":[55],"simultaneously":[56],"from":[57],"more":[58],"than":[59],"one":[60],"neighbour":[61],"and":[62,160,181,188,201,367],"possibly":[63],"not":[64],"for":[65,83,172,209,225,243,263,299,304,370],"first":[67,261],"time),":[68],"\u201cpushes\u201d":[69],"to":[72,96,106,238,267,331,365],"k":[73,87,93],"randomly":[74],"selected":[75],"neighbours.":[76],"is":[80,105,126,252,275,289],"typically":[81],"studied":[82],"integer":[84],"branching":[85],"rates":[86],"\u2265":[88],"2":[89,156,194,205,233,279,283,316,318],"(with":[90],"case":[92,306],"=1":[94],"corresponding":[95],"walk).":[99],"aim":[101],"propagate":[107],"quickly,":[110],"but":[111],"with":[112,176,214,352],"limited":[114],"number":[115,129],"transmissions":[117],"per":[118,120],"round.":[121],"expected":[128],"rounds":[131],"until":[132],"all":[133],"vertices":[134],"have":[135],"at":[139],"least":[140],"once.":[141],"Our":[142,223,260],"main":[143],"results":[144,298],"are":[145,228],"O":[148,161,191,202,230,239,253,276,311],"(":[149,152,162,231,240,254],"m":[150,163,179],"+":[151,195,280],"d":[153,185],"max":[154,186],")":[155,159,166,200,208,242],"log":[157,164,198,234,257],"n":[158,165,177,199,207,232,235,241,255,258,285,319],"arbitrary":[173],"connected":[174,212],"graphs":[175,213,227,265],"vertices,":[178],"edges":[180],"maximum":[182],"degree":[184,245],",":[187],"((":[192,277,312],"r":[193,196,210,278,281,313],"/(1\u2212\u03bb))":[197],"((1/(1\u2212":[203],"\u03bb)":[204],")log":[206,284,317],"-regular":[211],"second":[216],"largest":[217],"eigenvalue":[218],"\u03bb":[219],"absolute":[221],"value.":[222],"general":[226],"always":[229],"),":[236,286],"decreasing":[237],"constant":[244],"graphs,":[246],"while":[247],"best":[249,296],"bound":[251,262,309],"2.75":[256],").":[259,320],"regular":[264],"applied":[266],"lazy":[269],"variant":[270],"/\u03c6":[282,315],"where":[287],"\u03c6":[288],"conductance":[291],"graph.":[294],"imply":[303],"this":[305],"only":[307],"4":[314],"To":[321],"derive":[322],"our":[323],"bounds,":[324],"we":[325,347],"develop":[326],"following":[328],"approach":[330],"analysing":[332,373],"performance":[334],"process.":[338],"introduce":[340],"type":[342],"infection":[344],"which":[346],"call":[348],"Biased":[350],"Infection":[351],"Persistent":[353],"Source":[354],"(BIPS)":[355],"show":[357],"BIPS":[359],"dual":[364],"COBRA,":[366],"obtain":[368],"by":[372],"convergence":[375],"BIPS.":[377]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}