Stochastic models and their distributions

Size: px
Start display at page:

Download "Stochastic models and their distributions"

Transcription

1 Sochasic models and heir disribuions Couning cusomers Suppose ha n cusomers arrive a a grocery a imes, say T 1,, T n, each of which akes any real number in he inerval (, ) equally likely The values T 1,, T n are called arrival imes, and hey are independen and idenically disribued (iid) uniform random variables on (, ) By N(s) we denoe he number of cusomers arriving in he ime inerval (, s) for s Probabiliy densiy funcion The probabiliy densiy funcion (pdf) for each arrival ime is given by { 1/ if < x < ; f(x) oherwise [ha is, if x or x] The cusomers independenly arrive in he ime inerval (, s) wih probabiliy p : ( s ) Then he frequency funcion for N(s) is given by P {N(s) k} ( n k ) (s ) k ( 1 s ) n k, (11) and i is called a binomial disribuion wih success probabiliy p ( s ) and he number n of rials Order saisics and arrival ime Le X 1,, X n be iid random variables wih he common cumulaive disribuion funcion (cdf) F (x) and he pdf f(x) When we sor X 1,, X n as X (1) < X (2) < < X (n), he random variable X (k) is called he k-h order saisic Then we have he following heorem Theorem The pdf of he k-h order saisic X (k) is given by f k (x) (n k)! f(x)f k 1 (x)[1 F (x)] n k (12) Probabiliy of small inerval he proof of heorem If f is coninuous a x and δ > is small, hen he probabiliy ha a random variable X falls ino he small inerval [x, x + δ] is approximaed by δf(x) In differenial noaion, we can wrie P (x X x + dx) f(x)dx Now consider he k-h order saisic X (k) and he even ha x X (k) x + dx This even occurs when (k 1) of X i s are less han x and (n k) of X i s are greaer han x x + dx Since here are ( n k 1,1,n k) arrangemens for Xi s, we can obain he probabiliy of his even as which implies (12) f k (x)dx (n k)! (F (x))k 1 (f(x)dx)[1 F (x)] n k, Page 1 Special lecure/june 216

2 Bea disribuion In paricular when X 1,, X n be iid uniform random variables on [, 1], he pdf of he k-h order saisic X (k) becomes f k (x) (n k)! xk 1 (1 x) n k, x 1, which is called bea disribuion wih parameers α k and β n k + 1 Now consider he arrival imes T 1,, T n in our model and heir ordered saisics T (1) < < T (n) Then i is no hard o see ha T (k) has a bea disribuion wih (k, n + 1 k) Poisson approximaion The Poisson disribuion wih parameer λ (λ > ) has he frequency funcion λ λk p(k) e, k, 1, 2, and may be used as an approximaion for a binomial disribuion wih parameer (n, p) if n is large and p is small enough so ha np is a moderae number λ Le λ np Then he binomial frequency funcion becomes p(k) (n k)! λk 1 e λ λ λk 1 e ( ) k ( λ 1 λ ) n k λk n n as n ( (n k)!n 1 λ n ( 1 n) λ ) k k n In he previous model λ ( n) represens he average number of cusomers per hour If p s is small enough, we can apply he Poisson approximaion o ge λs n λs (λs)k P {N(s) k} e Problem 1 Suppose ha X and Y are independen random variables disribued as Poisson disribuions wih he respecive parameers α and β Le N X +Y Calculae he condiional probabiliy P (X k N n) Problem 2 Suppose ha a random variable N has a Poisson disribuion wih parameer λ, and ha a random variable X is condiionally disribued as a binomial disribuion wih parameer (n, p) given N n Le Y N X (a) Calculae P (X j, Y k) (b) Show ha boh X and Y have Poisson disribuions (c) Show ha X and Y are independen Poisson process Maybe a fixed size n of cusomers is no so realisic So we assume ha he oal size N of cusomers is disribued as a Poisson disribuion wih parameer (λ) Here (λ) represens he average oal size of cusomers over he inerval (, ) Le us compue Page 2 Special lecure/june 216

3 P {N(s) k} exacly: Noicing ha (11) becomes a condiional probabiliy here, we can compue P {N(s) k} nk P (N(s) k N n)p {N n} nk ( s ) k ( 1 s ) n k e λ (λ)n (n k)! e λ (λs) k nk (λ( s)) n k (n k)! λs (λs)k e So ha P {N(s) k} has a Poisson disribuion wih parameer λs Observe ha P {N(s) k} does no depend on and can be seen as a process couning up cusomers arriving by he ime s Thus, N(s) is called a Poisson process Problem 3 Le N(s), s, be a Poisson process as consruced as above (a) Show ha N() N(s) is disribued as a Poisson disribuion, and ha N() N(s) is independen of N(s) Then calculae E[(N() N(s))N(s)] (b) Using he formula Var(X) E[X 2 ] (E[X]) 2, calculae E[N(s) 2 ] Then find E[N(s)N()] Problem 4 Provided N() n, we can consider he ( arrival imes T (1), ), T (n) observed over T(k) (, ) (a) Find he condiional probabiliy G n (u) P u N() n on [, 1] (b) Show ha he cdf G n (u) has he bea densiy funcion wih (k, n + 1 k) Hin: In he above consrucion of Poisson process, we find ha he condiional probabiliy P (N(s) k N() n) has a binomial disribuion wih parameer (n, s ) for < s < Problem 5 Suppose ha cusomers arrive a a car dealership as a Poisson process wih average number λ of cusomers per hour, and ha a cusomer makes no decision (ie, no purchasing a car) wih probabiliy α >, independenly of oher cusomers Thus, none of he firs k cusomers purchases a car from he dealership wih probabily α k Wha is he probabiliy ha no car is sold by ime? Gamma disribued business hours Now we wan o change he assumpion on he arrival imes of cusomers Insead of he cusomers disribued uniformly over (, ), he waiing imes beween cusomers, he ime W 1 he firs cusomer arrives, he ime W 2 beween he firs cusomer and he second, and so on, are independenly and exponenially disribued wih parameer λ The successive waiing imes W 1, W 2,, are now iid exponenial random variables having he pdf { λe λx x ; f(x) x < Here he reciprocal λ 1 of he average number of cusomers par hour becomes he average waiing ime beween arrivals Thus, if he grocer likes o close his shop a he arrival of he (n + 1)h cusomer, such ime T n+1 is now a random variable Gamma disribuion The arrival ime of he kh cusomer T (k) W W k (13) Page 3 Special lecure/june 216

4 has a gamma disribuion wih parameer (k, λ) The pdf for gamma disribuion is given by where f() Γ(x) : λk Γ(k) k 1 e λ u x 1 e u du, x >, is called he gamma funcion When x k, i is simply Γ(k) We call he parameer k a shape parameer, because he change of k causes ha of he shape of densiy We call he parameer λ a scale parameer, because he change of λ merely rescales he densiy wihou changing is shape In paricular, he gamma disribuion wih k 1 becomes an exponenial disribuion Gamma disribuion and Poisson process The grocer has a mos k cusomers a he ime s if he (k + 1)h cusomer has no ye arrived This means, in erms of probabiliy, ha P {N(s) k} P {T (k+1) > s} for k, 1, (14) Here we claim by mahemaical inducion ha P {T (k+1) > s} k λs (λs)i e (15) i! i Clearly, P {N(s) } e λs P {T (1) > s} Now suppose ha (15) holds for k replaced by k 1 We have λe λx (λx) k P {T (k+1) > s} dx e λx (λx) k λe λx (λx) k 1 s + dx s s λs (λs)k k λs (λs)i e + P {T (k) > s} e, i! which has verified (15) Therefore, combining (14) and (15), we found ha P {N(s) k} has a Poisson disribuion wih parameer λs Gamma and bea disribuion Noice ha T (k) and T (n+1) T (k) W k W n+1 are independen and each disribued as a gamma disribuion wih respecive parameers (k, λ) and (n + 1 k, λ) And i is known ha i T (k) T (n+1) has a bea disribuion wih (k, n + 1 k) A doomed bus commuer (Feller, An Inroducion o Probabiliy Theory and Is Applicaions Vol 2, Secion 14, Waiing ime paradoxes) Timmy commues by he buses everyday The bus ransi auhoriy claims ha heir buses arrive in average every λ 1 1 minues Today he came o he bus sop a ime 66 (which is 5:pm measured from he sar of service a 6:am) How long is he expeced o wai for he nex bus? A sochasic model We can assume ha he successive waiing imes beween buses, say W 1, W 2,, are independen and exponenially disribued wih parameer λ Thus, he number Page 4 Special lecure/june 216

5 N() of buses having arrived by he ime has a Poisson disribuion wih parameer λ Le T (k) denoe he arrival ime of he kh bus; T (k) is again given by (13) Then his waiing ime V is formulaed as V : T (N()+1) Consider he even A : {V v} If N() occurs, hen A {N() } { < W 1 + v}, which gives P ( < W 1 + v) e λ e λ(+v) (1 e λv ) e λ (16) If N() k occurs for k 1, 2,, hen A {N() k} { T (k) < W k+1 + v T (k), T (k) < } Noice ha T (k) and W k+1 are independen, and herefore, hey have he join disribuion The waiing ime Now we can calculae f Wk+1,T (k) (x, y) λe λx λe λy (λy) k 1 P ( T (k) < W k+1 + v T (k), T (k) < ) f Wk+1,T (k) (x, y) dx dy {(x,y): y<x<+v y, y<} λe λy (λy) k 1 [e λ( y) e λ(+v y) ] dy (1 e λv ) e λ λ(λy) k 1 dy (1 e λv λ (λ)k ) e (17) By (16) (17), we obain P (V v) 1 e λv, where we have applied (λ) k k e λ Hence, V has an exponenial disribuion wih λ, and he expeced waiing ime E[V ] is λ 1 1 minues We can also observe ha P (V v, N() k) P (V v) P (N() k), and herefore, ha V and N() are independen Problem 6 Wha happens o he enire waiing ime U beween buses observed a he ime? This random variable is formulaed as U : T (N()+1) T (N()) By using an argumen similar o he above, verify ha { 1 (1 + λu)e λu if u < ; P (U u) 1 (1 + λ)e λu if u, and ha E[U ] (2 e λ )λ 1 This indicaes ha he waiing ime is much larger han he average λ 1 Hin: Le f (u) be he densiy funcion of U For he calculaion of expecaion we can use E[U ] uf (u) du f (u) du u dx dx f (u) du x P (U > x) dx Problem 7 The number of cusomers arriving a he grocer is a Poisson process wih average number λ of cusomers per hour Page 5 Special lecure/june 216

6 (a) Le T be he ime a which he firs cusomer arrives Wha is he disribuion of T? (b) Le > be fixed, and le T be he arrival ime of cusomer who shows up firs afer he ime Wha is he disribuion of T? Page 6 Special lecure/june 216

7 Summary of relaed disribuions Noe #1 Summary of relaed disribuions n Uniform on (, ) f(x) 1, < x < N(s) E[X] /2, Var(X) 2 /12 P {N(s) i} T (k) / T (1) s T (n) Binomial(n, p) ( ) n P {X i} p i (1 p) n i i E[X] np, Var(X) np(1 p) if p is small enough P {X i} e E[X] λ, Poisson(λ) P (N(s) k N() n) N() λ λi, i, 1, i! Var(X) λ Bea(k, n + 1 k) Γ(n + 1) f(x) Γ(k)Γ(n + 1 k) xk 1 (1 x) n k, < x < 1 E[X] k k(n + 1 k), Var(X) n + 1 (n + 1) 2 (n + 2) T (k) T (n+1) Gamma(n, λ) f(x) λe λx (λx) n 1, x Γ(n) E[X] n λ, Var(X) n λ 2 Exponenial(λ) f(x) λe λx, x E[X] 1 λ, Var(X) 1 λ 2 T (k) P {N(s) k} P {T (k+1) > s} N() n T (1) T (n) T (n+1) Page 7 Special lecure/june 216

8 Problem soluions Noe #1 Problem soluions Problem 1 Observe ha N is also a Poisson random variable wih parameer (α + β) Then we can calculae P (X k N n) P (X k, N n) P (N n) P (X k) P (Y n k) P (N n) ( ) ( ) k ( ) n k n α β k α + β α + β which is a binomial disribuion wih parameer Problem 2 (a) We can calculae ( n, α α+β P (X k, Y n k) P (N n) ) αk β βn k e α e (n k)! e (α+β) (α+β)n P (X j, Y k) P (X j, N j + k) P (X j N j + k) P (N j + k) ( j + k )p j (1 p) k λ λj+k (λp)j e e λ j (j + k)! j! (b) Using (a) we obain λ (λp)j P (X j) P (X j, Y k) e j! k (λ(1 p)) k k λp (λp)j e j! Similarly we can find ha Y has a Poisson disribuion wih parameer λ(1 p) (c) By applying (a) and (b), we have λp (λp)j P (X j, Y k) e j! which implies ha X and Y are independen λ(1 p) (λ(1 p))k e P (X j) P (Y k), Problem 3 (a) From he consrucion of Poisson process, have N() N(s) N N(s) In Problem 2 we found ha N N(s) has a Poisson disribuion wih parameer λ( s), and ha N(s) and N N(s) are independen Therefore, we have E[(N() N(s))N(s)] E[N() N(s)] E[N(s)] λ( s) λs (b) Since E[N(s) 2 ] λs + (λs) 2, we obain E[N(s)N()] λ 2 s + λs Problem 4 (a) Observe ha T (k) u if and only if N(u) k We obain n ( ) n G n (u) P (N(u) k N() n) u i (1 u) n i i (b) We can easily see ha g n (u) d du G n(u) ik (n k)!uk 1 (1 u) n k Γ(n + 1) Γ(k)Γ(n k + 1) uk 1 (1 u) n k Page 8 Special lecure/june 216

9 Problem soluions Noe #1 is he bea densiy funcion Problem 5 Le A be he even ha no car is sold Observe ha P (A N() k) α k Then we obain P (A) P (A N() k) P (N() k) k k α k λ (λ)k e Problem 6 Le B {U u} Case I: Suppose ha u < Then we have P (U u) P (B {N() k}) k P ( u T (k) <, T (k) < W k+1 u) k1 k1 u λe λy (λy) k 1 1 e λu λue λu Case II: Suppose ha u Then we have P (U u) P (B {N() k}) k P ( < W 1 u) + e λ e λu + k1 1 e λu λe λu Applying he formula in he hin, we obain E[U ] [e λu + λue λu ] du + u dy λe λx dx y e λ e λα e λ(1 α) P ( T (k) <, T (k) < W k+1 u) k1 λe λy (λy) k 1 u dy λe λx dx y [e λu + λe λu ] du (2 e λ )λ 1 Problem 7 (a) T T (1) W 1 has an exponenial disribuion wih λ (b) Using an exponenial random variable V wih λ, we can express T T (N()+1) + V, which has he densiy f(x) of shifed exponenial disribuion: { if x < ; f(x) λe λx if x Page 9 Special lecure/june 216

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

Introduction to Probability and Statistics Slides 4 Chapter 4

Introduction to Probability and Statistics Slides 4 Chapter 4 Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random

More information

5. Stochastic processes (1)

5. Stochastic processes (1) Lec05.pp S-38.45 - Inroducion o Teleraffic Theory Spring 2005 Conens Basic conceps Poisson process 2 Sochasic processes () Consider some quaniy in a eleraffic (or any) sysem I ypically evolves in ime randomly

More information

Homework 4 (Stats 620, Winter 2017) Due Tuesday Feb 14, in class Questions are derived from problems in Stochastic Processes by S. Ross.

Homework 4 (Stats 620, Winter 2017) Due Tuesday Feb 14, in class Questions are derived from problems in Stochastic Processes by S. Ross. Homework 4 (Sas 62, Winer 217) Due Tuesday Feb 14, in class Quesions are derived from problems in Sochasic Processes by S. Ross. 1. Le A() and Y () denoe respecively he age and excess a. Find: (a) P{Y

More information

TMA 4265 Stochastic Processes

TMA 4265 Stochastic Processes TMA 4265 Sochasic Processes Norges eknisk-naurvienskapelige universie Insiu for maemaiske fag Soluion - Exercise 8 Exercises from he ex book 5.2 The expeced service ime for one cusomer is 1/µ, due o he

More information

20. Applications of the Genetic-Drift Model

20. Applications of the Genetic-Drift Model 0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0

More information

Transform Techniques. Moment Generating Function

Transform Techniques. Moment Generating Function Transform Techniques A convenien way of finding he momens of a random variable is he momen generaing funcion (MGF). Oher ransform echniques are characerisic funcion, z-ransform, and Laplace ransform. Momen

More information

Answers to QUIZ

Answers to QUIZ 18441 Answers o QUIZ 1 18441 1 Le P be he proporion of voers who will voe Yes Suppose he prior probabiliy disribuion of P is given by Pr(P < p) p for 0 < p < 1 You ake a poll by choosing nine voers a random,

More information

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

Comparison between the Discrete and Continuous Time Models

Comparison between the Discrete and Continuous Time Models Comparison beween e Discree and Coninuous Time Models D. Sulsky June 21, 2012 1 Discree o Coninuous Recall e discree ime model Î = AIS Ŝ = S Î. Tese equaions ell us ow e populaion canges from one day o

More information

Statistical Distributions

Statistical Distributions Saisical Disribuions 1 Discree Disribuions 1 The uniform disribuion A random variable (rv) X has a uniform disribuion on he n-elemen se A = {x 1,x 2,,x n } if P (X = x) =1/n whenever x is in he se A The

More information

Final Spring 2007

Final Spring 2007 .615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o

More information

An random variable is a quantity that assumes different values with certain probabilities.

An random variable is a quantity that assumes different values with certain probabilities. Probabiliy The probabiliy PrA) of an even A is a number in [, ] ha represens how likely A is o occur. The larger he value of PrA), he more likely he even is o occur. PrA) means he even mus occur. PrA)

More information

Reliability of Technical Systems

Reliability of Technical Systems eliabiliy of Technical Sysems Main Topics Inroducion, Key erms, framing he problem eliabiliy parameers: Failure ae, Failure Probabiliy, Availabiliy, ec. Some imporan reliabiliy disribuions Componen reliabiliy

More information

Math 10B: Mock Mid II. April 13, 2016

Math 10B: Mock Mid II. April 13, 2016 Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.

More information

Avd. Matematisk statistik

Avd. Matematisk statistik Avd Maemaisk saisik TENTAMEN I SF294 SANNOLIKHETSTEORI/EXAM IN SF294 PROBABILITY THE- ORY WEDNESDAY THE 9 h OF JANUARY 23 2 pm 7 pm Examinaor : Timo Koski, el 79 7 34, email: jkoski@khse Tillåna hjälpmedel

More information

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t... Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger

More information

Basic notions of probability theory (Part 2)

Basic notions of probability theory (Part 2) Basic noions of probabiliy heory (Par 2) Conens o Basic Definiions o Boolean Logic o Definiions of probabiliy o Probabiliy laws o Random variables o Probabiliy Disribuions Random variables Random variables

More information

. Now define y j = log x j, and solve the iteration.

. Now define y j = log x j, and solve the iteration. Problem 1: (Disribued Resource Allocaion (ALOHA!)) (Adaped from M& U, Problem 5.11) In his problem, we sudy a simple disribued proocol for allocaing agens o shared resources, wherein agens conend for resources

More information

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based

More information

Discrete Markov Processes. 1. Introduction

Discrete Markov Processes. 1. Introduction Discree Markov Processes 1. Inroducion 1. Probabiliy Spaces and Random Variables Sample space. A model for evens: is a family of subses of such ha c (1) if A, hen A, (2) if A 1, A 2,..., hen A1 A 2...,

More information

Solution of Assignment #2

Solution of Assignment #2 Soluion of Assignmen #2 Insrucor: A. Simchi Quesion #1: a r 1 c i 7, and λ n c i n i 7 38.7.189 An approximae 95% confidence inerval for λ is given by ˆλ ± 1.96 ˆλ r.189 ± 1.96.189 7.47.315 Noe ha he above

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details! MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his

More information

MA 214 Calculus IV (Spring 2016) Section 2. Homework Assignment 1 Solutions

MA 214 Calculus IV (Spring 2016) Section 2. Homework Assignment 1 Solutions MA 14 Calculus IV (Spring 016) Secion Homework Assignmen 1 Soluions 1 Boyce and DiPrima, p 40, Problem 10 (c) Soluion: In sandard form he given firs-order linear ODE is: An inegraing facor is given by

More information

Chapter 7: Solving Trig Equations

Chapter 7: Solving Trig Equations Haberman MTH Secion I: The Trigonomeric Funcions Chaper 7: Solving Trig Equaions Le s sar by solving a couple of equaions ha involve he sine funcion EXAMPLE a: Solve he equaion sin( ) The inverse funcions

More information

6. Stochastic calculus with jump processes

6. Stochastic calculus with jump processes A) Trading sraegies (1/3) Marke wih d asses S = (S 1,, S d ) A rading sraegy can be modelled wih a vecor φ describing he quaniies invesed in each asse a each insan : φ = (φ 1,, φ d ) The value a of a porfolio

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214

More information

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

Stochastic Modelling in Finance - Solutions to sheet 8

Stochastic Modelling in Finance - Solutions to sheet 8 Sochasic Modelling in Finance - Soluions o shee 8 8.1 The price of a defaulable asse can be modeled as ds S = µ d + σ dw dn where µ, σ are consans, (W ) is a sandard Brownian moion and (N ) is a one jump

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE Topics MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES 2-6 3. FUNCTION OF A RANDOM VARIABLE 3.2 PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE 3.3 EXPECTATION AND MOMENTS

More information

Echocardiography Project and Finite Fourier Series

Echocardiography Project and Finite Fourier Series Echocardiography Projec and Finie Fourier Series 1 U M An echocardiagram is a plo of how a porion of he hear moves as he funcion of ime over he one or more hearbea cycles If he hearbea repeas iself every

More information

Chapter 6. Systems of First Order Linear Differential Equations

Chapter 6. Systems of First Order Linear Differential Equations Chaper 6 Sysems of Firs Order Linear Differenial Equaions We will only discuss firs order sysems However higher order sysems may be made ino firs order sysems by a rick shown below We will have a sligh

More information

arxiv: v1 [math.pr] 19 Feb 2011

arxiv: v1 [math.pr] 19 Feb 2011 A NOTE ON FELLER SEMIGROUPS AND RESOLVENTS VADIM KOSTRYKIN, JÜRGEN POTTHOFF, AND ROBERT SCHRADER ABSTRACT. Various equivalen condiions for a semigroup or a resolven generaed by a Markov process o be of

More information

STA 114: Statistics. Notes 2. Statistical Models and the Likelihood Function

STA 114: Statistics. Notes 2. Statistical Models and the Likelihood Function STA 114: Saisics Noes 2. Saisical Models and he Likelihood Funcion Describing Daa & Saisical Models A physicis has a heory ha makes a precise predicion of wha s o be observed in daa. If he daa doesn mach

More information

THE WAVE EQUATION. part hand-in for week 9 b. Any dilation v(x, t) = u(λx, λt) of u(x, t) is also a solution (where λ is constant).

THE WAVE EQUATION. part hand-in for week 9 b. Any dilation v(x, t) = u(λx, λt) of u(x, t) is also a solution (where λ is constant). THE WAVE EQUATION 43. (S) Le u(x, ) be a soluion of he wave equaion u u xx = 0. Show ha Q43(a) (c) is a. Any ranslaion v(x, ) = u(x + x 0, + 0 ) of u(x, ) is also a soluion (where x 0, 0 are consans).

More information

Christos Papadimitriou & Luca Trevisan November 22, 2016

Christos Papadimitriou & Luca Trevisan November 22, 2016 U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream

More information

Matlab and Python programming: how to get started

Matlab and Python programming: how to get started Malab and Pyhon programming: how o ge sared Equipping readers he skills o wrie programs o explore complex sysems and discover ineresing paerns from big daa is one of he main goals of his book. In his chaper,

More information

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004 ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform

More information

EXERCISES FOR SECTION 1.5

EXERCISES FOR SECTION 1.5 1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler

More information

f(s)dw Solution 1. Approximate f by piece-wise constant left-continuous non-random functions f n such that (f(s) f n (s)) 2 ds 0.

f(s)dw Solution 1. Approximate f by piece-wise constant left-continuous non-random functions f n such that (f(s) f n (s)) 2 ds 0. Advanced Financial Models Example shee 3 - Michaelmas 217 Michael Tehranchi Problem 1. Le f : [, R be a coninuous (non-random funcion and W a Brownian moion, and le σ 2 = f(s 2 ds and assume σ 2

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

Nature Neuroscience: doi: /nn Supplementary Figure 1. Spike-count autocorrelations in time.

Nature Neuroscience: doi: /nn Supplementary Figure 1. Spike-count autocorrelations in time. Supplemenary Figure 1 Spike-coun auocorrelaions in ime. Normalized auocorrelaion marices are shown for each area in a daase. The marix shows he mean correlaion of he spike coun in each ime bin wih he spike

More information

LECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS

LECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS LECTURE : GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS We will work wih a coninuous ime reversible Markov chain X on a finie conneced sae space, wih generaor Lf(x = y q x,yf(y. (Recall ha q

More information

Distribution of Estimates

Distribution of Estimates Disribuion of Esimaes From Economerics (40) Linear Regression Model Assume (y,x ) is iid and E(x e )0 Esimaion Consisency y α + βx + he esimaes approach he rue values as he sample size increases Esimaion

More information

in Engineering Prof. Dr. Michael Havbro Faber ETH Zurich, Switzerland Swiss Federal Institute of Technology

in Engineering Prof. Dr. Michael Havbro Faber ETH Zurich, Switzerland Swiss Federal Institute of Technology Risk and Saey in Engineering Pro. Dr. Michael Havbro Faber ETH Zurich, Swizerland Conens o Today's Lecure Inroducion o ime varian reliabiliy analysis The Poisson process The ormal process Assessmen o he

More information

Lecture 4 Notes (Little s Theorem)

Lecture 4 Notes (Little s Theorem) Lecure 4 Noes (Lile s Theorem) This lecure concerns one of he mos imporan (and simples) heorems in Queuing Theory, Lile s Theorem. More informaion can be found in he course book, Bersekas & Gallagher,

More information

Comparing Means: t-tests for One Sample & Two Related Samples

Comparing Means: t-tests for One Sample & Two Related Samples Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion

More information

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t M ah 5 2 7 Fall 2 0 0 9 L ecure 1 0 O c. 7, 2 0 0 9 Hamilon- J acobi Equaion: Explici Formulas In his lecure we ry o apply he mehod of characerisics o he Hamilon-Jacobi equaion: u + H D u, x = 0 in R n

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Math 116 Practice for Exam 2

Math 116 Practice for Exam 2 Mah 6 Pracice for Exam Generaed Ocober 3, 7 Name: SOLUTIONS Insrucor: Secion Number:. This exam has 5 quesions. Noe ha he problems are no of equal difficuly, so you may wan o skip over and reurn o a problem

More information

Math 333 Problem Set #2 Solution 14 February 2003

Math 333 Problem Set #2 Solution 14 February 2003 Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial

More information

Asymptotic Equipartition Property - Seminar 3, part 1

Asymptotic Equipartition Property - Seminar 3, part 1 Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

Lecture 6: Wiener Process

Lecture 6: Wiener Process Lecure 6: Wiener Process Eric Vanden-Eijnden Chapers 6, 7 and 8 offer a (very) brief inroducion o sochasic analysis. These lecures are based in par on a book projec wih Weinan E. A sandard reference for

More information

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion

More information

Approximation Algorithms for Unique Games via Orthogonal Separators

Approximation Algorithms for Unique Games via Orthogonal Separators Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define

More information

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

INTRODUCTION TO MACHINE LEARNING 3RD EDITION ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class

More information

Homework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross.

Homework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross. Homework (Sas 6, Winer 7 Due Tuesday April 8, in class Quesions are derived from problems in Sochasic Processes by S. Ross.. A sochasic process {X(, } is said o be saionary if X(,..., X( n has he same

More information

Appendix to Creating Work Breaks From Available Idleness

Appendix to Creating Work Breaks From Available Idleness Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember

More information

Weyl sequences: Asymptotic distributions of the partition lengths

Weyl sequences: Asymptotic distributions of the partition lengths ACTA ARITHMETICA LXXXVIII.4 (999 Weyl sequences: Asympoic disribuions of he pariion lenghs by Anaoly Zhigljavsky (Cardiff and Iskander Aliev (Warszawa. Inroducion: Saemen of he problem and formulaion of

More information

Maintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011

Maintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011 Mainenance Models Prof Rober C Leachman IEOR 3, Mehods of Manufacuring Improvemen Spring, Inroducion The mainenance of complex equipmen ofen accouns for a large porion of he coss associaed wih ha equipmen

More information

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals

More information

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t Exercise 7 C P = α + β R P + u C = αp + βr + v (a) (b) C R = α P R + β + w (c) Assumpions abou he disurbances u, v, w : Classical assumions on he disurbance of one of he equaions, eg. on (b): E(v v s P,

More information

Bernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016

Bernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016 UNIVERSITÁ DEGLI STUDI DI PADOVA, DIPARTIMENTO DI MATEMATICA TULLIO LEVI-CIVITA Bernoulli numbers Francesco Chiai, Maeo Pinonello December 5, 206 During las lessons we have proved he Las Ferma Theorem

More information

Expert Advice for Amateurs

Expert Advice for Amateurs Exper Advice for Amaeurs Ernes K. Lai Online Appendix - Exisence of Equilibria The analysis in his secion is performed under more general payoff funcions. Wihou aking an explici form, he payoffs of he

More information

6.003 Homework #9 Solutions

6.003 Homework #9 Solutions 6.003 Homework #9 Soluions Problems. Fourier varieies a. Deermine he Fourier series coefficiens of he following signal, which is periodic in 0. x () 0 3 0 a 0 5 a k a k 0 πk j3 e 0 e j πk 0 jπk πk e 0

More information

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x . 1 Mah 211 Homework #3 February 2, 2001 2.4.3. y + (2/x)y = (cos x)/x 2 Answer: Compare y + (2/x) y = (cos x)/x 2 wih y = a(x)x + f(x)and noe ha a(x) = 2/x. Consequenly, an inegraing facor is found wih

More information

Linear Cryptanalysis

Linear Cryptanalysis Linear Crypanalysis T-79.550 Crypology Lecure 5 February 6, 008 Kaisa Nyberg Linear Crypanalysis /36 SPN A Small Example Linear Crypanalysis /36 Linear Approximaion of S-boxes Linear Crypanalysis 3/36

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and

More information

T. J. HOLMES AND T. J. KEHOE INTERNATIONAL TRADE AND PAYMENTS THEORY FALL 2011 EXAMINATION

T. J. HOLMES AND T. J. KEHOE INTERNATIONAL TRADE AND PAYMENTS THEORY FALL 2011 EXAMINATION ECON 841 T. J. HOLMES AND T. J. KEHOE INTERNATIONAL TRADE AND PAYMENTS THEORY FALL 211 EXAMINATION This exam has wo pars. Each par has wo quesions. Please answer one of he wo quesions in each par for a

More information

Right tail. Survival function

Right tail. Survival function Densiy fi (con.) Lecure 4 The aim of his lecure is o improve our abiliy of densiy fi and knowledge of relaed opics. Main issues relaed o his lecure are: logarihmic plos, survival funcion, HS-fi mixures,

More information

PROBLEMS FOR MATH 162 If a problem is starred, all subproblems are due. If only subproblems are starred, only those are due. SLOPES OF TANGENT LINES

PROBLEMS FOR MATH 162 If a problem is starred, all subproblems are due. If only subproblems are starred, only those are due. SLOPES OF TANGENT LINES PROBLEMS FOR MATH 6 If a problem is sarred, all subproblems are due. If onl subproblems are sarred, onl hose are due. 00. Shor answer quesions. SLOPES OF TANGENT LINES (a) A ball is hrown ino he air. Is

More information

Stochastic Model for Cancer Cell Growth through Single Forward Mutation

Stochastic Model for Cancer Cell Growth through Single Forward Mutation Journal of Modern Applied Saisical Mehods Volume 16 Issue 1 Aricle 31 5-1-2017 Sochasic Model for Cancer Cell Growh hrough Single Forward Muaion Jayabharahiraj Jayabalan Pondicherry Universiy, jayabharahi8@gmail.com

More information

Lecture 33: November 29

Lecture 33: November 29 36-705: Inermediae Saisics Fall 2017 Lecurer: Siva Balakrishnan Lecure 33: November 29 Today we will coninue discussing he boosrap, and hen ry o undersand why i works in a simple case. In he las lecure

More information

Random Processes 1/24

Random Processes 1/24 Random Processes 1/24 Random Process Oher Names : Random Signal Sochasic Process A Random Process is an exension of he concep of a Random variable (RV) Simples View : A Random Process is a RV ha is a Funcion

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

Average Number of Lattice Points in a Disk

Average Number of Lattice Points in a Disk Average Number of Laice Poins in a Disk Sujay Jayakar Rober S. Sricharz Absrac The difference beween he number of laice poins in a disk of radius /π and he area of he disk /4π is equal o he error in he

More information

dt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3.

dt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3. Mah Rahman Exam Review Soluions () Consider he IVP: ( 4)y 3y + 4y = ; y(3) = 0, y (3) =. (a) Please deermine he longes inerval for which he IVP is guaraneed o have a unique soluion. Soluion: The disconinuiies

More information

Lecture 2 April 04, 2018

Lecture 2 April 04, 2018 Sas 300C: Theory of Saisics Spring 208 Lecure 2 April 04, 208 Prof. Emmanuel Candes Scribe: Paulo Orensein; edied by Sephen Baes, XY Han Ouline Agenda: Global esing. Needle in a Haysack Problem 2. Threshold

More information

2.7. Some common engineering functions. Introduction. Prerequisites. Learning Outcomes

2.7. Some common engineering functions. Introduction. Prerequisites. Learning Outcomes Some common engineering funcions 2.7 Inroducion This secion provides a caalogue of some common funcions ofen used in Science and Engineering. These include polynomials, raional funcions, he modulus funcion

More information

2. Nonlinear Conservation Law Equations

2. Nonlinear Conservation Law Equations . Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear

More information

ACE 564 Spring Lecture 7. Extensions of The Multiple Regression Model: Dummy Independent Variables. by Professor Scott H.

ACE 564 Spring Lecture 7. Extensions of The Multiple Regression Model: Dummy Independent Variables. by Professor Scott H. ACE 564 Spring 2006 Lecure 7 Exensions of The Muliple Regression Model: Dumm Independen Variables b Professor Sco H. Irwin Readings: Griffihs, Hill and Judge. "Dumm Variables and Varing Coefficien Models

More information

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.

More information

Math 106: Review for Final Exam, Part II. (x x 0 ) 2 = !

Math 106: Review for Final Exam, Part II. (x x 0 ) 2 = ! Mah 6: Review for Final Exam, Par II. Use a second-degree Taylor polynomial o esimae 8. We choose f(x) x and x 7 because 7 is he perfec cube closes o 8. f(x) x / f(7) f (x) x / f (7) x / 7 / 7 f (x) 9

More information

U( θ, θ), U(θ 1/2, θ + 1/2) and Cauchy (θ) are not exponential families. (The proofs are not easy and require measure theory. See the references.

U( θ, θ), U(θ 1/2, θ + 1/2) and Cauchy (θ) are not exponential families. (The proofs are not easy and require measure theory. See the references. Lecure 5 Exponenial Families Exponenial families, also called Koopman-Darmois families, include a quie number of well known disribuions. Many nice properies enjoyed by exponenial families allow us o provide

More information

Predator - Prey Model Trajectories and the nonlinear conservation law

Predator - Prey Model Trajectories and the nonlinear conservation law Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories

More information

Lecture 4: Processes with independent increments

Lecture 4: Processes with independent increments Lecure 4: Processes wih independen incremens 1. A Wienner process 1.1 Definiion of a Wienner process 1.2 Reflecion principle 1.3 Exponenial Brownian moion 1.4 Exchange of measure (Girsanov heorem) 1.5

More information

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux Gues Lecures for Dr. MacFarlane s EE3350 Par Deux Michael Plane Mon., 08-30-2010 Wrie name in corner. Poin ou his is a review, so I will go faser. Remind hem o go lisen o online lecure abou geing an A

More information

Basic definitions and relations

Basic definitions and relations Basic definiions and relaions Lecurer: Dmiri A. Molchanov E-mail: molchan@cs.u.fi hp://www.cs.u.fi/kurssi/tlt-2716/ Kendall s noaion for queuing sysems: Arrival processes; Service ime disribuions; Examples.

More information

556: MATHEMATICAL STATISTICS I

556: MATHEMATICAL STATISTICS I 556: MATHEMATICAL STATISTICS I INEQUALITIES 5.1 Concenraion and Tail Probabiliy Inequaliies Lemma (CHEBYCHEV S LEMMA) c > 0, If X is a random variable, hen for non-negaive funcion h, and P X [h(x) c] E

More information

Chapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws

Chapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws Chaper 5: Phenomena Phenomena: The reacion (aq) + B(aq) C(aq) was sudied a wo differen emperaures (98 K and 35 K). For each emperaure he reacion was sared by puing differen concenraions of he 3 species

More information

SELBERG S CENTRAL LIMIT THEOREM ON THE CRITICAL LINE AND THE LERCH ZETA-FUNCTION. II

SELBERG S CENTRAL LIMIT THEOREM ON THE CRITICAL LINE AND THE LERCH ZETA-FUNCTION. II SELBERG S CENRAL LIMI HEOREM ON HE CRIICAL LINE AND HE LERCH ZEA-FUNCION. II ANDRIUS GRIGUIS Deparmen of Mahemaics Informaics Vilnius Universiy, Naugarduko 4 035 Vilnius, Lihuania rius.griguis@mif.vu.l

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Challenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k

Challenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k Challenge Problems DIS 03 and 0 March 6, 05 Choose one of he following problems, and work on i in your group. Your goal is o convince me ha your answer is correc. Even if your answer isn compleely correc,

More information

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15.

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15. SMT Calculus Tes Soluions February 5,. Le f() = and le g() =. Compue f ()g (). Answer: 5 Soluion: We noe ha f () = and g () = 6. Then f ()g () =. Plugging in = we ge f ()g () = 6 = 3 5 = 5.. There is a

More information

dy dx = xey (a) y(0) = 2 (b) y(1) = 2.5 SOLUTION: See next page

dy dx = xey (a) y(0) = 2 (b) y(1) = 2.5 SOLUTION: See next page Assignmen 1 MATH 2270 SOLUTION Please wrie ou complee soluions for each of he following 6 problems (one more will sill be added). You may, of course, consul wih your classmaes, he exbook or oher resources,

More information

Homework sheet Exercises done during the lecture of March 12, 2014

Homework sheet Exercises done during the lecture of March 12, 2014 EXERCISE SESSION 2A FOR THE COURSE GÉOMÉTRIE EUCLIDIENNE, NON EUCLIDIENNE ET PROJECTIVE MATTEO TOMMASINI Homework shee 3-4 - Exercises done during he lecure of March 2, 204 Exercise 2 Is i rue ha he parameerized

More information

Inventory Control of Perishable Items in a Two-Echelon Supply Chain

Inventory Control of Perishable Items in a Two-Echelon Supply Chain Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan

More information