{"id":"https://openalex.org/W2737814453","doi":"https://doi.org/10.1145/3087556.3087564","title":"Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs","display_name":"Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2737814453","doi":"https://doi.org/10.1145/3087556.3087564","mag":"2737814453"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087564","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087564&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3087564&type=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's College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"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's College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"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/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":"Nicol\u00e1s Rivera","raw_affiliation_strings":["King's College London, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King's College London, London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":6.8592,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.9707113,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"312"},"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.9997000098228455,"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.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9941999912261963,"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.7185945510864258},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5832953453063965},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5209899544715881},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4710371792316437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46045854687690735},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4594041407108307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45576012134552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4441922605037689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4105485677719116},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10962510108947754}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7185945510864258},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5832953453063965},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5209899544715881},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4710371792316437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46045854687690735},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4594041407108307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45576012134552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4441922605037689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4105485677719116},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10962510108947754},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3087556.3087564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087564","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087564&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/2f58a56f-9ab0-4b62-acfd-9e272c8e7f4b","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/2f58a56f-9ab0-4b62-acfd-9e272c8e7f4b","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/77966026/Improved_Cover_Time_Bounds_COOPER_Accepted_6_Jul_17_GOLD_VoR_CCBY.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cooper , C D , Radzik , T & Rivera Aburto , N A 2017 , Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs . in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures . pp. 305-312 . https://doi.org/10.1145/3087556.3087564","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3087556.3087564","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3087556.3087564","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3087564&type=pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2737814453.pdf","grobid_xml":"https://content.openalex.org/works/W2737814453.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1564693713","https://openalex.org/W1975564741","https://openalex.org/W2006544720","https://openalex.org/W2039765418","https://openalex.org/W2121095025","https://openalex.org/W2167167562","https://openalex.org/W2281441226","https://openalex.org/W2952779074","https://openalex.org/W2963680590"],"related_works":["https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W4232403550","https://openalex.org/W623607250","https://openalex.org/W4245429118","https://openalex.org/W4205110281","https://openalex.org/W4212927854","https://openalex.org/W4211151614","https://openalex.org/W4244798043","https://openalex.org/W2033630974"],"abstract_inverted_index":{"We":[0],"present":[1],"improved":[2],"bounds":[3],"on":[4],"the":[5,9,50,53,67,71,92,103,108],"cover":[6],"time":[7],"of":[8,33,102,116],"coalescing-branching":[10],"random":[11,98],"walk":[12],"process":[13,80,104],"COBRA.":[14],"The":[15,78,100],"COBRA":[16,79],"process,":[17],"introduced":[18],"in":[19,39,52],"[Dutta":[20],"et":[21],"al.,":[22],"SPAA":[23],"2013],":[24],"can":[25],"be":[26],"viewed":[27],"as":[28],"spreading":[29],"a":[30,97,113],"single":[31],"item":[32],"information":[34,51,72,109],"throughout":[35],"an":[36],"undirected":[37],"graph":[38],"synchronised":[40],"rounds.":[41],"In":[42],"each":[43,45],"round,":[44],"vertex":[46,119],"which":[47],"has":[48],"received":[49],"previous":[54],"round":[55],"(possibly":[56],"simultaneously":[57],"from":[58],"more":[59],"than":[60],"one":[61],"neighbour":[62],"and":[63],"possibly":[64],"not":[65],"for":[66,84],"first":[68],"time),":[69],"'pushes'":[70],"to":[73,96,106],"b":[74,88],"randomly":[75],"selected":[76],"neighbours.":[77],"is":[81,105],"typically":[82],"studied":[83],"integer":[85],"branching":[86],"rates":[87],"\\ge":[89],"2":[90],"(with":[91],"case":[93],"b=1":[94],"corresponding":[95],"walk).":[99],"aim":[101],"propagate":[107],"quickly,":[110],"but":[111],"with":[112],"limited":[114],"number":[115],"transmissions":[117],"per":[118,120],"round.":[121]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}