Stochastic Processes Calcul stochastique. Geneviève Gauthier. HEC Montréal. Stochastic processes. Stochastic processes.
|
|
- Alexis Walsh
- 5 years ago
- Views:
Transcription
1 Processes Calcul stochastique Geneviève Gauthier HEC Montréal
2 Let (Ω, F) be a measurable space. A stochastic process X = fx t : t 2 T g is a family of random variables, all built on the same measurable space (Ω, F) where T represents a set of indices.
3 s I s A family F = ff t : t 2 T g of σ algebras on Ω is a ltration on the measurable space (Ω, F) if (F 1) 8t 2 T, F t F, (F 2) 8t 1, t 2 2 T such that t 1 t 2, F t1 F t2. A stochastic process X = fx t : t 2 T g is said to be adapted to the ltration F = ff t : t 2 T g if 8t 2 T, X t is F t measurable.
4 II s s The ltration F = ff t : t 2 T g is said to be generated by the stochastic process X = fx t : t 2 T g if 8t 2 T, F t = σ fx s : s 2 T, s tg.
5 s I 1. Let s assume that the sample space is Ω = fω 1, ω 2, ω 3, ω 4 g and that T = f0, 1, 2, 3g. The stochastic process X = fx t : t 2 f0, 1, 2, 3gg represents the evolution of a stock price, X t = the stock price at close of market on the t th day, while time t = 0 represents today. ω X 0 (ω) X 1 (ω) X 2 (ω) X 3 (ω) ω 1 1 0, , 50 ω 2 1 0, , 50 ω ω
6 II s Question. What is the ltration generated by this stochastic process?
7 s III ω X 0 (ω) X 1 (ω) X 2 (ω) X 3 (ω) ω 1 1 0, , 50 ω 2 1 0, , 50 ω ω Answer. F 0 = σ fx 0 g = f?, Ωg, F 1 = σ fx 0, X 1 g = σ ffω 1, ω 2 g, fω 3, ω 4 gg, F 2 = σ fx 0, X 1, X 2 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg, F 3 = σ fx 0, X 1, X 2, X 3 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg. Note that any σ algebra F containing the sub-σ algebra F 3 make X 0, X 1, X 2 and X 3 F measurable.
8 s Recall that F 0 = σ fx 0 g = f?, Ωg, IV F 1 = σ fx 0, X 1 g = σ ffω 1, ω 2 g, fω 3, ω 4 gg, F 2 = σ fx 0, X 1, X 2 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg, F 3 = σ fx 0, X 1, X 2, X 3 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg. Interpretation. Ω represents states of nature. X t (ω i ) represents the stock price at time t if it is the i i th state of nature that has occurred. At time 0 (today), we know with certitude the stock price and we cannot identify which of the states of nature has occurred. That s why the sub-σ algebra F 0 is the trivial σ algebra, since it doesn t contain any information.
9 s Recall that V F 1 = σ fx 0, X 1 g = σ ffω 1, ω 2 g, fω 3, ω 4 gg. 1 At time t = 1, we know a bit more. Indeed, if we observe a stock price of 0.50, then we know that the state of nature that has occurred is ω 1 or ω 2 but certainly not ω 3 or ω 4. As a result, we can deduce that the stock price for the following two periods (t = 2 and t = 3) will be 1 and 0.50 dollar respectively. 2 On the contrary, if at time t = 1, we observe a stock price of 2 dollars, then we know that the state of nature that has occurred is either ω 3 or ω 4. We can deduce from there that the stock price won t fall back under the one-dollar level: because, after observing the process at time t = 1, we ll be able to determine whether event fω 1, ω 2 g or event fω 3, ω 4 g has happened, F 1 = σ ffω 1, ω 2 g, fω 3, ω 4 gg.
10 s Recall that VI F 2 = σ fx 0, X 1, X 2 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg. Let s now assume that in time t = 2, we observe a price of one dollar. A frequently made mistake is to conclude that the sub-σ algebra associated with that time is σ ffω 1, ω 2, ω 3 g, fω 4 gg since by observing X 2 we are able to distinguish between the events fω 1, ω 2, ω 3 g and fω 4 g. That would be true if we were just beginning to observe the process, which is not the case. We must take into account the information obtained since time t = 0. But the paths (X 0 (ω), X 1 (ω), X 2 (ω)) enable us to distinguish between the three following events: fω 1, ω 2 g, fω 3 g and fω 4 g. Indeed, after observing the prices until time two, we will know with certitude which state of nature ω has occurred, unless we have observed path (1, 2 1, 1), in which case we ll be unable to distinguish between states of nature ω 1 and ω 2. 1 Throughout this chapter, we go further into an example initiated in Calculus, A Tool for Finance by Daniel Dufresne.
11 Introduction We will realize how very useful the concept of stopping time is when we will attempt to price American-style derivative products. The main role of stopping times is to help determine the time when the option holder will exercise his or her right.
12 Let (Ω, F) be a measurable space such that Card (Ω) < and equipped with the ltration F = ff t : t 2 f0, 1,...gg. A stopping time τ is a (Ω, F) random variable that takes its values in f0, 1,...g and is such that fω 2 Ω : τ (ω) tg 2 F t for all t 2 f0, 1,...g. (1) Exercise. Show that the condition (1) above is equivalent to fω 2 Ω : τ (ω) = tg 2 F t for all t 2 f0, 1,...g.
13 I. Let s return to the example described earlier: X represents a stock price. ω X 0 (ω) X 1 (ω) X 2 (ω) X 3 (ω) ω 1 1 0, , 50 ω 2 1 0, , 50 ω ω
14 II We had determined that the ltration containing the information revealed by the process at each time is F 0 = σ fx 0 g = f?, Ωg, F 1 = σ fx 0, X 1 g = σ ffω 1, ω 2 g, fω 3, ω 4 gg, F 2 = σ fx 0, X 1, X 2 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg, F 3 = σ fx 0, X 1, X 2, X 3 g = σ ffω 1, ω 2 g, fω 3 g, fω 4 gg.
15 Recall that: III ω X 0 (ω) X 1 (ω) X 2 (ω) X 3 (ω) ω 1 1 0, , 50 ω 2 1 0, , 50 ω ω We won t sell our stocks today (t = 0) but we will sell them as soon as the price is greater than or equal to 1. The random time representing that situation is τ (ω 1 ) = 2, τ (ω 2 ) = 2, τ (ω 3 ) = 1 and τ (ω 4 ) = 1.
16 IV Such a random variable truly is a stopping time since fω 2 Ω : τ (ω) = 0g =? 2 F 0, fω 2 Ω : τ (ω) = 1g = fω 3, ω 4 g 2 F 1, fω 2 Ω : τ (ω) = 2g = fω 1, ω 2 g 2 F 2, fω 2 Ω : τ (ω) = 3g =? 2 F 3.
17 Recall that: V ω X 0 (ω) X 1 (ω) X 2 (ω) X 3 (ω) ω 1 1 0, , 50 ω 2 1 0, , 50 ω ω Let s now consider the random time τ modelling the following situation: we ll buy stock as soon as it enables us to make a pro t later. Such a random value takes values τ (ω 1 ) = 1, τ (ω 2 ) = 1, τ (ω 3 ) = 0 and τ (ω 4 ) = 0. τ is not a stopping time since fω 2 Ω : τ (ω) = 0g = fω 3, ω 4 g /2 F 0.
18 VI Intuitively, the time τ when one makes a decision is a stopping time if the decision is made based on the information available at that time. In the case of stopping times, using a crystal ball is prohibited.
19 I transformation Theorem Let (Ω, F), be a measurable space such that Card (Ω) < and equipped with the ltration F = ff t : t 2 f0, 1,...gg. If the random variables τ 1 and τ 2 are stopping times with respect to the ltration F, then τ 1 ^ τ 2 min fτ 1, τ 2 g and τ 1 _ τ 2 max fτ 1, τ 2 g are also stopping times.
20 II transformation Proof of the theorem. If τ is a stopping time, then 8t 2 f0, 1,...g 8k 2 f0, 1,...g, fω 2 Ω : τ (ω) tg 2 F t. fω 2 Ω : τ 1 (ω) ^ τ 2 (ω) kg = fω 2 Ω : τ 1 (ω) k or τ 2 (ω) kg = fω 2 Ω : τ 1 (ω) kg {z } 2F k 2 F k. Exercise. Prove the above result for τ 1 _ τ 2. [ fω 2 Ω : τ 2 (ω) kg {z } 2F k
21 I time Let (Ω, F) be a measurable space such that Card (Ω) < and equipped with the ltration F = ff t : t 2 f0, 1,...gg. X = fx t : t 2 f0, 1,...gg represents a stochastic process adapted to that ltration. Let B R a subset of the real numbers. We de ne the time until the stochastic process X rst enters the set B as τ B (ω) = min ft 2 f0, 1,...g : X t (ω) 2 Bg. If it happened that the path t! X t (ω) never hits the set B then we de ne τ B (ω) =.
22 II time Theorem The random variable τ B is a stopping time. Proof of the theorem. Since Card (Ω) <, then 8t 2 f0, 1,...g, X t can only take a nite number of values. Let s denote them by x (t) 1 <... < x (t) m t. 8t 2 f0, 1,...g,
23 fω 2 Ω : τ B (ω) = tg III time = fω 2 Ω : X 0 (ω) /2 B,..., X t 1 (ω) /2 B, X t (ω) 2 Bg! = = t 1 \ fω 2 Ω : X k (ω) /2 Bg k=0 0 t B \ 1 [ k=0 x (k) i /2B 0 B [ n 2 F t x (t) i 2B ω 2 Ω : X k (ω) = x (k) i ω 2 Ω : X t (ω) = x (t) i \ fω 2 Ω : X t (ω) 2 Bg 1 o C A 1 o C A
24 IV time since t\ 1 [ n ω 2 Ω : X k (ω) = x (k) o i k=0 x (k) i /2B {z } 2F k since X is adapted. {z } 2F k F t since F k is a σ algebra {z } 2F t since F t is a σ algebra. \ [ n ω 2 Ω : X t (ω) = x (t) o i x (t) i 2B {z } 2F t since X t is F t measurable. {z } 2F t since F t is a σ algebra.
25 BILLINGSLEY, Patrick (1986). Probability and Measure, Second Edition, Wiley, New York. DUFRESNE, Daniel (1996). Calculus, A Tool for Finance, Department of Mathematics and Statistics, Université de Montréal. KARLIN Samuel and TAYLOR Howard M. (1975). A First Course in Processes, Second Edition, Academic Press, New York.
Snell envelope and the pricing of American-style contingent claims
Snell envelope and the pricing of -style contingent claims 80-646-08 Stochastic calculus I Geneviève Gauthier HEC Montréal Notation The The riskless security Market model The following text draws heavily
More informationStochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier.
Ito 8-646-8 Calculus I Geneviève Gauthier HEC Montréal Riemann Ito The Ito The theories of stochastic and stochastic di erential equations have initially been developed by Kiyosi Ito around 194 (one of
More informationDiscrete-Time Market Models
Discrete-Time Market Models 80-646-08 Stochastic Calculus I Geneviève Gauthier HEC Montréal I We will study in depth Section 2: The Finite Theory in the article Martingales, Stochastic Integrals and Continuous
More informationStochastic Processes
Stochastic Processes A very simple introduction Péter Medvegyev 2009, January Medvegyev (CEU) Stochastic Processes 2009, January 1 / 54 Summary from measure theory De nition (X, A) is a measurable space
More informationThe main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market model.
1 2. Option pricing in a nite market model (February 14, 2012) 1 Introduction The main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market
More informationStochastic processes and stopping time Exercises
Stochastic processes and stopping time Exercises Exercise 2.1. Today is Monday and you have one dollar in your piggy bank. Starting tomorrow, every morning until Friday (inclusively), you toss a coin.
More informationConditional Expectation and Independence Exercises
Conditional Expectation and Independence Exercises Exercise 3.1. Show the four following properties : for any random variables and Y and for any real numbers a and b, (E1) E P [a + by ] = ae P [] + be
More information1 The Well Ordering Principle, Induction, and Equivalence Relations
1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number
More informationStochastic Processes
Introduction and Techniques Lecture 4 in Financial Mathematics UiO-STK4510 Autumn 2015 Teacher: S. Ortiz-Latorre Stochastic Processes 1 Stochastic Processes De nition 1 Let (E; E) be a measurable space
More informationRandom Times and Their Properties
Chapter 6 Random Times and Their Properties Section 6.1 recalls the definition of a filtration (a growing collection of σ-fields) and of stopping times (basically, measurable random times). Section 6.2
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 7 9/25/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 7 9/5/013 The Reflection Principle. The Distribution of the Maximum. Brownian motion with drift Content. 1. Quick intro to stopping times.
More informationDifferential Forms. Introduction
ifferential Forms A 305 Kurt Bryan Aesthetic pleasure needs no justification, because a life without such pleasure is one not worth living. ana Gioia, Can Poetry atter? Introduction We ve hit the big three
More informationAn Option Value Problem from Seinfeld
An Option Value Problem from Seinfeld by Avinash Dixit, Princeton University June 12, 2010 This is a paper about nothing. Abstract 1 Introduction In an episode of the sitcom Seinfeld, Elaine Benes uses
More informationLecture 12. F o s, (1.1) F t := s>t
Lecture 12 1 Brownian motion: the Markov property Let C := C(0, ), R) be the space of continuous functions mapping from 0, ) to R, in which a Brownian motion (B t ) t 0 almost surely takes its value. Let
More informationLecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.
Lecture 2 1 Martingales We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. 1.1 Doob s inequality We have the following maximal
More informationOffice hours: Wednesdays 11 AM- 12 PM (this class preference), Mondays 2 PM - 3 PM (free-for-all), Wednesdays 3 PM - 4 PM (DE class preference)
Review of Probability Theory Tuesday, September 06, 2011 2:05 PM Office hours: Wednesdays 11 AM- 12 PM (this class preference), Mondays 2 PM - 3 PM (free-for-all), Wednesdays 3 PM - 4 PM (DE class preference)
More informationMATH 1101 Exam 1 Review. Spring 2018
MATH 1101 Exam 1 Review Spring 2018 Topics Covered Section 2.1 Functions in the Real World Section 2.2 Describing the Behavior of Functions Section 2.3 Representing Functions Symbolically Section 2.4 Mathematical
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationCLASS NOTES: BUSINESS CALCULUS
CLASS NOTES: BUSINESS CALCULUS These notes can be thought of as the logical skeleton of my lectures, although they will generally contain a fuller exposition of concepts but fewer examples than my lectures.
More informationLet (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t
2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition
More informationEssential Question: What is a complex number, and how can you add, subtract, and multiply complex numbers? Explore Exploring Operations Involving
Locker LESSON 3. Complex Numbers Name Class Date 3. Complex Numbers Common Core Math Standards The student is expected to: N-CN. Use the relation i = 1 and the commutative, associative, and distributive
More informationMATH MW Elementary Probability Course Notes Part I: Models and Counting
MATH 2030 3.00MW Elementary Probability Course Notes Part I: Models and Counting Tom Salisbury salt@yorku.ca York University Winter 2010 Introduction [Jan 5] Probability: the mathematics used for Statistics
More information1 Selected Homework Solutions
Selected Homework Solutions Mathematics 4600 A. Bathi Kasturiarachi September 2006. Selected Solutions to HW # HW #: (.) 5, 7, 8, 0; (.2):, 2 ; (.4): ; (.5): 3 (.): #0 For each of the following subsets
More information1 Extensive Form Games
1 Extensive Form Games De nition 1 A nite extensive form game is am object K = fn; (T ) ; P; A; H; u; g where: N = f0; 1; :::; ng is the set of agents (player 0 is nature ) (T ) is the game tree P is the
More informationUncertainty. Michael Peters December 27, 2013
Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy
More informationEconomics 2010c: Lectures 9-10 Bellman Equation in Continuous Time
Economics 2010c: Lectures 9-10 Bellman Equation in Continuous Time David Laibson 9/30/2014 Outline Lectures 9-10: 9.1 Continuous-time Bellman Equation 9.2 Application: Merton s Problem 9.3 Application:
More informationSTATISTICAL INDEPENDENCE AND AN INVITATION TO THE Art OF CONDITIONING
STATISTICAL INDEPENDENCE AND AN INVITATION TO THE Art OF CONDITIONING Tutorial 2 STAT1301 Fall 2010 28SEP2010, MB103@HKU By Joseph Dong Look, imagine a remote village where there has been a long drought.
More informationStochastic Processes and Advanced Mathematical Finance. Stochastic Processes
Steven R. Dunbar Department of Mathematics 203 Avery Hall University of Nebraska-Lincoln Lincoln, NE 68588-0130 http://www.math.unl.edu Voice: 402-472-3731 Fax: 402-472-8466 Stochastic Processes and Advanced
More informationEconS Cost Structures
EconS 425 - Cost Structures Eric Dunaway Washington State University eric.dunaway@wsu.edu Industrial Organization Eric Dunaway (WSU) EconS 425 Industrial Organization 1 / 34 Introduction Today, we ll review
More informationLecture 1: Brief Review on Stochastic Processes
Lecture 1: Brief Review on Stochastic Processes A stochastic process is a collection of random variables {X t (s) : t T, s S}, where T is some index set and S is the common sample space of the random variables.
More informationEconS Vertical Integration
EconS 425 - Vertical Integration Eric Dunaway Washington State University eric.dunaway@wsu.edu Industrial Organization Eric Dunaway (WSU) EconS 425 Industrial Organization 1 / 26 Introduction Let s continue
More informationLecture 6 Random walks - advanced methods
Lecture 6: Random wals - advanced methods 1 of 11 Course: M362K Intro to Stochastic Processes Term: Fall 2014 Instructor: Gordan Zitovic Lecture 6 Random wals - advanced methods STOPPING TIMES Our last
More informationIn terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.
1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t
More informationInference for Stochastic Processes
Inference for Stochastic Processes Robert L. Wolpert Revised: June 19, 005 Introduction A stochastic process is a family {X t } of real-valued random variables, all defined on the same probability space
More informationGravity Pre-Lab 1. Why do you need an inclined plane to measure the effects due to gravity?
Lab Exercise: Gravity (Report) Your Name & Your Lab Partner s Name Due Date Gravity Pre-Lab 1. Why do you need an inclined plane to measure the effects due to gravity? 2. What are several advantage of
More informationOffice hours: Mondays 5-6 PM (undergraduate class preference) Tuesdays 5-6 PM (this class preference) Thursdays 5-6 PM (free-for-all)
Probability Theory Foundations Thursday, September 03, 2015 1:57 PM Office hours: Mondays 5-6 PM (undergraduate class preference) Tuesdays 5-6 PM (this class preference) Thursdays 5-6 PM (free-for-all)
More informationMath 381 Midterm Practice Problem Solutions
Math 381 Midterm Practice Problem Solutions Notes: -Many of the exercises below are adapted from Operations Research: Applications and Algorithms by Winston. -I have included a list of topics covered on
More informationhttp://www.math.uah.edu/stat/markov/.xhtml 1 of 9 7/16/2009 7:20 AM Virtual Laboratories > 16. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 1. A Markov process is a random process in which the future is
More informationRISKy Business: An In-Depth Look at the Game RISK
Rose-Hulman Undergraduate Mathematics Journal Volume 3 Issue Article 3 RISKy Business: An In-Depth Look at the Game RISK Sharon Blatt Elon University, slblatt@hotmail.com Follow this and additional works
More informationDynamic Risk Measures and Nonlinear Expectations with Markov Chain noise
Dynamic Risk Measures and Nonlinear Expectations with Markov Chain noise Robert J. Elliott 1 Samuel N. Cohen 2 1 Department of Commerce, University of South Australia 2 Mathematical Insitute, University
More informationMath Homework 5 Solutions
Math 45 - Homework 5 Solutions. Exercise.3., textbook. The stochastic matrix for the gambler problem has the following form, where the states are ordered as (,, 4, 6, 8, ): P = The corresponding diagram
More informationVector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.
Vector Spaces Definition: The usual addition and scalar multiplication of n-tuples x = (x 1,..., x n ) R n (also called vectors) are the addition and scalar multiplication operations defined component-wise:
More informationPHY 101L - Experiments in Mechanics
PHY 101L - Experiments in Mechanics introduction to error analysis What is Error? In everyday usage, the word error usually refers to a mistake of some kind. However, within the laboratory, error takes
More informationCompatible probability measures
Coin tossing space Think of a coin toss as a random choice from the two element set {0,1}. Thus the set {0,1} n represents the set of possible outcomes of n coin tosses, and Ω := {0,1} N, consisting of
More informationConditional Probability, Independence and Bayes Theorem Class 3, Jeremy Orloff and Jonathan Bloom
Conditional Probability, Independence and Bayes Theorem Class 3, 18.05 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of conditional probability and independence of events. 2.
More informationINTRODUCTION TO DIFFERENTIATION
INTRODUCTION TO DIFFERENTIATION GRADIENT OF A CURVE We have looked at the process needed for finding the gradient of a curve (or the rate of change of a curve). We have defined the gradient of a curve
More informationSolving Linear Quadratic Systems Algebraically Algebra 1
Name: Solving Linear Quadratic Systems Algebraically Algebra 1 Date: In this lesson we will begin to work with solving linear-quadratic systems of equations. Recall that to x, y that satisfy all equations
More informationSample Spaces, Random Variables
Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted
More informationLecture 17 Brownian motion as a Markov process
Lecture 17: Brownian motion as a Markov process 1 of 14 Course: Theory of Probability II Term: Spring 2015 Instructor: Gordan Zitkovic Lecture 17 Brownian motion as a Markov process Brownian motion is
More information1 Gambler s Ruin Problem
1 Gambler s Ruin Problem Consider a gambler who starts with an initial fortune of $1 and then on each successive gamble either wins $1 or loses $1 independent of the past with probabilities p and q = 1
More informationSection 1.6 Inverse Functions
0 Chapter 1 Section 1.6 Inverse Functions A fashion designer is travelling to Milan for a fashion show. He asks his assistant, Betty, what 7 degrees Fahrenheit is in Celsius, and after a quick search on
More information6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication)
Definition: A subspace of a vector space V is a subset H of V which is itself a vector space with respect to the addition and scalar multiplication in V. As soon as one verifies a), b), c) below for H,
More informationStochastic Optimization One-stage problem
Stochastic Optimization One-stage problem V. Leclère September 28 2017 September 28 2017 1 / Déroulement du cours 1 Problèmes d optimisation stochastique à une étape 2 Problèmes d optimisation stochastique
More informationSTOCHASTIC MODELS LECTURE 1 MARKOV CHAINS. Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept.
STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept. 6, 2016 Outline 1. Introduction 2. Chapman-Kolmogrov Equations
More informationMath Lecture 3 Notes
Math 1010 - Lecture 3 Notes Dylan Zwick Fall 2009 1 Operations with Real Numbers In our last lecture we covered some basic operations with real numbers like addition, subtraction and multiplication. This
More information3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series
Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2
More informationNotes and Solutions #6 Meeting of 21 October 2008
HAVERFORD COLLEGE PROBLEM SOLVING GROUP 008-9 Notes and Solutions #6 Meeting of October 008 The Two Envelope Problem ( Box Problem ) An extremely wealthy intergalactic charitable institution has awarded
More information3.4 The Fundamental Theorem of Algebra
333371_0304.qxp 12/27/06 1:28 PM Page 291 3.4 The Fundamental Theorem of Algebra Section 3.4 The Fundamental Theorem of Algebra 291 The Fundamental Theorem of Algebra You know that an nth-degree polynomial
More informationVerona Course April Lecture 1. Review of probability
Verona Course April 215. Lecture 1. Review of probability Viorel Barbu Al.I. Cuza University of Iaşi and the Romanian Academy A probability space is a triple (Ω, F, P) where Ω is an abstract set, F is
More informationthe time it takes until a radioactive substance undergoes a decay
1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete
More informationThe Asymptotic Theory of Transaction Costs
The Asymptotic Theory of Transaction Costs Lecture Notes by Walter Schachermayer Nachdiplom-Vorlesung, ETH Zürich, WS 15/16 1 Models on Finite Probability Spaces In this section we consider a stock price
More informationLecture Notes on Game Theory
Lecture Notes on Game Theory Levent Koçkesen Strategic Form Games In this part we will analyze games in which the players choose their actions simultaneously (or without the knowledge of other players
More informationBrownian Motion. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan Brownian Motion
Brownian Motion An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Background We have already seen that the limiting behavior of a discrete random walk yields a derivation of
More informationLECTURE 15: SIMPLE LINEAR REGRESSION I
David Youngberg BSAD 20 Montgomery College LECTURE 5: SIMPLE LINEAR REGRESSION I I. From Correlation to Regression a. Recall last class when we discussed two basic types of correlation (positive and negative).
More informationEquations and Inequalities
Equations and Inequalities 2 Figure 1 CHAPTER OUTLINE 2.1 The Rectangular Coordinate Systems and Graphs 2.2 Linear Equations in One Variable 2.3 Models and Applications 2.4 Complex Numbers 2.5 Quadratic
More informationDimensions. 1 gt. y(t) = 2
3 3 1 Dimensions Dimensions, often called units, are familiar creatures in physics and engineering. They are also helpful in mathematics, as I hope to show you with examples from differentiation, integration,
More information1.2 Functions & Function Notation
1.2 Functions & Function Notation A relation is any set of ordered pairs. A function is a relation for which every value of the independent variable (the values that can be inputted; the t s; used to call
More informationQuantum Computation CMU BB, Fall Week 6 work: Oct. 11 Oct hour week Obligatory problems are marked with [ ]
Quantum Computation CMU 15-859BB, Fall 2018 Week 6 work: Oct. 11 Oct. 18 12-hour week Obligatory problems are marked with [ ] 1. [CCNOT.] In class we showed how to simulate classical AND, OR, NOT, and
More informationWeek 1 Quantitative Analysis of Financial Markets Distributions A
Week 1 Quantitative Analysis of Financial Markets Distributions A Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 October
More informationLecture 23. Random walks
18.175: Lecture 23 Random walks Scott Sheffield MIT 1 Outline Random walks Stopping times Arcsin law, other SRW stories 2 Outline Random walks Stopping times Arcsin law, other SRW stories 3 Exchangeable
More informationLecture 5. 1 Chung-Fuchs Theorem. Tel Aviv University Spring 2011
Random Walks and Brownian Motion Tel Aviv University Spring 20 Instructor: Ron Peled Lecture 5 Lecture date: Feb 28, 20 Scribe: Yishai Kohn In today's lecture we return to the Chung-Fuchs theorem regarding
More informationLinear algebra and differential equations (Math 54): Lecture 10
Linear algebra and differential equations (Math 54): Lecture 10 Vivek Shende February 24, 2016 Hello and welcome to class! As you may have observed, your usual professor isn t here today. He ll be back
More informationAdvanced Microeconomics
Advanced Microeconomics Cooperative game theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 45 Part D. Bargaining theory and Pareto optimality 1
More informationTrajectorial Martingales, Null Sets, Convergence and Integration
Trajectorial Martingales, Null Sets, Convergence and Integration Sebastian Ferrando, Department of Mathematics, Ryerson University, Toronto, Canada Alfredo Gonzalez and Sebastian Ferrando Trajectorial
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationOnline Learning Summer School Copenhagen 2015 Lecture 1
Online Learning Summer School Copenhagen 2015 Lecture 1 Shai Shalev-Shwartz School of CS and Engineering, The Hebrew University of Jerusalem Online Learning Shai Shalev-Shwartz (Hebrew U) OLSS Lecture
More informationChapter 4. Systems of Linear Equations; Matrices. Opening Example. Section 1 Review: Systems of Linear Equations in Two Variables
Chapter 4 Systems of Linear Equations; Matrices Section 1 Review: Systems of Linear Equations in Two Variables Opening Example A restaurant serves two types of fish dinners- small for $5.99 and large for
More informationCoordinate Systems. S. F. Ellermeyer. July 10, 2009
Coordinate Systems S F Ellermeyer July 10, 009 These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (rd edition) These notes are
More informationMTH 202 : Probability and Statistics
MTH 202 : Probability and Statistics Lecture 5-8 : 15, 20, 21, 23 January, 2013 Random Variables and their Probability Distributions 3.1 : Random Variables Often while we need to deal with probability
More informationSample of Ph.D. Advisory Exam For MathFinance
Sample of Ph.D. Advisory Exam For MathFinance Students who wish to enter the Ph.D. program of Mathematics of Finance are required to take the advisory exam. This exam consists of three major parts. The
More informationMTH 2032 Semester II
MTH 232 Semester II 2-2 Linear Algebra Reference Notes Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2 ii Contents Table of Contents
More informationUNDERSTANDING FUNCTIONS
Learning Centre UNDERSTANDING FUNCTIONS Function As a Machine A math function can be understood as a machine that takes an input and produces an output. Think about your CD Player as a machine that takes
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationMTH 65 Supplemental Problem Sets SUPPLEMENT TO 4.1
SUPPLEMENT TO 4.1 1. Solve the following systems of equations by graphing. You will need to set up different scales on the different coordinate planes to get the graphs to fit nicely. Remember you may
More informationChapter 7. Homogeneous equations with constant coefficients
Chapter 7. Homogeneous equations with constant coefficients It has already been remarked that we can write down a formula for the general solution of any linear second differential equation y + a(t)y +
More information6.3 logarithmic FUnCTIOnS
SECTION 6.3 logarithmic functions 4 9 1 learning ObjeCTIveS In this section, you will: Convert from logarithmic to exponential form. Convert from exponential to logarithmic form. Evaluate logarithms. Use
More informationSolution Set for Homework #1
CS 683 Spring 07 Learning, Games, and Electronic Markets Solution Set for Homework #1 1. Suppose x and y are real numbers and x > y. Prove that e x > ex e y x y > e y. Solution: Let f(s = e s. By the mean
More informationSolutions to Second Midterm(pineapple)
Math 125 Solutions to Second Midterm(pineapple) 1. Compute each of the derivatives below as indicated. 4 points (a) f(x) = 3x 8 5x 4 + 4x e 3. Solution: f (x) = 24x 7 20x + 4. Don t forget that e 3 is
More informationINTEGRALS. In Chapter 2, we used the tangent and velocity problems to introduce the derivative the central idea in differential calculus.
INTEGRALS 5 INTEGRALS In Chapter 2, we used the tangent and velocity problems to introduce the derivative the central idea in differential calculus. INTEGRALS In much the same way, this chapter starts
More informationNested Uncertain Differential Equations and Its Application to Multi-factor Term Structure Model
Nested Uncertain Differential Equations and Its Application to Multi-factor Term Structure Model Xiaowei Chen International Business School, Nankai University, Tianjin 371, China School of Finance, Nankai
More informationThe symmetric group R + :1! 2! 3! 1. R :1! 3! 2! 1.
Chapter 2 The symmetric group Consider the equilateral triangle. 3 1 2 We want to describe all the symmetries, which are the motions (both rotations and flips) which takes the triangle to itself. First
More informationConjugate duality in stochastic optimization
Ari-Pekka Perkkiö, Institute of Mathematics, Aalto University Ph.D. instructor/joint work with Teemu Pennanen, Institute of Mathematics, Aalto University March 15th 2010 1 / 13 We study convex problems.
More informationCHAPTER 9: TREATING EXPERIMENTAL DATA: ERRORS, MISTAKES AND SIGNIFICANCE (Written by Dr. Robert Bretz)
CHAPTER 9: TREATING EXPERIMENTAL DATA: ERRORS, MISTAKES AND SIGNIFICANCE (Written by Dr. Robert Bretz) In taking physical measurements, the true value is never known with certainty; the value obtained
More informationCosets and Lagrange s theorem
Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the
More informationProbability spaces and random variables Exercises
Probability spaces and random variables Exercises Exercise 1.1. This exercise refers to the random variables described in the slides from the course. n o = 1 ; 2 ; 3 ; 4 ; 5 ; 6. We already established
More informationChapter 5 Random vectors, Joint distributions. Lectures 18-23
Chapter 5 Random vectors, Joint distributions Lectures 18-23 In many real life problems, one often encounter multiple random objects. For example, if one is interested in the future price of two different
More informationThe Boundary Problem: Markov Chain Solution
MATH 529 The Boundary Problem: Markov Chain Solution Consider a random walk X that starts at positive height j, and on each independent step, moves upward a units with probability p, moves downward b units
More informationFunctions Modeling Change A Preparation for Calculus Third Edition
Powerpoint slides copied from or based upon: Functions Modeling Change A Preparation for Calculus Third Edition Connally, Hughes-Hallett, Gleason, Et Al. Copyright 2007 John Wiley & Sons, Inc. 1 Section
More informationMacroeconomics II Dynamic macroeconomics Class 1: Introduction and rst models
Macroeconomics II Dynamic macroeconomics Class 1: Introduction and rst models Prof. George McCandless UCEMA Spring 2008 1 Class 1: introduction and rst models What we will do today 1. Organization of course
More informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More information