Views
9 months ago

# stochastic-I-ST

Copyright c○ 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n ≥ 0}, a random time τ is a discrete random variable on the same probability space as X, taking values in the time set IN = {0, 1, 2, . . .}. X τ denotes the state at the random time τ; if τ = n, then X τ = X n . If we were to observe the values X 0 , X 1 , . . ., sequentially in time and then “stop” doing so right after some time n, basing our decision to stop on (at most) only what we have seen thus far, then we have the essence of a stopping time. The basic feature is that we do not know the future hence can’t base our decision to stop now on knowing the future. To make this precise, let the total information known up to time n, for any given n ≥ 0, be defined as all the information (events) contained in {X 0 , . . . , X n }. For example, events of the form {X 0 ∈ A 0 , X 1 ∈ A 1 , . . . , X n ∈ A n }, where the A i ⊂ S are subsets of the state space. Definition 1.1 Let X = {X n : n ≥ 0} be a stochastic process. A stopping time with respect to X is a random time such that for each n ≥ 0, the event {τ = n} is completely determined by (at most) the total information known up to time n, {X 0 , . . . , X n }. In the context of gambling, in which X n denotes our total earnings after the n th gamble, a stopping time τ is thus a rule that tells us at what time to stop gambling. Our decision to stop after a given gamble can only depend (at most) on the “information” known at that time (not on future information). If X n denotes the price of a stock at time n and τ denotes the time at which we will sell the stock (or buy the stock), then our decision to sell (or buy) the stock at a given time can only depend on the information known at that time (not on future information). The time at which one might exercise an option is yet again another example. Remark 1.1 All of this can be defined analogously for a sequence {X 1 , X 2 , . . .} in which time is strictly positive; n = 1, 2, . . ..: τ is a stopping time with respect to this sequence if {τ = n} is completely determined by (at most) the total information known up to time n, {X 1 , . . . , X n }. 1.2 Examples 1. (First passage/hitting times/Gambler’s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let τ = min{n ≥ 0 : X n = i}. This is called the first passage time of the process into state i. Also called the hitting time of the process to state i. More generally we can let A be a collection of states such as A = {2, 3, 9} or A={2, 4, 6, 8, . . .}, and then τ is the first passage time (hitting time) into the set A: τ = min{n ≥ 0 : X n ∈ A}. As a special case we can consider the time at which the gambler stops in the gambler’s ruin problem; the gambling stops when either X n = N or X n = 0 whichever happens first; the first passage time to the set A = {0, N}. Proving that hitting times are stopping times is simple: 1

Definition
A < B - TAMU Computer Science Faculty Pages
Discrete Time Stochastic Processes
Stochastic analysis I
Asymptotics of the solutions of the stochastic lattice wave equation
The infinite valley for a recurrent random walk in random environment
ON DISCRETIZATION SCHEMES FOR STOCHASTIC EVOLUTION ...
Solutions of Stochastic Differential Equations obeying the Law of the ...
Markov solutions for the 3D stochastic NavierâStokes equations with ...
Lectures on Stochastic Processes - Tata Institute of Fundamental ...
ON DISCRETIZATION SCHEMES FOR STOCHASTIC EVOLUTION ...
Degenerate Parabolic Stochastic Partial Differential Equations
Kolmogorov equation associated to the stochastic reflection problem ...
Explosion, implosion, and moments of passage times for continuous ...
Virginia Tech Regional Mathematics Contest-solution.pdf
Stochastic Processes
Math 55: Discrete Mathematics
F A S C I C U L I M A T H E M A T I C I
The periodic problem for curvature-like equations with asymmetric ...
Fall 08, IEOR 263A Homework 11 Solutions 1. The equation Ï = Ï P ...
Real Analysis Homework 2 Solutions 7. Let X be a metric space and ...
arXiv:1208.5675v1 [math.PR] 28 Aug 2012 - IMPA
F A S C I C U L I M A T H E M A T I C I
Assignment 2 for Stochastic Calculus
LECTURE NOTES ON STOCHASTIC PROCESSES
Holonomic Closure Properties and Guessing - RISC - JKU
Rosen, 5.4 Binomial Coefficients
STOCHASTIC COMPARISON OF THE FIRST PASSAGE TIME ...
I Integral Equations and Operator Theory
A stochastic model for order book dynamics