Probabilistic Search with Overrides

Abstract
Consider a time-inhomogeneous Markov chain which converges in probability to a subset S-0 of its state space. Override the standard move mechanism up to a random transition time, almost surely finite, but not necessarily a stopping time. Under weak conditions, the modified process converges in probability to the same set S-0. Two examples of independent interest illustrate this result.

This publication has 0 references indexed in Scilit: