Concentration of first hitting times under additive drift

摘要: Recent advances in drift analysis have given us better and tools for understanding random processes, including the run time of randomized search heuristics. In setting multiplicative we do not only excellent bounds on expected time, but also more general results showing concentration}of time. this paper investigate additive under assumption strong concentration "step size" process. Under sufficiently towards goal show a hitting contrast to this, that presence small Gambler's-Ruin-like behavior process overrides influence drift. Finally, negative is superpolynomial with high probability; corresponds so-called theorem, which give new variants.