S TOCHASTIC M ODELS L ECTURE 4 B ROWNIAN M OTIONS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen) Nov 11,

Slides:



Advertisements
Similar presentations
Random Processes Introduction (2)
Advertisements

Some additional Topics. Distributions of functions of Random Variables Gamma distribution,  2 distribution, Exponential distribution.
Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Chapter 3 Brownian Motion 報告者:何俊儒.
Chapter 3 Brownian Motion 3.2 Scaled random Walks.
Hydrologic Statistics
Introduction to stochastic process
4.7 Brownian Bridge 報告者 : 劉彥君 Gaussian Process Definition 4.7.1: A Gaussian process X(t), t ≥ 0, is a stochastic process that has the property.
Time Series Basics Fin250f: Lecture 3.1 Fall 2005 Reading: Taylor, chapter
3.3 Brownian Motion 報告者:陳政岳.
Probability theory 2010 Outline  The need for transforms  Probability-generating function  Moment-generating function  Characteristic function  Applications.
Probability theory 2008 Conditional probability mass function  Discrete case  Continuous case.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
Probability theory 2010 Conditional distributions  Conditional probability:  Conditional probability mass function: Discrete case  Conditional probability.
The moment generating function of random variable X is given by Moment generating function.
Continuous Random Variables and Probability Distributions
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
第四章 Brown运动和Ito公式.
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
Intro. to Stochastic Processes
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Independence and Bernoulli.
S TOCHASTIC M ODELS L ECTURE 1 M ARKOV C HAINS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept. 9, 2015.
Lecture 9. If X is a discrete random variable, the mean (or expected value) of X is denoted μ X and defined as μ X = x 1 p 1 + x 2 p 2 + x 3 p 3 + ∙∙∙
S TOCHASTIC M ODELS L ECTURE 1 P ART II M ARKOV C HAINS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept.
MEIE811D Advanced Topics in Finance Optimum Consumption and Portfolio Rules in a Continuous-Time Model Yuna Rhee Seyong Park Robert C. Merton (1971) [Journal.
Random Numbers and Simulation  Generating truly random numbers is not possible Programs have been developed to generate pseudo-random numbers Programs.
1 Lecture 7: Discrete Random Variables and their Distributions Devore, Ch
Stochastic Models Lecture 2 Poisson Processes
DISCRETE PROBABILITY DISTRIBUTIONS
1.3 Simulations and Experimental Probability (Textbook Section 4.1)
 { X n : n =0, 1, 2,...} is a discrete time stochastic process Markov Chains.
Expectation. Let X denote a discrete random variable with probability function p(x) (probability density function f(x) if X is continuous) then the expected.
S TOCHASTIC M ODELS L ECTURE 3 P ART II C ONTINUOUS -T IME M ARKOV P ROCESSES Nan Chen MSc Program in Financial Engineering The Chinese University of Hong.
S TOCHASTIC M ODELS L ECTURE 2 P ART II P OISSON P ROCESSES Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen)
Chapter 2. Conditional Probability Weiqi Luo ( 骆伟祺 ) School of Data & Computer Science Sun Yat-Sen University :
S TOCHASTIC M ODELS L ECTURE 5 P ART II S TOCHASTIC C ALCULUS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen)
CONTINUOUS RANDOM VARIABLES
Stochastic Models Lecture 3 Continuous-Time Markov Processes
S TOCHASTIC M ODELS L ECTURE 4 P ART II B ROWNIAN M OTIONS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen)
Probability Theory Modelling random phenomena. Permutations the number of ways that you can order n objects is: n! = n(n-1)(n-2)(n-3)…(3)(2)(1) Definition:
Lab for Remote Sensing Hydrology and Spatial Modeling Dept of Bioenvironmental Systems Engineering National Taiwan University 1/45 GEOSTATISTICS INTRODUCTION.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
3.6 First Passage Time Distribution
Functions of Random Variables
Central Limit Theorem Let X 1, X 2, …, X n be n independent, identically distributed random variables with mean  and standard deviation . For large n:
S TOCHASTIC M ODELS L ECTURE 4 P ART III B ROWNIAN M OTION Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen)
S TOCHASTIC M ODELS L ECTURE 5 S TOCHASTIC C ALCULUS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen) Nov 25,
1 Chapter 4 Mathematical Expectation  4.1 Mean of Random Variables  4.2 Variance and Covariance  4.3 Means and Variances of Linear Combinations of Random.
Sampling and Sampling Distributions. Sampling Distribution Basics Sample statistics (the mean and standard deviation are examples) vary from sample to.
4.3 Probability Distributions of Continuous Random Variables: For any continuous r. v. X, there exists a function f(x), called the density function of.
Let E denote some event. Define a random variable X by Computing probabilities by conditioning.
CHAPTER 6 Random Variables
Lecture 3 B Maysaa ELmahi.
Theory of Capital Markets
水分子不時受撞,跳格子(c.p. 車行) 投骰子 (最穩定) 股票 (價格是不穏定,但報酬過程略穩定) 地震的次數 (不穩定)
4.3 Probability Distributions of Continuous Random Variables:
STATISTICS Random Variables and Distribution Functions
Lecture 13 Sections 5.4 – 5.6 Objectives:
Mathematical Finance An Introduction
Brownian Motion for Financial Engineers
STOCHASTIC HYDROLOGY Random Processes
Brownian Motion & Itô Formula
4.3 Probability Distributions of Continuous Random Variables:
Random WALK, BROWNIAN MOTION and SDEs
Chapter 3 Brownian Motion 洪敏誠 2009/07/31 /23.
Further Topics on Random Variables: Derived Distributions
Further Topics on Random Variables: Derived Distributions
Further Topics on Random Variables: Derived Distributions
Presentation transcript:

S TOCHASTIC M ODELS L ECTURE 4 B ROWNIAN M OTIONS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen) Nov 11, 2015

Outline 1.Martingale Theory 2.Definition of Brownian Motions 3.Hitting Times and Maximum Variable

4.1 B ASIC M ARTINGALE T HEORY

A Motivating Example A gambler plays a game repeatedly. At each play he wins $1 with prob. 50%, and loses $1 with prob. 50%. The plays are independent of each other. Let be the outcome of each play and what is the value of the following conditional expectation?

Martingales A stochastic process is said to be a martingale process if A martingale can be viewed as a generalized version of a fair game. We have

Example I: Product of Random Numbers Let be a sequence of independent random variables with Then, is a martingale.

Example II: Branching Process Consider a branching process (See Section 1.7) and let denote the size of the nth generation. If is the mean number of offspring per individual, then is a martingale when

Stopping Times The positive integer-valued (possibly infinite) random variable is said to be a stopping time for a process if the occurrence of event is determined by the value of

Example III: Hitting Time of a Process Consider a process Let i.e., is the first time that the value of the process is larger than or equal to Then, such is a stopping time.

Example IV: Maximum Time Consider the above process again. But, let i.e., is the first time that the process reaches the largest value of Is a stopping time?

Martingale Stopping Theorem Theorem: If either – is bounded, or; – is bounded, then

Example V: Gambler Ruin’s Problem Revisited Consider an individual who starts at position and at each step either moves 1 position to the right with probability 0.5 or 1 position to the left with probability 0.5 Assume that the successive movements are independent. Suppose that he will stop moving when he reaches either or What is the probability that he stops at

Example VI: Expected Number of Steps Consider the preceding example. We calculated the expected number of steps this individual takes to reach or in Exercise 59 of Chapter 1. Here we can use the martingale stopping theorem to derive the same result.

Example VII: Unfair Games Now suppose that the individual moves to his right with a higher probability. That is, let with Let Verify that is a martingale. Using it and the martingale stopping theorem, we can compute the probability that he reaches earlier than

4.2 D EFINITION OF B ROWNIAN M OTION

Symmetric Random Walk We know that the symmetric random walk can be represented by with being a sequence of independent random variables whose distribution is given by

Symmetric Random Walk as Markov and Martingale Process The symmetric random walk is not only a Markov process but also a martingale process.

Independent and Stationary Increments Take a sequence of integers: Then, are independent (independent increments). Furthermore, the distribution of does not depend on (stationary increments).

Scaled Random Walk Now, let us rescale time and space for the random walk model, speeding up this process by taking smaller and smaller steps in smaller and smaller time intervals. That is, let

Mean and Variance of Scaled Random Walk Mean Variance:

Limits of Scaled Random Walk We now let and go to in a way such that Un-scaled RWScaled RW

Limits of Scaled Random Walk (Continued) Based on the central limit theorem, we have

Brownian Motion A stochastic process is said to be a Brownian motion process if – – it has stationary and independent increments – for every is normally distributed with mean 0 and variance

Brownian Motion as Markov and Martingale Process The independent increment assumption implies that Brownian motion is a Markov process: It also implies that Brownian motion is a martingale:

Covariance of Brownian Motion Covariance: if

Example VIII: Brownian Motion For compute

4.3 H ITTING T IMES AND M AXIMUM V ARIABLES

Distribution of Hitting Time Let be the first time the Brownian motion process hits a level We intend to derive the probability of based on the following observations: –

Distribution of Hitting Time We can see that which implies that the probability density function of is

Maximum Value of a Brownian Motion For

Example IX: Hitting Probability of Brownian Motion Note that Brownian motion is a martingale process. We still can use the martingale stopping theorem to compute where is the first time the Brownian motion hits or