TY  - JOUR
A1  - Kötzing, Timo
A1  - Krejca, Martin Stefan
T1  - First-hitting times under drift
JF  - Theoretical computer science
N2  - For the last ten years, almost every theoretical result concerning the expected run time of a randomized search heuristic used drift theory, making it the arguably most important tool in this domain. Its success is due to its ease of use and its powerful result: drift theory allows the user to derive bounds on the expected first-hitting time of a random process by bounding expected local changes of the process - the drift. This is usually far easier than bounding the expected first-hitting time directly. Due to the widespread use of drift theory, it is of utmost importance to have the best drift theorems possible. We improve the fundamental additive, multiplicative, and variable drift theorems by stating them in a form as general as possible and providing examples of why the restrictions we keep are still necessary. Our additive drift theorem for upper bounds only requires the process to be lower-bounded, that is, we remove unnecessary restrictions like a finite, discrete, or bounded state space. As corollaries, the same is true for our upper bounds in the case of variable and multiplicative drift. By bounding the step size of the process, we derive new lower-bounding multiplicative and variable drift theorems. Last, we also state theorems that are applicable when the process has a drift of 0, by using a drift on the variance of the process.
KW  - First-hitting time
KW  - Random process
KW  - Drift
Y1  - 2019
U6  - https://doi.org/10.1016/j.tcs.2019.08.021
SN  - 0304-3975
SN  - 1879-2294
VL  - 796
SP  - 51
EP  - 69
PB  - Elsevier
CY  - Amsterdam
ER  -