Reflection principle (Wiener process)

Simulation of Wiener process (black curve). When the process reaches the crossing point at a=50 at t≈3000, both the original process and its reflection (red curve) about the a=50 line (blue line) are shown. After the crossing point, both black and red curves have the same distribution.

In the theory of probability for stochastic processes, the reflection principle for a Wiener process states that if the path of a Wiener process f(t) reaches a value f(s) = a at time t = s, then the subsequent path after time s has the same distribution as the reflection of the subsequent path about the value a.[1] More formally, the reflection principle refers to a lemma concerning the distribution of the supremum of the Wiener process, or Brownian motion. The result relates the distribution of the supremum of Brownian motion up to time t to the distribution of the process at time t. It is a corollary of the strong Markov property of Brownian motion.

## Contents

* 1 Statement
* 2 Proof
* 3 Consequences
* 4 References

## Statement

If (W(t):t≥0) is a Wiener process, and a>0 is a threshold (also called a crossing point), then the lemma states:

ℙ(sup0≤s≤tW(s)≥a)=2ℙ(W(t)≥a)

Assuming W(0)=0 , due to the continuity of Wiener processes, each path (one sampled realization) of Wiener process on (0,t) which finishes at or above value/level/threshold/crossing point a the time t ( W(t)≥a ) must have crossed (reached) a threshold a ( W(ta)=a ) at some earlier time ta≤t for the first time . (It can cross level a multiple times on the interval (0,t), we take the earliest.)

For every such path, you can define another path W′(t) on (0,t) that is reflected or vertically flipped on the sub-interval (ta,t) symmetrically around level a from the original path. These reflected paths are also samples of the Wiener process reaching value W′(ta)=a on the interval (0,t), but finish below a. Thus, of all the paths that reach a on the interval (0,t), half will finish below a, and half will finish above. Hence, the probability of finishing above a is half that of reaching a.

In a stronger form, the reflection principle says that if τ is a stopping time then the reflection of the Wiener process starting at τ, denoted (Wτ(t):t≥0), is also a Wiener process, where:

Wτ(t)=W(t)χ{t≤τ}+(2W(τ)−W(t))χ{t>τ}

and the indicator function χ{t≤τ}={1,if t≤τ0,otherwise and χ{t>τ}is defined similarly. The stronger form implies the original lemma by choosing τ=inf⁡{t≥0:W(t)=a}.

## Proof

The earliest stopping time for reaching crossing point a, τa:=inf⁡{t:W(t)=a}, is an almost surely bounded stopping time. Then we can apply the strong Markov property to deduce that a relative path subsequent to τa, given by Xt:=W(t+τa)−a, is also simple Brownian motion independent of ℱτaW. Then the probability distribution for the last time W(s) is at or above the threshold a in the time interval [0,t] can be decomposed as

ℙ(sup0≤s≤tW(s)≥a)=ℙ(sup0≤s≤tW(s)≥a,W(t)≥a)+ℙ(sup0≤s≤tW(s)≥a,W(t)<a)=ℙ(W(t)≥a)+ℙ(sup0≤s≤tW(s)≥a,X(t−τa)<0).

By the tower property for conditional expectations, the second term reduces to:

ℙ(sup0≤s≤tW(s)≥a,X(t−τa)<0)=𝔼[ℙ(sup0≤s≤tW(s)≥a,X(t−τa)<0|ℱτaW)]=𝔼[χsup0≤s≤tW(s)≥aℙ(X(t−τa)<0|ℱτaW)]=12ℙ(sup0≤s≤tW(s)≥a),

since X(t) is a standard Brownian motion independent of ℱτaW and has probability 1/2 of being less than 0. The proof of the lemma is completed by substituting this into the second line of the first equation.[2]

ℙ(sup0≤s≤tW(s)≥a)=ℙ(W(t)≥a)+12ℙ(sup0≤s≤tW(s)≥a)ℙ(sup0≤s≤tW(s)≥a)=2ℙ(W(t)≥a).

## Consequences

The reflection principle is often used to simplify distributional properties of Brownian motion. Considering Brownian motion on the restricted interval (W(t):t∈[0,1]) then the reflection principle allows us to prove that the location of the maxima tmax, satisfying W(tmax)=sup0≤s≤1W(s), has the arcsine distribution. This is one of the Lévy arcsine laws.[3]

## References

1. ↑ Jacobs, Kurt (2010). Stochastic Processes for Physicists. Cambridge University Press. pp. 57–59. ISBN 9781139486798. https://books.google.com/books?id=bx8yN2IfE8kC&q=reflection+principle+wiener+process&pg=PA57.
2. ↑ Mörters, P.; Peres,Y. (2010) Brownian Motion, CUP. ISBN 978-0-521-76018-8
3. ↑ Lévy, Paul (1940). "Sur certains processus stochastiques homogènes". Compositio Mathematica 7: 283–339. http://www.numdam.org/item?id=CM_1940__7__283_0. Retrieved 15 February 2013.

* v
* t
* e

Stochastic processes

Discrete time|

* Bernoulli process
* Branching process
* Chinese restaurant process
* Galton–Watson process
* Independent and identically distributed random variables
* Markov chain
* Moran process
* Random walk
* Loop-erased
* Self-avoiding
* Biased
* Maximal entropy

Continuous time|

* Bessel process
* Birth–death process
* Brownian motion
* Bridge
* Excursion
* Fractional
* Geometric
* Meander
* Cauchy process
* Contact process
* Continuous-time random walk
* Cox process
* Diffusion process
* Empirical process
* Feller process
* Fleming–Viot process
* Gamma process
* Geometric process
* Hunt process
* Interacting particle systems
* Itô diffusion
* Itô process
* Jump diffusion
* Jump process
* Lévy process
* Local time
* Markov additive process
* McKean–Vlasov process
* Ornstein–Uhlenbeck process
* Poisson process
* Compound
* Non-homogeneous
* Point process
* Schramm–Loewner evolution
* Semimartingale
* Sigma-martingale
* Stable process
* Superprocess
* Telegraph process
* Variance gamma process
* Wiener process
* Wiener sausage

Both|

* Branching process
* Galves–Löcherbach model
* Gaussian process
* Hidden Markov model (HMM)
* Markov process
* Martingale
* Differences
* Local
* Sub-
* Super-
* Random dynamical system
* Regenerative process
* Renewal process
* Stochastic chains with memory of variable length
* White noise

Fields and other|

* Dirichlet process
* Gaussian random field
* Gibbs measure
* Hopfield model
* Ising model
* Potts model
* Boolean network
* Markov random field
* Percolation
* Pitman–Yor process
* Point process
* Cox
* Poisson
* Random field
* Random graph

Time series models|

* Autoregressive conditional heteroskedasticity (ARCH) model
* Autoregressive integrated moving average (ARIMA) model
* Autoregressive (AR) model
* Autoregressive–moving-average (ARMA) model
* Generalized autoregressive conditional heteroskedasticity (GARCH) model
* Moving-average (MA) model

Financial models|

* Black–Derman–Toy
* Black–Karasinski
* Black–Scholes
* Chen
* Constant elasticity of variance (CEV)
* Cox–Ingersoll–Ross (CIR)
* Garman–Kohlhagen
* Heath–Jarrow–Morton (HJM)
* Heston
* Ho–Lee
* Hull–White
* LIBOR market
* Rendleman–Bartter
* SABR volatility
* Vašíček
* Wilkie

Actuarial models|

* Bühlmann
* Cramér–Lundberg
* Risk process
* Sparre–Anderson

Queueing models|

* Bulk
* Fluid
* Generalized queueing network
* M/G/1
* M/M/1
* M/M/c

Properties|

* Càdlàg paths
* Continuous
* Continuous paths
* Ergodic
* Exchangeable
* Feller-continuous
* Gauss–Markov
* Markov
* Mixing
* Piecewise deterministic
* Predictable
* Progressively measurable
* Self-similar
* Stationary
* Time-reversible

Limit theorems|

* Central limit theorem
* Donsker's theorem
* Doob's martingale convergence theorems
* Ergodic theorem
* Fisher–Tippett–Gnedenko theorem
* Large deviation principle
* Law of large numbers (weak/strong)
* Law of the iterated logarithm
* Maximal ergodic theorem
* Sanov's theorem

Inequalities|

* Burkholder–Davis–Gundy
* Doob's martingale
* Kunita–Watanabe

Tools|

* Cameron–Martin formula
* Convergence of random variables
* Doléans-Dade exponential
* Doob decomposition theorem
* Doob–Meyer decomposition theorem
* Doob's optional stopping theorem
* Dynkin's formula
* Feynman–Kac formula
* Filtration
* Girsanov theorem
* Infinitesimal generator
* Itô integral
* Itô's lemma
* Karhunen–Loève_theorem
* Kolmogorov continuity theorem
* Kolmogorov extension theorem
* Lévy–Prokhorov metric
* Malliavin calculus
* Martingale representation theorem
* Optional stopping theorem
* Prokhorov's theorem
* Quadratic variation
* Reflection principle
* Skorokhod integral
* Skorokhod's representation theorem
* Skorokhod space
* Snell envelope
* Stochastic differential equation
* Tanaka
* Stopping time
* Stratonovich integral
* Uniform integrability
* Usual hypotheses
* Wiener space
* Classical
* Abstract

Disciplines|

* Actuarial mathematics
* Econometrics
* Ergodic theory
* Extreme value theory (EVT)
* Large deviations theory
* Mathematical finance
* Mathematical statistics
* Probability theory
* Queueing theory
* Renewal theory
* Ruin theory
* Statistics
* System on Chip design
* Stochastic analysis
* Time series analysis
* Machine learning

* List of topics
* Category

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Reflection principle (Wiener process). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Reflection_principle_(Wiener_process)&oldid=233501"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template