{"id":"https://openalex.org/W3097043185","doi":"https://doi.org/10.1017/s0963548320000565","title":"Tail bounds on hitting times of randomized search heuristics using variable drift analysis","display_name":"Tail bounds on hitting times of randomized search heuristics using variable drift analysis","publication_year":2020,"publication_date":"2020-11-05","ids":{"openalex":"https://openalex.org/W3097043185","doi":"https://doi.org/10.1017/s0963548320000565","mag":"3097043185"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000565","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000565","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":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure-oai.bham.ac.uk/ws/files/106354765/Tail_Bounds_on_Hitting_Times.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026427521","display_name":"Per Kristian Lehre","orcid":"https://orcid.org/0000-0002-9521-1251"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"P. K. Lehre","raw_affiliation_strings":["School of Computer Science, University of Birmingham, BirminghamB15 2TT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, BirminghamB15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"C. Witt","raw_affiliation_strings":["DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038689623"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":1.7817,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86398327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"30","issue":"4","first_page":"550","last_page":"569"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12761","display_name":"Data Stream Mining Techniques","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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6929045915603638},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6496599912643433},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.48023563623428345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4758864641189575},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.4596952497959137},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.4369685649871826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38588282465934753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3300638794898987},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29523706436157227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28357404470443726},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.11174169182777405},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09230214357376099}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6929045915603638},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6496599912643433},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.48023563623428345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4758864641189575},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.4596952497959137},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4369685649871826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38588282465934753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3300638794898987},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29523706436157227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28357404470443726},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.11174169182777405},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09230214357376099}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548320000565","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000565","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:pure.atira.dk:publications/805ee8f9-236c-44b0-8c22-8b234bd985ff","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/tail-bounds-on-hitting-times-of-randomized-search-heuristics-using-variable-drift-analysis(805ee8f9-236c-44b0-8c22-8b234bd985ff).html","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/106354765/Tail_Bounds_on_Hitting_Times.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lehre , P K & Witt , C 2020 , ' Tail bounds on hitting times of randomized search heuristics using variable drift analysis ' , Combinatorics, Probability and Computing . https://doi.org/10.1017/S0963548320000565","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/805ee8f9-236c-44b0-8c22-8b234bd985ff","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/805ee8f9-236c-44b0-8c22-8b234bd985ff","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lehre, P K & Witt, C 2020, 'Tail bounds on hitting times of randomized search heuristics using variable drift analysis', Combinatorics, Probability and Computing. https://doi.org/10.1017/S0963548320000565","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/bfdcc357-ac66-4d8d-bb15-c5701c9ed438","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/bfdcc357-ac66-4d8d-bb15-c5701c9ed438","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lehre , P K & Witt , C 2021 , ' Tail bounds on hitting times of randomized search heuristics using variable drift analysis ' , Combinatorics Probability and Computing , vol. 30 , no. 4 , pp. 550\u2013569 . https://doi.org/10.1017/S0963548320000565","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/805ee8f9-236c-44b0-8c22-8b234bd985ff","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/tail-bounds-on-hitting-times-of-randomized-search-heuristics-using-variable-drift-analysis(805ee8f9-236c-44b0-8c22-8b234bd985ff).html","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/106354765/Tail_Bounds_on_Hitting_Times.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lehre , P K & Witt , C 2020 , ' Tail bounds on hitting times of randomized search heuristics using variable drift analysis ' , Combinatorics, Probability and Computing . https://doi.org/10.1017/S0963548320000565","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3097043185.pdf","grobid_xml":"https://content.openalex.org/works/W3097043185.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W1522597852","https://openalex.org/W1596384364","https://openalex.org/W1605768620","https://openalex.org/W1606774760","https://openalex.org/W1632066424","https://openalex.org/W1645523878","https://openalex.org/W1843453084","https://openalex.org/W1933565355","https://openalex.org/W1963976267","https://openalex.org/W1970025632","https://openalex.org/W1972196995","https://openalex.org/W1973393028","https://openalex.org/W1983804795","https://openalex.org/W1984555915","https://openalex.org/W1985115934","https://openalex.org/W1985318592","https://openalex.org/W1995643834","https://openalex.org/W2005317641","https://openalex.org/W2012629024","https://openalex.org/W2045438907","https://openalex.org/W2061751517","https://openalex.org/W2080956517","https://openalex.org/W2081568812","https://openalex.org/W2084149434","https://openalex.org/W2099994560","https://openalex.org/W2100137329","https://openalex.org/W2102044362","https://openalex.org/W2165220807","https://openalex.org/W2287495828","https://openalex.org/W2339288500","https://openalex.org/W2499441210","https://openalex.org/W2745977891","https://openalex.org/W2808435117","https://openalex.org/W2950855788","https://openalex.org/W2955805227","https://openalex.org/W2963154839","https://openalex.org/W2964312612","https://openalex.org/W2969531032","https://openalex.org/W2990677534","https://openalex.org/W3004042307","https://openalex.org/W3090844675","https://openalex.org/W3100597221","https://openalex.org/W3122779104","https://openalex.org/W3127900374","https://openalex.org/W4240139199"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2275524962","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775"],"abstract_inverted_index":{"Abstract":[0],"Drift":[1],"analysis":[2,12],"is":[3,154],"one":[4],"of":[5,13,30,40,52,62,84,105,116,126,135,146,152,163,190],"the":[6,10,37,41,50,60,79,85,102,114,124,136,147,150,161,191],"state-of-the-art":[7],"techniques":[8],"for":[9,44,48],"runtime":[11],"randomized":[14],"search":[15],"heuristics":[16],"(RSHs)":[17],"such":[18],"as":[19],"evolutionary":[20],"algorithms":[21],"(EAs),":[22],"simulated":[23],"annealing,":[24],"etc":[25],".":[26,143],"The":[27,89,144],"vast":[28],"majority":[29],"existing":[31],"drift":[32,73,175,182,193],"theorems":[33,183],"yield":[34],"bounds":[35,77,92,159],"on":[36,59,78,101,109,160],"expected":[38,137],"value":[39],"hitting":[42,86],"time":[43,87,104,138],"a":[45,71,106,172],"target":[46],"state,":[47],"example":[49],"set":[51],"optimal":[53],"solutions,":[54],"without":[55],"making":[56],"additional":[57],"statements":[58],"distribution":[61],"this":[63,67],"time.":[64],"We":[65],"address":[66],"lack":[68],"by":[69,128,156,180],"providing":[70],"general":[72,117,192],"theorem":[74,148,194],"that":[75,176],"includes":[76],"upper":[80],"and":[81],"lower":[82],"tail":[83,91,158,185],"distribution.":[88],"new":[90],"are":[93,195],"applied":[94],"to":[95],"prove":[96],"very":[97],"precise":[98],"sharp-concentration":[99],"results":[100,170],"running":[103],"simple":[107],"EA":[108],"standard":[110],"benchmark":[111],"problems,":[112,123],"including":[113],"class":[115],"linear":[118],"functions.":[119],"On":[120],"all":[121],"these":[122,169],"probability":[125],"deviating":[127],"an":[129],"r":[130,142],"-factor":[131],"in":[132,165],"lower-order":[133],"terms":[134],"decreases":[139],"exponentially":[140],"with":[141,184],"usefulness":[145],"outside":[149],"theory":[151],"RSHs":[153],"demonstrated":[155],"deriving":[157],"number":[162],"cycles":[164],"random":[166],"permutations.":[167],"All":[168],"handle":[171],"position-dependent":[173],"(variable)":[174],"was":[177],"not":[178],"covered":[179],"previous":[181],"bounds.":[186],"Finally,":[187],"user-friendly":[188],"specializations":[189],"given.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}