Good luck! (W (t(j + 1)) W (tj)), n 1.

Size: px
Start display at page:

Download "Good luck! (W (t(j + 1)) W (tj)), n 1."

Transcription

1 Av Matematisk statistik TENTAMEN I SF940 SANNOLIKHETSTEORI/EXAM IN SF940 PROBABILITY THE- ORY, WEDNESDAY OCTOBER 5, 07, Examinator : Boualem Djehiche, tel , boualem@kthse Tillåtna hjälpmeel/permitte means of assistance: Appenix in A Gut: An Intermeiate Course in Probability, Formulas for probability theory SF940, L Råe & B Westergren: Mathematics Hanbook for Science an Engineering an pocket calculator All use notation must be explaine an efine Reasoning an the calculations must be so etaile that they are easy to follow Each problem yiels max 0 p You may apply results state in a part of an exam question to another part of the exam question even if you have not solve the first part A preliminarily lower boun of 5 points will guarantee a passing result If you have receive 5 bonus points from the home assignments, you may skip Problem a) If you have receive 0 bonus points, you may skip the whole Problem Solutions to the exam questions will be available at starting from Monay October 30, 07 Goo luck! Problem Let W t)) t 0 be a Wiener process Set, for t > 0, X n := n j + W tj + )) W tj)), n a) Determine the istribution of X n 5 p) b) Show that X n converges in istribution to some ranom variable X, as n Fin the istribution of the limit ranom variable X 5 p) Hint: k= k = π 6 ) Problem Suppose that the joint characteristic function of X an Y equals ϕ X,Y s, t) = E[e isx+ity ] = exp αe is ) + βe it ) + γe is+t) ) ), with α > 0, β > 0, γ > 0 a) Show that X an Y both have a Poisson istribution, but that X + Y oes not 6 p)

2 cont exam sf940 Fall 06 b) Are X an Y inepenent? 4 p) Problem 3 Let X, X, be inepenent, U0, )-istribute ranom variables, an let N Poλ) be inepenent of X, X, Set Y N = 0 when N = 0) Y N := max{x, X,, X N } a) Determine the istribution function an the characteristic function of Y N 4 p) b) Show that E[Y N ] as λ 3 p) c) Show that λ Y N ) converges in istribution as λ, an etermine the limit istribution 3 p) Problem 4 Let X an Y be ranom variables such that E[X] = 0, VarX) = σ > 0 an Y X = x Nx, a ) ) X a) Determine a istribution of X such that the vector becomes normally istribute with mean µ = an covariance matrix Λ Determine µ, µ an Λ 6 ) Y µ p) µ b) Compute E[e X Y = y] 4 p) Problem 5 Let X, X, be inepenent, U, )-istribute ranom variables, a) Show that the limit in probability of max j n X j is, an of min j n X j is -, as n 6 p) b) Set Y n := n j= X j n max X j j n Show that Y n converges in istribution as n a etermine the limiting istribution 4 p)

3 Av Matematisk statistik Suggeste solutions to the exam Wenesay October 5, 07 The problems can be solve using other methos than the suggeste below Problem a) The Wiener process has the inepenent increments property This implies that the ranom variables Y j := W tj) W tj )), j =, n, are inepenent Moreover, Y j Y N0, t) j N0, t ) Thus, j+ j+) X n = n Y j j + N n 0, t b) We may use the characteristic function to see that ) X n N 0, t = N j + ) ) j + ) ) 0, π t 6 Problem a) We have X Poα + γ) an Y Poβ + γ), since ϕ X s) = ϕ X,Y s, 0) = exp {α + γ)e is )}, ϕ Y t) = ϕ X,Y 0, t) = exp {β + γ)e it )} To fin the istribution of X + Y, we compute its characteristic function: ϕ X+Y s) = ϕ X,Y s, s) = exp {α + β)e is ) + γe is )} Clearly, it is not of the form exp {θe is )}, for some θ > 0 X +Y is not Poisson istribute b) X an Y are not inepenent, since ϕ X,Y s, t) ϕ X s)ϕ Y t) Problem 3 First note that if X U0, ) then its istribution function is F X x) = x, x 0, ) Moreover, the probability generation function of N Poλ) is g N t) = E[t N ] = e λt ) Since the X, X, are ii U0, ) an are inepenent of N, by conitioning on N, we have F YN x) = P max{x, X,, X N } x) = E[F X x)) N ] = g N F X x)) = e λx )

4 cont exam sf940 Fall 06 More precisely, 0 if x 0, F YN x) = e λx ) if 0 < x <, if x Thus, F YN has two parts: a egenerate part, 0, which correspons to the case where Y N = 0 which occurs when N = 0) an a smooth part, e λx ) when x > 0 To obtain the characteristic function, we first erive the ifferential of the smooth part of F YN x) This is We have ϕ YN t) = E[e ity N ] = b) E[Y N ] = i ϕ Y N 0) = λ c) We have e λx ) ) x = e itx F YN x) = P N = 0)+ { λe λx ) if 0 < x <, 0 elsewhere 0 e itx λe λx ) x = e λ + λ e it e λ) it + λ e λ ) E[Y N ] as λ ϕ λ YN )t) = E[e itλ Y N ) ] = e itλ E[e itλy N ] = e itλ ϕ YN tλ) = ) e λ it) it Since e λ it) = e λ 0, as λ, it hols that e λ it) 0, as λ Thus, λ Y N ) Exp) ϕ λ YN )t) it = ϕ Exp)t) Problem 4 a) We compute the characteristic function of X, Y ) in two ways: First, we use conitioning to obtain ϕ X,Y s, t) := E[e isx+ity ] = E[E[e isx+ity X]] = E[e isx E[e ity X]] = Y X = x Nx, a )) That is = E[e isx e itx a t ] = e a t E[e is+t)x ] E[e is+t)x ] = e a t ϕx,y s, t) Next, we use the assumption ) that X, Y ) Nµ, Λ), where µ = µ, µ ), with µ = E[X] = σ c 0, an Λ = c b, where σ = VarX) an c := CovX, Y ), b = VarY ) to be etermine together with µ = E[Y ] We have ϕ X,Y s, t) = exp { isµ + tµ ) σ s + b t + cst) } = µ = 0) = exp { itµ σ s + b t + cst) }

5 cont exam sf940 Fall 06 3 { E[e is+t)x ] = exp itµ } σ s + b a )t + cst) The assumption that X, Y ) Nµ, Λ) implies that X NE[X], VarX)) = N0, σ ) E[e is+t)x ] = exp { } σ s + t) Thus, we shoul have e σ s+t) = exp { itµ } σ s + b a )t + cst), s, t Ientifying the coefficients, we obtain that µ = 0, c = σ an b = a +σ Hence, X, Y ) Nµ, Λ), where ) ) 0 σ σ µ =, Λ = 0 σ a + σ b) To compute E[e X Y = y], we note that X Y = y Nµ, σ ), where µ = 0 + σ y 0) = σ a + σ E[e X Y = y] = e µ + σ = exp σ a + σ y, σ = σ σ4 a + σ a + σ y + σ ) σ4 a + σ ) Problem 5 Before, answering a) an b), we note that if X U, ) then F X x) = P X x) = x +, < x <, E[X] = 0, VarX) = /3 a) Pick ɛ > 0 an set X ) := min j n X j an X n) := max j n we have P X n) > ɛ) = P X n) > + ɛ) + P X n) < ɛ) But, since all X j, ), then X n), ) This implies that P X n) > + ɛ) = 0 Thus, ) n ɛ P X n) > ɛ) = P X n) < ɛ) = X js are ii) = F X ɛ)) n = n + ɛ) n = This, in turn suggest that 0 < ɛ < otherwise we get negative probabilities), which implies P that P X n) > ɛ) 0 as n, ie X n) We have P X ) + > ɛ) = P X ) > ɛ ) + P X ) < ɛ + ))

6 cont exam sf940 Fall 06 4 But, P X ) < ɛ + )) = 0, as all X j, ) Moreover, ie X ) P X ) > ɛ ) = F X ɛ )) n = P + ɛ ) n = ) n ɛ P X ) + > ɛ) = 0, n, b) By the Central Limit Theorem, it hols that n n j= X j X n) P Use Cramèr-Slutsky s theorem to obtain Y n N 0, ) 3 ) n ɛ N0, ) Moreover, by a) 3

Good luck! Problem 1. (b) The random variables X 1 and X 2 are independent and N(0, 1)-distributed. Show that the random variables X 1

Good luck! Problem 1. (b) The random variables X 1 and X 2 are independent and N(0, 1)-distributed. Show that the random variables X 1 Avd. Matematisk statistik TETAME I SF2940 SAOLIKHETSTEORI/EXAM I SF2940 PROBABILITY THE- ORY, WEDESDAY OCTOBER 26, 2016, 08.00-13.00. Examinator : Boualem Djehiche, tel. 08-7907875, email: boualem@kth.se

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

Avd. Matematisk statistik

Avd. Matematisk statistik Avd. Matematisk statistik TENTAMEN I SF940 SANNOLIKHETSTEORI/EXAM IN SF940 PROBABILITY THE- ORY TUESDAY THE 9 th OF OCTOBER 03 08.00 a.m. 0.00 p.m. Examinator : Timo Koski, tel. 070 370047, email: tjtkoski@kth.se

More information

1. Aufgabenblatt zur Vorlesung Probability Theory

1. Aufgabenblatt zur Vorlesung Probability Theory 24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f

More information

Lycka till!

Lycka till! Avd. Matematisk statistik TENTAMEN I SF294 SANNOLIKHETSTEORI/EXAM IN SF294 PROBABILITY THE- ORY MONDAY THE 14 T H OF JANUARY 28 14. p.m. 19. p.m. Examinator : Timo Koski, tel. 79 71 34, e-post: timo@math.kth.se

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

Transforms. Convergence of probability generating functions. Convergence of characteristic functions functions

Transforms. Convergence of probability generating functions. Convergence of characteristic functions functions Transforms For non-negative integer value ranom variables, let the probability generating function g X : [0, 1] [0, 1] be efine by g X (t) = E(t X ). The moment generating function ψ X (t) = E(e tx ) is

More information

1 Math 285 Homework Problem List for S2016

1 Math 285 Homework Problem List for S2016 1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:

More information

3.6. Let s write out the sample space for this random experiment:

3.6. Let s write out the sample space for this random experiment: STAT 5 3 Let s write out the sample space for this ranom experiment: S = {(, 2), (, 3), (, 4), (, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)} This sample space assumes the orering of the balls

More information

Statistics STAT:5100 (22S:193), Fall Sample Final Exam B

Statistics STAT:5100 (22S:193), Fall Sample Final Exam B Statistics STAT:5 (22S:93), Fall 25 Sample Final Exam B Please write your answers in the exam books provided.. Let X, Y, and Y 2 be independent random variables with X N(µ X, σ 2 X ) and Y i N(µ Y, σ 2

More information

Applications of the Wronskian to ordinary linear differential equations

Applications of the Wronskian to ordinary linear differential equations Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.

More information

Spring 2016 Network Science

Spring 2016 Network Science Spring 206 Network Science Sample Problems for Quiz I Problem [The Application of An one-imensional Poisson Process] Suppose that the number of typographical errors in a new text is Poisson istribute with

More information

under the null hypothesis, the sign test (with continuity correction) rejects H 0 when α n + n 2 2.

under the null hypothesis, the sign test (with continuity correction) rejects H 0 when α n + n 2 2. Assignment 13 Exercise 8.4 For the hypotheses consiere in Examples 8.12 an 8.13, the sign test is base on the statistic N + = #{i : Z i > 0}. Since 2 n(n + /n 1) N(0, 1) 2 uner the null hypothesis, the

More information

Calculus and optimization

Calculus and optimization Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function

More information

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy, NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which

More information

Lecture 1: Review of Basic Asymptotic Theory

Lecture 1: Review of Basic Asymptotic Theory Lecture 1: Instructor: Department of Economics Stanfor University Prepare by Wenbo Zhou, Renmin University Basic Probability Theory Takeshi Amemiya, Avance Econometrics, 1985, Harvar University Press.

More information

Exercises and Answers to Chapter 1

Exercises and Answers to Chapter 1 Exercises and Answers to Chapter The continuous type of random variable X has the following density function: a x, if < x < a, f (x), otherwise. Answer the following questions. () Find a. () Obtain mean

More information

LECTURE NOTES ON DVORETZKY S THEOREM

LECTURE NOTES ON DVORETZKY S THEOREM LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.

More information

Formulas for probability theory and linear models SF2941

Formulas for probability theory and linear models SF2941 Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms

More information

Mathcad Lecture #5 In-class Worksheet Plotting and Calculus

Mathcad Lecture #5 In-class Worksheet Plotting and Calculus Mathca Lecture #5 In-class Worksheet Plotting an Calculus At the en of this lecture, you shoul be able to: graph expressions, functions, an matrices of ata format graphs with titles, legens, log scales,

More information

SYDE 112, LECTURE 1: Review & Antidifferentiation

SYDE 112, LECTURE 1: Review & Antidifferentiation SYDE 112, LECTURE 1: Review & Antiifferentiation 1 Course Information For a etaile breakown of the course content an available resources, see the Course Outline. Other relevant information for this section

More information

CLARK-OCONE FORMULA BY THE S-TRANSFORM ON THE POISSON WHITE NOISE SPACE

CLARK-OCONE FORMULA BY THE S-TRANSFORM ON THE POISSON WHITE NOISE SPACE CLARK-OCONE FORMULA BY THE S-TRANSFORM ON THE POISSON WHITE NOISE SPACE YUH-JIA LEE*, NICOLAS PRIVAULT, AND HSIN-HUNG SHIH* Abstract. Given ϕ a square-integrable Poisson white noise functionals we show

More information

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics. MATH A Test #2. June 25, 2014 SOLUTIONS

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics. MATH A Test #2. June 25, 2014 SOLUTIONS YORK UNIVERSITY Faculty of Science Department of Mathematics an Statistics MATH 505 6.00 A Test # June 5, 04 SOLUTIONS Family Name (print): Given Name: Stuent No: Signature: INSTRUCTIONS:. Please write

More information

Some Examples. Uniform motion. Poisson processes on the real line

Some Examples. Uniform motion. Poisson processes on the real line Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]

More information

Final Exam Study Guide and Practice Problems Solutions

Final Exam Study Guide and Practice Problems Solutions Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

Lecture 10: October 30, 2017

Lecture 10: October 30, 2017 Information an Coing Theory Autumn 2017 Lecturer: Mahur Tulsiani Lecture 10: October 30, 2017 1 I-Projections an applications In this lecture, we will talk more about fining the istribution in a set Π

More information

Solutions to Math 41 Second Exam November 4, 2010

Solutions to Math 41 Second Exam November 4, 2010 Solutions to Math 41 Secon Exam November 4, 2010 1. (13 points) Differentiate, using the metho of your choice. (a) p(t) = ln(sec t + tan t) + log 2 (2 + t) (4 points) Using the rule for the erivative of

More information

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing

More information

Levy Process and Infinitely Divisible Law

Levy Process and Infinitely Divisible Law Stat205B: Probability Theory (Spring 2003) Lecture: 26 Levy Process an Infinitely Divisible Law Lecturer: James W. Pitman Scribe: Bo Li boli@stat.berkeley.eu Levy Processes an Infinitely Divisible Law

More information

Financial Time Series Analysis Week 5

Financial Time Series Analysis Week 5 Financial Time Series Analysis Week 5 25 Estimation in AR moels Central Limit Theorem for µ in AR() Moel Recall : If X N(µ, σ 2 ), normal istribute ranom variable with mean µ an variance σ 2, then X µ

More information

The Exact Form and General Integrating Factors

The Exact Form and General Integrating Factors 7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily

More information

Linear and quadratic approximation

Linear and quadratic approximation Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function

More information

Two hours. Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER. 14 January :45 11:45

Two hours. Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER. 14 January :45 11:45 Two hours Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER PROBABILITY 2 14 January 2015 09:45 11:45 Answer ALL four questions in Section A (40 marks in total) and TWO of the THREE questions

More information

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae

More information

Solution to the exam in TFY4230 STATISTICAL PHYSICS Wednesday december 1, 2010

Solution to the exam in TFY4230 STATISTICAL PHYSICS Wednesday december 1, 2010 NTNU Page of 6 Institutt for fysikk Fakultet for fysikk, informatikk og matematikk This solution consists of 6 pages. Solution to the exam in TFY423 STATISTICAL PHYSICS Wenesay ecember, 2 Problem. Particles

More information

1 Parametric Bessel Equation and Bessel-Fourier Series

1 Parametric Bessel Equation and Bessel-Fourier Series 1 Parametric Bessel Equation an Bessel-Fourier Series Recall the parametric Bessel equation of orer n: x 2 y + xy + (a 2 x 2 n 2 )y = (1.1) The general solution is given by y = J n (ax) +Y n (ax). If we

More information

STABLE DISTRIBUTIONS

STABLE DISTRIBUTIONS STABLE DISTRIBUTIONS SVANTE JANSON Abstract. We give some explicit calculations for stable istributions an convergence to them, mainly base on less explicit results in Feller [3]. The main purpose is to

More information

Introduction to Markov Processes

Introduction to Markov Processes Introuction to Markov Processes Connexions moule m44014 Zzis law Gustav) Meglicki, Jr Office of the VP for Information Technology Iniana University RCS: Section-2.tex,v 1.24 2012/12/21 18:03:08 gustav

More information

ECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes

ECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes ECE353: Probability and Random Processes Lecture 18 - Stochastic Processes Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu From RV

More information

Improved Rate-Based Pull and Push Strategies in Large Distributed Networks

Improved Rate-Based Pull and Push Strategies in Large Distributed Networks Improve Rate-Base Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout Department of Mathematics an Computer Science University of Antwerp - imins Mielheimlaan, B-00 Antwerp,

More information

Potential due to thin disk

Potential due to thin disk Stellar Dynamics & Structure of Galaxies hanout #9 Potential ue to thin isk H

More information

MATH c UNIVERSITY OF LEEDS Examination for the Module MATH2715 (January 2015) STATISTICAL METHODS. Time allowed: 2 hours

MATH c UNIVERSITY OF LEEDS Examination for the Module MATH2715 (January 2015) STATISTICAL METHODS. Time allowed: 2 hours MATH2750 This question paper consists of 8 printed pages, each of which is identified by the reference MATH275. All calculators must carry an approval sticker issued by the School of Mathematics. c UNIVERSITY

More information

Linear First-Order Equations

Linear First-Order Equations 5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)

More information

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an

More information

Econometrics I. September, Part I. Department of Economics Stanford University

Econometrics I. September, Part I. Department of Economics Stanford University Econometrics I Deartment of Economics Stanfor University Setember, 2008 Part I Samling an Data Poulation an Samle. ineenent an ientical samling. (i.i..) Samling with relacement. aroximates samling without

More information

SPECIALIST MATHEMATICS

SPECIALIST MATHEMATICS Victorian Certificate of Eucation 07 SUPERVISOR TO ATTACH PROCESSING LABEL HERE Letter STUDENT NUMBER SPECIALIST MATHEMATICS Written examination Friay 0 November 07 Reaing time: 9.00 am to 9.5 am (5 minutes)

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

Variance reduction. Michel Bierlaire. Transport and Mobility Laboratory. Variance reduction p. 1/18

Variance reduction. Michel Bierlaire. Transport and Mobility Laboratory. Variance reduction p. 1/18 Variance reduction p. 1/18 Variance reduction Michel Bierlaire michel.bierlaire@epfl.ch Transport and Mobility Laboratory Variance reduction p. 2/18 Example Use simulation to compute I = 1 0 e x dx We

More information

SYMPLECTIC GEOMETRY: LECTURE 3

SYMPLECTIC GEOMETRY: LECTURE 3 SYMPLECTIC GEOMETRY: LECTURE 3 LIAT KESSLER 1. Local forms Vector fiels an the Lie erivative. A vector fiel on a manifol M is a smooth assignment of a vector tangent to M at each point. We think of M as

More information

Witten s Proof of Morse Inequalities

Witten s Proof of Morse Inequalities Witten s Proof of Morse Inequalities by Igor Prokhorenkov Let M be a smooth, compact, oriente manifol with imension n. A Morse function is a smooth function f : M R such that all of its critical points

More information

Math 50: Final. 1. [13 points] It was found that 35 out of 300 famous people have the star sign Sagittarius.

Math 50: Final. 1. [13 points] It was found that 35 out of 300 famous people have the star sign Sagittarius. Math 50: Final 180 minutes, 140 points. No algebra-capable calculators. Try to use your calculator only at the end of your calculation, and show working/reasoning. Please do look up z, t, χ 2 values for

More information

13.1: Vector-Valued Functions and Motion in Space, 14.1: Functions of Several Variables, and 14.2: Limits and Continuity in Higher Dimensions

13.1: Vector-Valued Functions and Motion in Space, 14.1: Functions of Several Variables, and 14.2: Limits and Continuity in Higher Dimensions 13.1: Vector-Value Functions an Motion in Space, 14.1: Functions of Several Variables, an 14.2: Limits an Continuity in Higher Dimensions TA: Sam Fleischer November 3 Section 13.1: Vector-Value Functions

More information

Asymptotic Statistics-III. Changliang Zou

Asymptotic Statistics-III. Changliang Zou Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (

More information

The Subtree Size Profile of Plane-oriented Recursive Trees

The Subtree Size Profile of Plane-oriented Recursive Trees The Subtree Size Profile of Plane-oriente Recursive Trees Michael FUCHS Department of Applie Mathematics National Chiao Tung University Hsinchu, 3, Taiwan Email: mfuchs@math.nctu.eu.tw Abstract In this

More information

A Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential

A Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Implicit Differentiation Using the Chain Rule In the previous section we focuse on the erivatives of composites an saw that THEOREM 20 (Chain Rule) Suppose that u = g(x) is ifferentiable

More information

On combinatorial approaches to compressed sensing

On combinatorial approaches to compressed sensing On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu

More information

PDE Notes, Lecture #11

PDE Notes, Lecture #11 PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =

More information

Stat410 Probability and Statistics II (F16)

Stat410 Probability and Statistics II (F16) Stat4 Probability and Statistics II (F6 Exponential, Poisson and Gamma Suppose on average every /λ hours, a Stochastic train arrives at the Random station. Further we assume the waiting time between two

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

Mathematics 116 HWK 25a Solutions 8.6 p610

Mathematics 116 HWK 25a Solutions 8.6 p610 Mathematics 6 HWK 5a Solutions 8.6 p6 Problem, 8.6, p6 Fin a power series representation for the function f() = etermine the interval of convergence. an Solution. Begin with the geometric series = + +

More information

arxiv:math/ v1 [math.pr] 19 Apr 2001

arxiv:math/ v1 [math.pr] 19 Apr 2001 Conitional Expectation as Quantile Derivative arxiv:math/00490v math.pr 9 Apr 200 Dirk Tasche November 3, 2000 Abstract For a linear combination u j X j of ranom variables, we are intereste in the partial

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

23 Implicit differentiation

23 Implicit differentiation 23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For

More information

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1). Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent

More information

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,

More information

Statistics 351 Probability I Fall 2006 (200630) Final Exam Solutions. θ α β Γ(α)Γ(β) (uv)α 1 (v uv) β 1 exp v }

Statistics 351 Probability I Fall 2006 (200630) Final Exam Solutions. θ α β Γ(α)Γ(β) (uv)α 1 (v uv) β 1 exp v } Statistics 35 Probability I Fall 6 (63 Final Exam Solutions Instructor: Michael Kozdron (a Solving for X and Y gives X UV and Y V UV, so that the Jacobian of this transformation is x x u v J y y v u v

More information

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+

More information

Final Exam: Sat 12 Dec 2009, 09:00-12:00

Final Exam: Sat 12 Dec 2009, 09:00-12:00 MATH 1013 SECTIONS A: Professor Szeptycki APPLIED CALCULUS I, FALL 009 B: Professor Toms C: Professor Szeto NAME: STUDENT #: SECTION: No ai (e.g. calculator, written notes) is allowe. Final Exam: Sat 1

More information

Logarithmic spurious regressions

Logarithmic spurious regressions Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate

More information

P(x) = 1 + x n. (20.11) n n φ n(x) = exp(x) = lim φ (x) (20.8) Our first task for the chain rule is to find the derivative of the exponential

P(x) = 1 + x n. (20.11) n n φ n(x) = exp(x) = lim φ (x) (20.8) Our first task for the chain rule is to find the derivative of the exponential 20. Derivatives of compositions: the chain rule At the en of the last lecture we iscovere a nee for the erivative of a composition. In this lecture we show how to calculate it. Accoringly, let P have omain

More information

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Math 300 Winter 2011 Advanced Boundary Value Problems I. Bessel s Equation and Bessel Functions

Math 300 Winter 2011 Advanced Boundary Value Problems I. Bessel s Equation and Bessel Functions Math 3 Winter 2 Avance Bounary Value Problems I Bessel s Equation an Bessel Functions Department of Mathematical an Statistical Sciences University of Alberta Bessel s Equation an Bessel Functions We use

More information

Introduction to the Vlasov-Poisson system

Introduction to the Vlasov-Poisson system Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its

More information

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:

More information

The average number of spanning trees in sparse graphs with given degrees

The average number of spanning trees in sparse graphs with given degrees The average number of spanning trees in sparse graphs with given egrees Catherine Greenhill School of Mathematics an Statistics UNSW Australia Syney NSW 05, Australia cgreenhill@unsweuau Matthew Kwan Department

More information

. Find E(V ) and var(v ).

. Find E(V ) and var(v ). Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number

More information

1.1 Review of Probability Theory

1.1 Review of Probability Theory 1.1 Review of Probability Theory Angela Peace Biomathemtics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology. CRC Press,

More information

Parameter estimation: A new approach to weighting a priori information

Parameter estimation: A new approach to weighting a priori information Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a

More information

Math 3A Midterm 1 Solutions

Math 3A Midterm 1 Solutions Math 3A Miterm Solutions Rea all of the following information before starting the exam: 0/0/00 Check your exam to make sure all pages are present. When you use a major theorem (like the inermeiate value

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

Slide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13)

Slide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13) Slie10 Haykin Chapter 14: Neuroynamics (3r E. Chapter 13) CPSC 636-600 Instructor: Yoonsuck Choe Spring 2012 Neural Networks with Temporal Behavior Inclusion of feeback gives temporal characteristics to

More information

Class 8 Review Problems 18.05, Spring 2014

Class 8 Review Problems 18.05, Spring 2014 1 Counting and Probability Class 8 Review Problems 18.05, Spring 2014 1. (a) How many ways can you arrange the letters in the word STATISTICS? (e.g. SSSTTTIIAC counts as one arrangement.) (b) If all arrangements

More information

Differentiation ( , 9.5)

Differentiation ( , 9.5) Chapter 2 Differentiation (8.1 8.3, 9.5) 2.1 Rate of Change (8.2.1 5) Recall that the equation of a straight line can be written as y = mx + c, where m is the slope or graient of the line, an c is the

More information

Entanglement is not very useful for estimating multiple phases

Entanglement is not very useful for estimating multiple phases PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 3

MATH 56A: STOCHASTIC PROCESSES CHAPTER 3 MATH 56A: STOCHASTIC PROCESSES CHAPTER 3 Plan for rest of semester (1) st week (8/31, 9/6, 9/7) Chap 0: Diff eq s an linear recursion (2) n week (9/11...) Chap 1: Finite Markov chains (3) r week (9/18...)

More information

Wiener Deconvolution: Theoretical Basis

Wiener Deconvolution: Theoretical Basis Wiener Deconvolution: Theoretical Basis The Wiener Deconvolution is a technique use to obtain the phase-velocity ispersion curve an the attenuation coefficients, by a two-stations metho, from two pre-processe

More information

Spring 2012 Math 541A Exam 1. X i, S 2 = 1 n. n 1. X i I(X i < c), T n =

Spring 2012 Math 541A Exam 1. X i, S 2 = 1 n. n 1. X i I(X i < c), T n = Spring 2012 Math 541A Exam 1 1. (a) Let Z i be independent N(0, 1), i = 1, 2,, n. Are Z = 1 n n Z i and S 2 Z = 1 n 1 n (Z i Z) 2 independent? Prove your claim. (b) Let X 1, X 2,, X n be independent identically

More information

On a limit theorem for non-stationary branching processes.

On a limit theorem for non-stationary branching processes. On a limit theorem for non-stationary branching processes. TETSUYA HATTORI an HIROSHI WATANABE 0. Introuction. The purpose of this paper is to give a limit theorem for a certain class of iscrete-time multi-type

More information

Research Article When Inflation Causes No Increase in Claim Amounts

Research Article When Inflation Causes No Increase in Claim Amounts Probability an Statistics Volume 2009, Article ID 943926, 10 pages oi:10.1155/2009/943926 Research Article When Inflation Causes No Increase in Claim Amounts Vytaras Brazauskas, 1 Bruce L. Jones, 2 an

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

Lecture 6: Calculus. In Song Kim. September 7, 2011

Lecture 6: Calculus. In Song Kim. September 7, 2011 Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear

More information

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

Probability 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 information

The Multivariate Normal Distribution. In this case according to our theorem

The Multivariate Normal Distribution. In this case according to our theorem The Multivariate Normal Distribution Defn: Z R 1 N(0, 1) iff f Z (z) = 1 2π e z2 /2. Defn: Z R p MV N p (0, I) if and only if Z = (Z 1,..., Z p ) T with the Z i independent and each Z i N(0, 1). In this

More information

Derivatives and the Product Rule

Derivatives and the Product Rule Derivatives an the Prouct Rule James K. Peterson Department of Biological Sciences an Department of Mathematical Sciences Clemson University January 28, 2014 Outline Differentiability Simple Derivatives

More information

Math 180, Exam 2, Fall 2012 Problem 1 Solution. (a) The derivative is computed using the Chain Rule twice. 1 2 x x

Math 180, Exam 2, Fall 2012 Problem 1 Solution. (a) The derivative is computed using the Chain Rule twice. 1 2 x x . Fin erivatives of the following functions: (a) f() = tan ( 2 + ) ( ) 2 (b) f() = ln 2 + (c) f() = sin() Solution: Math 80, Eam 2, Fall 202 Problem Solution (a) The erivative is compute using the Chain

More information

Chapter 5. Chapter 5 sections

Chapter 5. Chapter 5 sections 1 / 43 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions

More information

Lecture 2: Correlated Topic Model

Lecture 2: Correlated Topic Model Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables

More information