In probability theory, in particular in the study of stochastic processes, a stopping time (also Markov time, Markov moment, optional stopping time or optional time) is a specific type of “random time”: a random variable whose value is interpreted as the time at which a given stochastic process exhibits a certain behavior of interest. A stopping time is often defined by a stopping rule, a mechanism for deciding whether to continue or stop a process on the basis of the present position and past events, and which will almost always lead to a decision to stop at some finite time.
Stopping times occur in decision theory, and the optional stopping theorem is an important result in this context. Stopping times are also frequently applied in mathematical proofs to “tame the continuum of time”, as Chung put it in his book (1982).
- for all
Intuitively, this condition means that the "decision" of whether to stop at time must be based only on the information present at time , not on any future information.
Let be a random variable, which is defined on the filtered probability space with values in . In most cases, . Then is called a stopping time (with respect to the filtration ), if the following condition holds:
- for all
As adapted process
is adapted to the filtration
Some authors explicitly exclude cases where can be , whereas other authors allow to take any value in the closure of .
To illustrate some examples of random times that are stopping rules and some that are not, consider a gambler playing roulette with a typical house edge, starting with $100 and betting $1 on red in each game:
- Playing exactly five games corresponds to the stopping time τ = 5, and is a stopping rule.
- Playing until he either runs out of money or has played 500 games is a stopping rule.
- Playing until he is the maximum amount ahead he will ever be is not a stopping rule and does not provide a stopping time, as it requires information about the future as well as the present and past.
- Playing until he doubles his money (borrowing if necessary) is not a stopping rule, as there is a positive probability that he will never double his money.
- Playing until he either doubles his money or runs out of money is a stopping rule, even though there is potentially no limit to the number of games he plays, since the probability that he stops in a finite time is 1.
To illustrate the more general definition of stopping time, consider Brownian motion, which is a stochastic process , where each is a random variable defined on the probability space . We define a filtration on this probability space by letting be the σ-algebra generated by all the sets of the form where and is a Borel set. Intuitively, an event E is in if and only if we can determine whether E is true or false just by observing the Brownian motion from time 0 to time t.
- Every constant is (trivially) a stopping time; it corresponds to the stopping rule "stop at time ".
- Let Then is a stopping time for Brownian motion, corresponding to the stopping rule: "stop as soon as the Brownian motion exceeds the value a."
- Another stopping time is given by . It corresponds to the stopping rule "stop as soon as the Brownian motion has been positive over a contiguous stretch of length 1 time unit."
- In general, if τ1 and τ2 are stopping times on then their minimum , their maximum , and their sum τ1 + τ2 are also stopping times. (This is not true for differences and products, because these may require "looking into the future" to determine when to stop.)
Hitting times like the second example above can be important examples of stopping times. While it is relatively straightforward to show that essentially all stopping times are hitting times, it can be much more difficult to show that a certain hitting time is a stopping time. The latter types of results are known as the Début theorem.
Stopping times are frequently used to generalize certain properties of stochastic processes to situations in which the required property is satisfied in only a local sense. First, if X is a process and τ is a stopping time, then Xτ is used to denote the process X stopped at time τ.
Then, X is said to locally satisfy some property P if there exists a sequence of stopping times τn, which increases to infinity and for which the processes
satisfy property P. Common examples, with time index set I = [0, ∞), are as follows:
is a martingale for each n.
Locally integrable process. A non-negative and increasing process X is locally integrable if there exists a sequence of stopping times τn increasing to infinity, such that
for each n.
Types of stopping times
Stopping times, with time index set I = [0,∞), are often divided into one of several types depending on whether it is possible to predict when they are about to occur.
A stopping time τ is predictable if it is equal to the limit of an increasing sequence of stopping times τn satisfying τn < τ whenever τ > 0. The sequence τn is said to announce τ, and predictable stopping times are sometimes known as announceable. Examples of predictable stopping times are hitting times of continuous and adapted processes. If τ is the first time at which a continuous and real valued process X is equal to some value a, then it is announced by the sequence τn, where τn is the first time at which X is within a distance of 1/n of a.
Accessible stopping times are those that can be covered by a sequence of predictable times. That is, stopping time τ is accessible if, P(τ = τn for some n) = 1, where τn are predictable times.
A stopping time τ is totally inaccessible if it can never be announced by an increasing sequence of stopping times. Equivalently, P(τ = σ < ∞) = 0 for every predictable time σ. Examples of totally inaccessible stopping times include the jump times of Poisson processes.
Every stopping time τ can be uniquely decomposed into an accessible and totally inaccessible time. That is, there exists a unique accessible stopping time σ and totally inaccessible time υ such that τ = σ whenever σ < ∞, τ = υ whenever υ < ∞, and τ = ∞ whenever σ = υ = ∞. Note that in the statement of this decomposition result, stopping times do not have to be almost surely finite, and can equal ∞.
- Optimal stopping
- Odds algorithm
- Secretary problem
- Hitting time
- Stopped process
- Disorder problem
- Début theorem
- Kallenberg, Olav (2017). Random Measures, Theory and Applications. Probability Theory and Stochastic Modelling. 77. Switzerland: Springer. p. 347. doi:10.1007/978-3-319-41598-7. ISBN 978-3-319-41596-3.
- Fischer, Tom (2013). "On simple representations of stopping times and stopping time sigma-algebras". Statistics and Probability Letters. 83 (1): 345–349. arXiv:1112.1603. doi:10.1016/j.spl.2012.09.024.
- Thomas S. Ferguson, “Who solved the secretary problem?”, Stat. Sci. vol. 4, 282–296, (1989).
- An introduction to stopping times.
- F. Thomas Bruss, “Sum the odds to one and stop”, Annals of Probability, Vol. 4, 1384–1391,(2000)
- Chung, Kai Lai (1982). Lectures from Markov processes to Brownian motion. Grundlehren der Mathematischen Wissenschaften No. 249. New York: Springer-Verlag. ISBN 978-0-387-90618-8.
- H. Vincent Poor and Olympia Hadjiliadis (2008). Quickest Detection (First ed.). Cambridge: Cambridge University Press. ISBN 978-0-521-62104-5.
- Protter, Philip E. (2005). Stochastic integration and differential equations. Stochastic Modelling and Applied Probability No. 21 (Second edition (version 2.1, corrected third printing) ed.). Berlin: Springer-Verlag. ISBN 978-3-540-00313-7.
- Shiryaev, Albert N. (2007). Optimal Stopping Rules. Springer. ISBN 978-3-540-74010-0.