u( x)= Pr X() t hits C before 0 X( 0)= x ( ) 2 AMS 216 Stochastic Differential Equations Lecture #2
|
|
- Eunice Lee
- 6 years ago
- Views:
Transcription
1 AMS 6 Stochastic Differential Equations Lecture # Gambler s Ruin (continued) Question #: How long can you play? Question #: What is the chance that you break the bank? Note that unlike in the case of deterministic equations, for stochastic differential equations, it is not enough just to calculate X(t). For stochastic differential equations, we also want to know quantities that are not readily determined from X(t), such as answers to questions above. We answer question # first. Let u( )= Pr X() t hits C before 0 X( 0)= { } We have u(c) = and u(0) = 0. Xdt = + For fied 0 < < C and when dt is small enough, the probability of X(t) hits 0 or C in time interval [0, dt] is eponentially small. u( )= E { u( + )}+ odt = E u( )+ u + u = u + u dt + odt + odt ==> u ( )= 0 differential equation u( 0)= 0, uc = boundary conditions ==> u = C The probability of breaking the bank is proportional to your initial cash and inversely proportional to the total cash. Now we answer question #. Let T( )= E{ time until X()= t C or X()= t 0 X( 0)= }. We have T(0) = 0 and T(C) = 0. Xdt = + - -
2 ==> T( )= dt + E { T( + )}+ odt = dt + E T( )+ T + T = dt + T( ) + T dt + odt T ( )= differential equation T ( 0)= 0, T( C)= 0 boundary conditions ==> T( ) = C ( ) + odt But the average time does not give us the full picture! T() is the average of the time until going bankrupt or breaking the bank. However, this average does not give us a full picture of how long we can play with initial cash. Notice that T( )= C ( ) increases with C. In particular, when C =, we have T( ) = for > 0. This certainly does not mean we can play forever with initial cash. To have a more detailed picture of how long we can play when C is very large, we look at the probability that we can play longer than a certain time. Assume C =. Consider { [ ] X ( 0)= } P(,t)= Pr X ( )> 0 for 0, t P(, t) is the probability of surviving (at least) to time t given that X(0) =. We have P,0 = and P( 0,t) = 0. Xdt = + ==> P(, t)= E { P( +, t dt) }+ odt = E P(,t)+ P t ( dt)+ P + P = P,t + P t ( dt) + P dt + odt P(, t) satisfies the initial boundary value problem (IBVP) P t = P P(,0)=, P( 0,t)= 0 Converting it to an initial value problem (IVP) by odd etension P(,t)= P(,t) The etended function P(, t) satisfies the IVP + odt - -
3 P t = P P,0 =, < 0, > 0 Solution of the IVP u t = au u(,0)= f is given by u(,t)= 4at ep 4at f ( )d Using this formula to calculate P(, t), we obtain f( )= P(,t)= = =, <, > t t 0 t ep t d ep t d t ep( s )ds, s = t = erf t where the error function is defined as erf 0 t We can use P,t = erf z 0 ep( s )ds t ep t d to calculate the probability. P(,.) = 0.5 means that with initial cash =, the probability that we can play longer than t =. is 50%. P(, 63) = 0. means that with initial cash =, the probability that we can play longer than t = 63 is 0%. P(, 55) = 0.05 means that with initial cash =, the probability that we can play longer than t = 55 is 5%
4 Note that when the game is fair and there are many players, the casino s cash is almost unchanged with respect to the time. In other words, the casino cannot make money with a fair game. (Now we consider a) Biased game: dx = mdt + It is a biased game because E{ dx} = mdt Question #: How long can you play? Question #: What is the chance that you break the bank? Let u = Pr Xt hits C before 0 X( 0) = { } We have uc = and u( 0) = 0. Again, for fied 0 < < C and when dt is small enough, the probability of X(t) hits 0 or C in time interval [0, dt] is eponentially small. Xdt = + dx where dx = mdt + satisfies dx = O( dt) E{ dx}= mdt E{ ( dx) }= E{ o( dt)+ ( ) }= dt + odt Function u() satisfies u( )= E { u( + dx) }+ odt = E u( )+ u dx + u dx = u( ) u mdt + u dt + odt + odt u ==> ( ) mu ( )= 0 differential equation u( 0)= 0, uc = boundary conditions (The characteristic equation of the ODE is m - 4 -
5 The two roots are = m, = 0 A general solution has the form u( )= c e m + c Using the boundary conditions, we obtain) ==> u( )= em ( e mc = e m )e mc e mc Suppose mc is moderately large (for eample, mc = 0). We have u( ) ( e m )e mc m C < e The probability of breaking the bank is eponentially small. Let us compare fair game vs biased game Fair game: u( )= C ==> u C = Biased game: u C ( e mc )e mc mc e u C is the probability of winning all the cash of the other player when the two players start with the equal amount of cash. Now we study the average time to the end of game. Let T( )= E{ time until X()= t C or X()= t 0 X( 0)= }. We have T ( 0) = 0 and T( C) = 0. Eercise #: Derive an ODE for T(). Solve the boundary value problem to get T( )= m C m em e mc Suppose mc is moderately large and is not close to C, then we have T( )= m C em e mc m - 5 -
6 This is consistent with the intuitive deterministic picture that if your cash decreases with a speed m, then your initial cash will last time = m. Now consider a discrete version of the gambler s ruin problem. t = 0,,, 3, discrete X = 0,,, 3, discrete X( t + )= X()+ t dx +, prob = µ dx =, prob = + µ N = sum of your initial cash and casino s cash n = your initial cash { } { ()= N or X()= t 0 X( 0)= n} un = Pr X() t hits N before 0 X( 0)= n T( n)= E time until X t Eercise P: For µ = 0 (fair game), derive equations for u(n) and T(n). Solve the equations for u(n) and T(n). Eercise P: For µ > 0 (biased game), derive equations for u(n) and T(n). Solve the equations for u(n) and T(n). White noise A short story ) Z() t dt ()Z( s) ==> ) E{ Z t }= ( t s) ==> 3) e it E{ Z()Z t ( 0) }dt = ==> 4) Z(t) is white noise. First, we point out that Z() t dt is not a regular function
7 = O( dt) dt = O dt dt = O dt lim = dt0 dt 0 = We need to fill in some details to eplain each step, especially from line 3 to line 4. A long story We start with some mathematical preparations. Delta function (Dirac's delta function): We give two equivalent definitions of the Delta function. Each definition is mathematically more convenient in some situations. Definition (limit of Gaussian distribution): ( )= lim n ep n n where lim n = 0, for eample, n = n n. Definition (limit of impulse function): ( )= lim ( ) n n n, for where n ( )= n, n 0, otherwise - 7 -
UNIVERSITY OF CALIFORNIA SANTA CRUZ AN ANALYSIS OF THE DISCRETE AND CONTINUOUS GAMBLER S RUIN PROBLEM
UNIVERSITY OF CALIFORNIA SANTA CRUZ AN ANALYSIS OF THE DISCRETE AND CONTINUOUS GAMBLER S RUIN PROBLEM A Senior Thesis submitted in partial completion of the requirements of the degree of BACHELOR OF ARTS
More informationMultiple Decrement Models
Multiple Decrement Models Lecture: Weeks 7-8 Lecture: Weeks 7-8 (Math 3631) Multiple Decrement Models Spring 2018 - Valdez 1 / 26 Multiple decrement models Lecture summary Multiple decrement model - epressed
More informationTransform Techniques - CF
Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t t M () t E[ e ] e Characteristic Function (CF) k t k For a real ω, the characteristic function
More informationWeek 3 Sept. 17 Sept. 21
Week 3 Sept. 7 Sept. 2 Lecture 6. Bu on s needle Review: Last week, the sample space is R or a subset of R. Let X be a random variable with X 2 R. The cumulative distribution function (cdf) is de ned as
More informationTransform Techniques - CF
Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t t M () t E[ e ] e Characteristic Function (CF) k t k For a real ω, the characteristic function
More informationMarkov Processes Hamid R. Rabiee
Markov Processes Hamid R. Rabiee Overview Markov Property Markov Chains Definition Stationary Property Paths in Markov Chains Classification of States Steady States in MCs. 2 Markov Property A discrete
More informationTransform Techniques - CF
Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t e k p ( k) discrete t t k M () t E[ e ] e t e f d continuous Characteristic Function (CF)
More informationApril 24, 2012 (Tue) Lecture 19: Impulse Function and its Laplace Transform ( 6.5)
Lecture 19: Impulse Function and its Laplace Transform ( 6.5) April 24, 2012 (Tue) Impulse Phenomena of an impulsive nature, such as the action of very large forces (or voltages) over very short intervals
More informationIntroduction to numerical simulations for Stochastic ODEs
Introduction to numerical simulations for Stochastic ODEs Xingye Kan Illinois Institute of Technology Department of Applied Mathematics Chicago, IL 60616 August 9, 2010 Outline 1 Preliminaries 2 Numerical
More information6 Continuous-Time Birth and Death Chains
6 Continuous-Time Birth and Death Chains Angela Peace Biomathematics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology.
More informationMathematical Games and Random Walks
Mathematical Games and Random Walks Alexander Engau, Ph.D. Department of Mathematical and Statistical Sciences College of Liberal Arts and Sciences / Intl. College at Beijing University of Colorado Denver
More informationProbability Models. 4. What is the definition of the expectation of a discrete random variable?
1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions
More informationn px p x (1 p) n x. p x n(n 1)... (n x + 1) x!
Lectures 3-4 jacques@ucsd.edu 7. Classical discrete distributions D. The Poisson Distribution. If a coin with heads probability p is flipped independently n times, then the number of heads is Bin(n, p)
More informationMath 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential.
Math 8A Lecture 6 Friday May 7 th Epectation Recall the three main probability density functions so far () Uniform () Eponential (3) Power Law e, ( ), Math 8A Lecture 6 Friday May 7 th Epectation Eample
More informationStrauss PDEs 2e: Section Exercise 2 Page 1 of 8. In order to do so, we ll solve for the Green s function G(x, t) in the corresponding PDE,
Strauss PDEs 2e: Section 2.4 - Eercise 2 Page of 8 Eercise 2 Do the same for φ() = for > and φ() = 3 for
More information1 Random Walks and Electrical Networks
CME 305: Discrete Mathematics and Algorithms Random Walks and Electrical Networks Random walks are widely used tools in algorithm design and probabilistic analysis and they have numerous applications.
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
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 informationXt i Xs i N(0, σ 2 (t s)) and they are independent. This implies that the density function of X t X s is a product of normal density functions:
174 BROWNIAN MOTION 8.4. Brownian motion in R d and the heat equation. The heat equation is a partial differential equation. We are going to convert it into a probabilistic equation by reversing time.
More information1D Wave Equation General Solution / Gaussian Function
D Wave Euation General Solution / Gaussian Function Phys 375 Overview and Motivation: Last time we derived the partial differential euation known as the (one dimensional wave euation Today we look at the
More informationStochastic Differential Equations.
Chapter 3 Stochastic Differential Equations. 3.1 Existence and Uniqueness. One of the ways of constructing a Diffusion process is to solve the stochastic differential equation dx(t) = σ(t, x(t)) dβ(t)
More informationStat 475 Life Contingencies I. Chapter 2: Survival models
Stat 475 Life Contingencies I Chapter 2: Survival models The future lifetime random variable Notation We are interested in analyzing and describing the future lifetime of an individual. We use (x) to denote
More informationMarkov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains
Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time
More informationLecture 4 - Random walk, ruin problems and random processes
Lecture 4 - Random walk, ruin problems and random processes Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 4 - Random walk, ruin problems and random processesapril 19, 2009 1 / 30 Part I Random
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 informatione (x y)2 /4kt φ(y) dy, for t > 0. (4)
Math 24A October 26, 2 Viktor Grigoryan Heat equation: interpretation of the solution Last time we considered the IVP for the heat equation on the whole line { ut ku xx = ( < x
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 informationSection 6.5 Impulse Functions
Section 6.5 Impulse Functions Key terms/ideas: Unit impulse function (technically a generalized function or distribution ) Dirac delta function Laplace transform of the Dirac delta function IVPs with forcing
More informationStochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno
Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.
More informationMAT 271E Probability and Statistics
MAT 271E Probability and Statistics Spring 2011 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 16.30, Wednesday EEB? 10.00 12.00, Wednesday
More informationMath Calculus f. Business and Management - Worksheet 12. Solutions for Worksheet 12 - Limits as x approaches infinity
Math 0 - Calculus f. Business and Management - Worksheet 1 Solutions for Worksheet 1 - Limits as approaches infinity Simple Limits Eercise 1: Compute the following its: 1a : + 4 1b : 5 + 8 1c : 5 + 8 Solution
More informationFourier Transform for Continuous Functions
Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum
More informationThe integrating factor method (Sect. 1.1)
The integrating factor method (Sect. 1.1) Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Overview
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 15 Heat with a source So far we considered homogeneous wave and heat equations and the associated initial value problems on the whole line, as
More information16. Working with the Langevin and Fokker-Planck equations
16. Working with the Langevin and Fokker-Planck equations In the preceding Lecture, we have shown that given a Langevin equation (LE), it is possible to write down an equivalent Fokker-Planck equation
More information2. Higher-order Linear ODE s
2. Higher-order Linear ODE s 2A. Second-order Linear ODE s: General Properties 2A-1. On the right below is an abbreviated form of the ODE on the left: (*) y + p()y + q()y = r() Ly = r() ; where L is the
More informationFourier Analysis Fourier Series C H A P T E R 1 1
C H A P T E R Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4, more general orthonormal series called Sturm iouville epansions in Secs..5 and.6
More informationNUMERICAL ANALYSIS PROBLEMS
NUMERICAL ANALYSIS PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations Problem.
More informationMATH HOMEWORK PROBLEMS D. MCCLENDON
MATH 46- HOMEWORK PROBLEMS D. MCCLENDON. Consider a Markov chain with state space S = {0, }, where p = P (0, ) and q = P (, 0); compute the following in terms of p and q: (a) P (X 2 = 0 X = ) (b) P (X
More informationChapter 11 Advanced Topic Stochastic Processes
Chapter 11 Advanced Topic Stochastic Processes CHAPTER OUTLINE Section 1 Simple Random Walk Section 2 Markov Chains Section 3 Markov Chain Monte Carlo Section 4 Martingales Section 5 Brownian Motion Section
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 informationFundamental Theorem of Calculus
Fundamental Theorem of Calculus MATH 6 Calculus I J. Robert Buchanan Department of Mathematics Summer 208 Remarks The Fundamental Theorem of Calculus (FTC) will make the evaluation of definite integrals
More informationEdexcel past paper questions
Edexcel past paper questions Statistics 1 Discrete Random Variables Past examination questions Discrete Random variables Page 1 Discrete random variables Discrete Random variables Page 2 Discrete Random
More informationStochastic Modelling in Climate Science
Stochastic Modelling in Climate Science David Kelly Mathematics Department UNC Chapel Hill dtbkelly@gmail.com November 16, 2013 David Kelly (UNC) Stochastic Climate November 16, 2013 1 / 36 Why use stochastic
More informationComputations - Show all your work. (30 pts)
Math 1012 Final Name: Computations - Show all your work. (30 pts) 1. Fractions. a. 1 7 + 1 5 b. 12 5 5 9 c. 6 8 2 16 d. 1 6 + 2 5 + 3 4 2.a Powers of ten. i. 10 3 10 2 ii. 10 2 10 6 iii. 10 0 iv. (10 5
More informationOptimal Sojourn Time Control within an Interval 1
Optimal Sojourn Time Control within an Interval Jianghai Hu and Shankar Sastry Department of Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley, CA 97-77 {jianghai,sastry}@eecs.berkeley.edu
More informationMath 510 midterm 3 answers
Math 51 midterm 3 answers Problem 1 (1 pts) Suppose X and Y are independent exponential random variables both with parameter λ 1. Find the probability that Y < 7X. P (Y < 7X) 7x 7x f(x, y) dy dx e x e
More informationSolutions to In Class Problems Week 15, Wed.
Massachusetts Institute of Technology 6.04J/18.06J, Fall 05: Mathematics for Comuter Science December 14 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised December 14, 005, 1404 minutes Solutions
More informationChapter 3 Single Random Variables and Probability Distributions (Part 1)
Chapter 3 Single Random Variables and Probability Distributions (Part 1) Contents What is a Random Variable? Probability Distribution Functions Cumulative Distribution Function Probability Density Function
More information1 Introduction. 2 Diffusion equation and central limit theorem. The content of these notes is also covered by chapter 3 section B of [1].
1 Introduction The content of these notes is also covered by chapter 3 section B of [1]. Diffusion equation and central limit theorem Consider a sequence {ξ i } i=1 i.i.d. ξ i = d ξ with ξ : Ω { Dx, 0,
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 informationALGEBRA II-GRAPHING QUADRATICS THE GRAPH OF A QUADRATIC FUNCTION
ALGEBRA II-GRAPHING QUADRATICS THE GRAPH OF A QUADRATIC FUNCTION The Quadratic Equation is written as: ; this equation has a degree of. Where a, b and c are integer coefficients (where a 0) The graph of
More informationLecture 31. Basic Theory of First Order Linear Systems
Math 245 - Mathematics of Physics and Engineering I Lecture 31. Basic Theory of First Order Linear Systems April 4, 2012 Konstantin Zuev (USC) Math 245, Lecture 31 April 4, 2012 1 / 10 Agenda Existence
More informationSolution to Problems for the 1-D Wave Equation
Solution to Problems for the -D Wave Equation 8. Linear Partial Differential Equations Matthew J. Hancock Fall 5 Problem (i) Suppose that an infinite string has an initial displacement +, u (, ) = f ()
More informationSystem Identification
System Identification Arun K. Tangirala Department of Chemical Engineering IIT Madras July 27, 2013 Module 3 Lecture 1 Arun K. Tangirala System Identification July 27, 2013 1 Objectives of this Module
More informationLecture Notes 2 Random Variables. Discrete Random Variables: Probability mass function (pmf)
Lecture Notes 2 Random Variables Definition Discrete Random Variables: Probability mass function (pmf) Continuous Random Variables: Probability density function (pdf) Mean and Variance Cumulative Distribution
More information4 Branching Processes
4 Branching Processes Organise by generations: Discrete time. If P(no offspring) 0 there is a probability that the process will die out. Let X = number of offspring of an individual p(x) = P(X = x) = offspring
More informationLEARN ABOUT the Math
1.5 Inverse Relations YOU WILL NEED graph paper graphing calculator GOAL Determine the equation of an inverse relation and the conditions for an inverse relation to be a function. LEARN ABOUT the Math
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations
More informationCalculus Module C09. Delta Process. Copyright This publication The Northern Alberta Institute of Technology All Rights Reserved.
Calculus Module C09 Delta Process Copyright This publication The Northern Alberta Institute of Technology 00. All Rights Reserved. LAST REVISED April, 009 Delta Process Statement of Prerequisite Skills
More informationMATH141: Calculus II Exam #1 review 6/8/2017 Page 1
MATH: Calculus II Eam # review /8/7 Page No review sheet can cover everything that is potentially fair game for an eam, but I tried to hit on all of the topics with these questions, as well as show you
More informationRandom variable X is a mapping that maps each outcome s in the sample space to a unique real number x, x. X s. Real Line
Random Variable Random variable is a mapping that maps each outcome s in the sample space to a unique real number,. s s : outcome Sample Space Real Line Eamples Toss a coin. Define the random variable
More informationLecture 11: Fourier Cosine Series
Introductory lecture notes on Partial Differential Equations - c Anthony Peirce Not to be copied, used, or revised without eplicit written permission from the copyright owner ecture : Fourier Cosine Series
More informationSlopes and Rates of Change
Slopes and Rates of Change If a particle is moving in a straight line at a constant velocity, then the graph of the function of distance versus time is as follows s s = f(t) t s s t t = average velocity
More informationSolving the Heat Equation (Sect. 10.5).
Solving the Heat Equation Sect. 1.5. Review: The Stationary Heat Equation. The Heat Equation. The Initial-Boundary Value Problem. The separation of variables method. An example of separation of variables.
More informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
More informationAnswers. Investigation 2. ACE Assignment Choices. Applications. Problem 2.5. Problem 2.1. Problem 2.2. Problem 2.3. Problem 2.4
Answers Investigation ACE Assignment Choices Problem. Core, Problem. Core, Other Applications ; Connections, 3; unassigned choices from previous problems Problem.3 Core Other Connections, ; unassigned
More informationThe Chain Rule. This is a generalization of the (general) power rule which we have already met in the form: then f (x) = r [g(x)] r 1 g (x).
The Chain Rule This is a generalization of the general) power rule which we have already met in the form: If f) = g)] r then f ) = r g)] r g ). Here, g) is any differentiable function and r is any real
More informationI forgot to mention last time: in the Ito formula for two standard processes, putting
I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Probability Theory: Counting in Terms of Proportions Lecture 10 (September 27, 2007) Some Puzzles Teams A and B are equally good In any one game, each
More information33 The Gambler's Ruin 1
33 The Gambler's Ruin 1 Figure 1 The Gambler's Ruin There are many variations of the gambler's ruin problem, but a principal one goes like this. We have i dollars out of a total of n. We flip a coin which
More information9.5 HONORS Determine Odd and Even Functions Graphically and Algebraically
9.5 HONORS Determine Odd and Even Functions Graphically and Algebraically Use this blank page to compile the most important things you want to remember for cycle 9.5: 181 Even and Odd Functions Even Functions:
More informationCS 361: Probability & Statistics
February 19, 2018 CS 361: Probability & Statistics Random variables Markov s inequality This theorem says that for any random variable X and any value a, we have A random variable is unlikely to have an
More informationBrief Review of Probability
Brief Review of Probability Nuno Vasconcelos (Ken Kreutz-Delgado) ECE Department, UCSD Probability Probability theory is a mathematical language to deal with processes or experiments that are non-deterministic
More informationLaplace Transforms Chapter 3
Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important
More information2.7 The Gaussian Probability Density Function Forms of the Gaussian pdf for Real Variates
.7 The Gaussian Probability Density Function Samples taken from a Gaussian process have a jointly Gaussian pdf (the definition of Gaussian process). Correlator outputs are Gaussian random variables if
More informationA) Questions on Estimation
A) Questions on Estimation 1 The following table shows the data about the number of seeds germinating out of 10 on damp filter paper which has Poisson distribution. Determine Estimate of λ. Number of seeds
More informationMA108 ODE: Picard s Theorem
MA18 ODE: Picard s Theorem Preeti Raman IIT Bombay MA18 Existence and Uniqueness The IVP s that we have considered usually have unique solutions. This need not always be the case. MA18 Example Example:
More information1 Signals and systems
978--52-5688-4 - Introduction to Orthogonal Transforms: With Applications in Data Processing and Analysis Signals and systems In the first two chapters we will consider some basic concepts and ideas as
More informationLinear Variable coefficient equations (Sect. 2.1) Review: Linear constant coefficient equations
Linear Variable coefficient equations (Sect. 2.1) Review: Linear constant coefficient equations. The Initial Value Problem. Linear variable coefficients equations. The Bernoulli equation: A nonlinear equation.
More informationSimultaneous Equations Solve for x and y (What are the values of x and y): Summation What is the value of the following given x = j + 1. x i.
1 Algebra Simultaneous Equations Solve for x and y (What are the values of x and y): x + 2y = 6 x - y = 3 Summation What is the value of the following given x = j + 1. Summation Calculate the following:
More informationECE 636: Systems identification
ECE 636: Systems identification Lectures 3 4 Random variables/signals (continued) Random/stochastic vectors Random signals and linear systems Random signals in the frequency domain υ ε x S z + y Experimental
More informationLecture 6. Four postulates of quantum mechanics. The eigenvalue equation. Momentum and energy operators. Dirac delta function. Expectation values
Lecture 6 Four postulates of quantum mechanics The eigenvalue equation Momentum and energy operators Dirac delta function Expectation values Objectives Learn about eigenvalue equations and operators. Learn
More informationLecture 8: Continuous random variables, expectation and variance
Lecture 8: Continuous random variables, expectation and variance Lejla Batina Institute for Computing and Information Sciences Digital Security Version: autumn 2013 Lejla Batina Version: autumn 2013 Wiskunde
More informationLTCC. Exercises. (1) Two possible weather conditions on any day: {rainy, sunny} (2) Tomorrow s weather depends only on today s weather
1. Markov chain LTCC. Exercises Let X 0, X 1, X 2,... be a Markov chain with state space {1, 2, 3, 4} and transition matrix 1/2 1/2 0 0 P = 0 1/2 1/3 1/6. 0 0 0 1 (a) What happens if the chain starts in
More informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 29, 2014 Introduction Introduction The world of the model-builder
More informationStochastic processes Lecture 1: Multiple Random Variables Ch. 5
Stochastic processes Lecture : Multiple Random Variables Ch. 5 Dr. Ir. Richard C. Hendriks 26/04/8 Delft University of Technology Challenge the future Organization Plenary Lectures Book: R.D. Yates and
More information6.241 Dynamic Systems and Control
6.41 Dynamic Systems and Control Lecture 5: H Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 11, 011 E. Frazzoli (MIT) Lecture 5: H Synthesis May 11, 011
More informationMath 211. Lecture #6. Linear Equations. September 9, 2002
1 Math 211 Lecture #6 Linear Equations September 9, 2002 2 Air Resistance 2 Air Resistance Acts in the direction opposite to the velocity. 2 Air Resistance Acts in the direction opposite to the velocity.
More informationSystem Identification & Parameter Estimation
System Identification & Parameter Estimation Wb3: SIPE lecture Correlation functions in time & frequency domain Alfred C. Schouten, Dept. of Biomechanical Engineering (BMechE), Fac. 3mE // Delft University
More informationDO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO
QUESTION BOOKLET EE 126 Spring 26 Midterm #2 Thursday, April 13, 11:1-12:3pm DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO You have 8 minutes to complete the midterm. The midterm consists
More informationLecture 9 Classification of States
Lecture 9: Classification of States of 27 Course: M32K Intro to Stochastic Processes Term: Fall 204 Instructor: Gordan Zitkovic Lecture 9 Classification of States There will be a lot of definitions and
More informationNAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet Test Duration: 75 minutes Coverage: Chaps 1,2 Open Book but Closed Notes One 85 in x 11 in crib sheet Calculators NOT allowed DO NOT
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationGeneralized sources (Sect. 6.5). The Dirac delta generalized function. Definition Consider the sequence of functions for n 1, Remarks:
Generalized sources (Sect. 6.5). The Dirac delta generalized function. Definition Consider the sequence of functions for n, d n, t < δ n (t) = n, t 3 d3 d n, t > n. d t The Dirac delta generalized function
More informationTransition to College Math
Transition to College Math Date: Unit 3: Trigonometr Lesson 2: Angles of Rotation Name Period Essential Question: What is the reference angle for an angle of 15? Standard: F-TF.2 Learning Target: Eplain
More informationStatistical Methods for Data Analysis
Statistical Methods for Data Analysis Random number generators Luca Lista INFN Napoli Pseudo-random generators Requirement: Simulate random process with a computer E.g.: radiation interaction with matter,
More informationharmonic oscillator in quantum mechanics
Physics 400 Spring 016 harmonic oscillator in quantum mechanics lecture notes, spring semester 017 http://www.phys.uconn.edu/ rozman/ourses/p400_17s/ Last modified: May 19, 017 Dimensionless Schrödinger
More informationTutorial for Lecture Course on Modelling and System Identification (MSI) Albert-Ludwigs-Universität Freiburg Winter Term
Tutorial for Lecture Course on Modelling and System Identification (MSI) Albert-Ludwigs-Universität Freiburg Winter Term 2016-2017 Tutorial 3: Emergency Guide to Statistics Prof. Dr. Moritz Diehl, Robin
More informationModule 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur
Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn
More information