Lecture 10: Characteristic Functions
|
|
- Gary Harper
- 7 years ago
- Views:
Transcription
1 Lecture 0: Characteristic Functions. Definition of characteristic functions. Complex random variables.2 Definition and basic properties of characteristic functions.3 Examples.4 Inversion formulas 2. Applications 2. Characteristic function for sum of independent random variables 2.2 Characteristic functions and moments of random variables 2.3 Continuity theorem 2.4 Weak law of large numbers 2.5 Central Limit theorem 2.6 Law of small numbers. Definition of characteristic function. Complex random variables () Complex numbers has a form u = a + ib where a, b are real numbers and i is so-called imaginary unit which has a property i 2 =.
2 (2) The summation of complex numbers u = a+ib and v = c+id is performed according the rule u + v = (a + c) + i(b + d) and the multiplication as uv = (ac bd) + i(ad + bc). (3) For a complex number u = a + ib, the conjugate complex number is defined as ū = a ib and the norm is defined by the formula u 2 = uū = a 2 + b 2 ; uv = u v ; u + v u + v. (4) The basic role in what follows plays the formula e it = cos t + i sin t, t R. Note that e it = cos 2 t + sin 2 t =. A complex random variable is defined as Z = X + iy where X = X(ω) and Y = Y (ω) are usual real-valued random variables defined on some probability space < Ω, F, P >. The distribution of a complex random variable Z is determined by the distribution of the random vector (X, Y ). The expectation of the complex random variable Z = X + iy is defined as the complex number EZ = EX + iey. Two complex random variables Z = X +iy and Z 2 = X 2 +iy 2 are independent if the random vectors (X, Y ) and (X 2, Y 2 ) are independent. (5) The product of two complex random variables Z Z 2 = (X X 2 Y Y 2 )+i(x Y 2 +Y X 2 ) then EZ Z 2 = E(X X 2 Y Y 2 )+ie(x Y 2 + Y X 2 ). If the random variables Z and Z 2 are independent, then 2
3 EZ Z 2 = EZ EZ 2. EZ Z 2 = E(X X 2 Y Y 2 ) + ie(x Y 2 + Y X 2 ) = (EX EX 2 EY EY 2 ) + i(ex EY 2 + EY EX 2 ) = EZ EZ 2. (6) If X M then EX M. Let X = Y +iz, then EX 2 = EY +iez 2 = (EY ) 2 +(EZ) 2 EY 2 + EZ 2 = E X 2 M 2. (7) EX E X..2 Definition and basic properties of characteristic functions Definition 0.. Let X be a random variable with the distribution F X (A) and the distribution function F X (x). The characteristic function of the random variable X (distribution F X (A) and the distribution function F X (x)) is called the complex-valued function φ X (t) defined on a real line as function of t by the formula, φ X (t) = E exp{itx} = eitx F X (dx) = E cos tx +ie sin tx = cos txf X(dx)+i sin txf X(dx). () If X is a discrete random variable with the discrete distribution p X (x n ) = P (X = x n ), n = 0,,... ( n p X (x n ) = ), then φ X (t) = E exp{itx} = n e itx n p X (x n ). 3
4 (2) If X is a continuous random variable with the probability density function f X (x), then φ X (t) = E exp{itx} = eitx f X (x)dx, where the integration the Riemann integration is performed if the density f X (x) is Riemann integrable (otherwise the Lebesgue integration should be used). (3) In the latter case the characteristic function is also known as the Fourier transform for function f X (x). Theorem 0.. The characteristic function φ X (t) of a random variable X possesses the following basic properties: () φ X (t) is a continuous function in t R ; (2) φ X (0) = (3) φ X (t) is positively defined function, i.e., a quadratic form j,l n c j c l φ X (t j t l ) 0 for any complex numbers c,..., c n and real t,..., t n and n. (a) φ X (t+h) φ X (t) Ee i(t+h)x Ee itx = Ee itx (e ihx ) E e itx (e ihx ) = E e ihx. (b) e ihx 2 and also e ihx hx. Choose A > 0 and get the following estimates E e ihx x >A eihx F X (dx) + A A eihx F X (dx) 2 F A X(dx) + hx F X(dx) x >A A 2P ( X A) + hap ( X A) 2P ( X A) + ha. 4
5 (c) Choose an arbitrary ε > 0. Then choose A so large that 2P ( X A) ε 2 and then h so small that ha ε 2. Then the expression on the right hand side in the estimate given in (b) will be less or equal ε. (d) φ X (0) = Ee i0x = E =. (e) To prove (3) we get j,l n = E j n c j c l φ X (t j t l ) = c j e it jx j n j,l n c j e it jx = E c j c l Ee i(t j t l )X j n c j e it jx 2 0. Theorem 0.2 (Bochner)**. A complex-valued function φ(t) defined on a real line is a characteristic function of some random variable X, i.e., can be represented in the form φ(t) = Ee itx = e itx F X (dx), t R if and only if it possesses the properties () - (3) formulated in Theorem. An additional properties of characteristic functions are: (4) φ X (t) for any t R ; (5) φ a+bx (t) = e iat φ X (bt); (6) e itx and, thus, φ X (t) = Ee itx ; (7) φ a+bx (t) = Ee it(a+bx) = e iat Ee itbx = e iat φ X (bt);.3 Examples 5
6 (a) If X a where a = const, then φ X (t) = e iat. () Binomial random variable. X = B(m, p), m =, 2,..., 0 p ; p X (n) = C n mp n ( p) m n, n = 0,,..., m; φ X (t) = (pe it + ( p)) m. (2) Poisson random variable. X = P(λ), λ > 0; p X (n) = λn n! e λ, n = 0,,... ; φ X (t) = e λ(eit ). (3) Normal random variable. X = N(m, σ 2 ), m R, σ 2 > 0; f X (x) = 2π e x2 2, x R ; φ X (t) = e t2 2 Y = m + σx; f Y (x) = 2πσ e (x m)2 2σ 2, x R φ Y (t) = e iat σ2 t 2 2 (4) Gamma random variable. X = Gamma(α, β), α, β > 0; f X (x) = Γ(α) xα e x β, x 0 where Γ(α) = 0 x α e x ; φ X (t) = ( iβt )α. 6
7 .4 Inversion formulas F (A) and G(A) are probability measures on a real line; φ(t) = e itx F (dx) and ψ(t) = e itx G(dx) are their characteristic functions. Lemma 0. (Parseval identity). The following so-called Parseval identity takes place, e ity φ(t)g(dt) = ψ(x y)f (dx). (a) The following equality follows from the definition of a characteristic function, e ity φ(t) = eit(x y) F (dx) (b) Integrating it with respect to the measure G(A) and using Fubinni theorem we get, e ity φ(t)g(dt) = [ eit(x y) F (dx)]g(dt) [ = eit(x y) G(dt)]F (dx) = ψ(x y)f (dx). Theorem 0.3 (inversion). Different characteristic function correspond to different distributions and vise versa. This theorem is a corollary of the inversion formula given below. 7
8 Theorem 0.4. Let F (x) be a distribution function and C F is the set of all point of continuity of this distribution function. Let also φ(t) = e itx F (dx) be the characteristic function that corresponds to this distribution function. The following inversion formula takes place z F (z) = lim σ2 0 2π [ e ity φ(t)e t 2 σ 2 2 dt]dy, z C F. (a) Let G(A) is a normal distribution with parameters m = 0 and σ. Then Parseval identity takes the following form 2 or equivalently e ity φ(t) σ e t2 σ 2 2 dt = 2π 2π e ity φ(t)e t 2 σ 2 2 dt = (x y) 2 e 2σ 2 F (dx), e (y x)2 2σ 2πσ 2 F (dx). (b) Integrating with respect to the Lebesgue measure (Riemann integration can be used!) over the interval (, z] we get z 2π [ e ity φ(t)e t 2 σ 2 z 2 dt]dy = [ = [ z e (y x)2 2σ 2πσ 2 F (dx)]dy e (x y)2 2σ 2πσ 2 dy]f (dx) = P (N(0, σ 2 ) + X z), where N(0, σ 2 ) is a normal random variable with parameters 0 and σ 2 independent of the random variable X. (c) If σ 2 0 then the random variables N(0, σ 2 ) converge in probability to 0 (P ( N(0, σ 2 ) ε) 0 for any ε > 0) and, in 8
9 sequel, the random variables N(0, σ 2 ) + X weakly converge to the random variable X that is P (N(0, σ 2 )+X z) P (X z) as σ 2 0 for any point z that is a point of continuity for the distribution function of the random variable X. Theorem 0.5. Let F (x) be a distribution function and φ(t) = e itx F (dx) be the characteristic function that corresponds to this distribution function. Let φ(t) is absolutely integrable at real line, i.e., φ(t) dt <. Then the distribution function F (x) has a bounded continuous probability density function f(y) and the following inversion formula takes place f(y) = 2π e ity φ(t)dt, y R. (a) The proof can be accomplished by passing σ 2 0 in the Parseval identity 2π e ity φ(t)e t 2 σ 2 2 dt = e (y x)2 2σ 2πσ 2 F (dx). (b) Both expressions on the left and right hand sides of the above identity represent the probability density function f σ (y) for the distribution function F σ (y) of random variable N(0, σ 2 ) + X. (c) F σ ( ) F ( ) as σ 0. (d) From the left hand side expression in the above identity, we see that. f σ (y) f(y) as σ 0. 9
10 (e) Note that f σ (y) and f(y) are bounded continuous functions; (f) It follows from (c), (d) and (e) that for any x < x F σ (x ) F σ (x ) = x x f σ (y)dy x (g) But, if x, x are continuity point of F (x) that (h) Thus, x f(y)dy F σ (x ) F σ (x ) F (x ) F (x ) as σ 0. F (x ) F (x ) = x x f(y)dy, i.e., indeed, f(y) is a probability density of the distribution function F (x). 2. Applications 2. Characteristic function for sum of independent random variables Lemma 0.2. If a random variable X = X + + X n is a sum of independent random variables X,..., X n then φ X (t) = φ X (t) φ Xn (t). φ X (t) = Ee it(x + X n ) = E n k= e itx k = n k= Ee itx k. 0
11 Examples () Let random variables X k = N(m k, σ 2 k), k =,..., n be independent normal random variables. In this case X = X + + X n is also a noramal random variable with parameters m = m + + m n and σ 2 = σ σ 2 n. φ X (t) = n k= e itm k σ 2 k t2 2 = e itm σ2 t 2 (2) Let random variables X k = P(λ k ), k =,..., n be independent Poissonian random variables. In this case X = X + + X n is also a Poissonian random variable with parameters λ = λ + + λ n. φ X (t) = n k= e λ k(e it ) = e λ(eit ). 2.2 Characteristic functions and moments of random variables Theorem 0.6. Let X be a random variable such that E X n = x n F X (dx) < for some n. Then, there exist n-th continuous derivatives for the characteristic function φ X (t) = e itx F X (dx) for all t R given by the formula, 2. φ (k) X (t) = i k xk e itx F X (dx), k =,..., n,
12 and, therefore, the following formula takes place () φ X(t+h) φ X (t) h EX k = i k φ (k) X (0), k =,..., n. = e itx eihx h F X (dx); x that let to perform the limit transition in the (2) eihx h above relation as h 0 using also that eihx h ix as h 0; (3) In general case, the formula for φ (k) X (t) can be proved by induction. Examples () Let X = N(m, σ 2 ) be a normal random variable. Then φ X (t) = e itm σ2 t 2 2 and, therefore, () φ X(t) = (im σ 2 t)e itm σ2 t 2 2 and EX = i φ X(0) = m. (2) φ X(t) = σ 2 e itm σ2 t (im σ 2 t) 2 e itm σ2 t 2 2 and EX 2 = i 2 φ X(0) = σ 2 + m 2. (2) Let random variables X = P(λ) be a Poissonian random variable. Then φ X (t) = e λ(eit ) and, therefore, () φ X(t) = iλe it e λ(eit ) and, thus, EX = i φ X(0) = λ. (2) φ X(t) = i 2 λe it e λ(eit ) +i 2 λ 2 e 2it e λ(eit ) and EX 2 = i 2 φ X(0) = λ + λ Continuity theorem X n, n = 0,,... is a sequence of random variables with distribution functions, respectively, F n (x), n = 0,,...; 2
13 φ n (t) = Ee itx n = e itx F n (dx), n = 0,,... are the corresponding characteristic functions; C F denotes the set of continuity points for a distribution function F (x). Theorem 0.7 (continuity)**. Distribution functions F n F 0 as n if and only if the corresponding characteristic functions φ n (t) φ 0 (t) as n for every t R. (a) Let F n F 0 as n. (b) Then by Helly theorem, for every t R, φ n (t) = eitx F n (dx) (c) Let φ n (t) φ 0 (t) as n, t R. eitx F 0 (dx) = φ 0 (t) as n. (d) As was proved in Lecture 9 using Cantor diagonal method, for any subsequence n k as k, one can select a subsequence n r = n kr as r such that F n r (x) F (x) as n, x C F, where F (x) is proper or improper distribution function (nondecreasing, continuous from the right and such that 0 F ( ) F ( ) ). (e) Let us write down the Parseval identity 2π e ity φ n r (t)e t 2 σ 2 2 dt = e (y x)2 2σ 2πσ 2 F n r (dx). 3
14 (f) By passing to the limit as r in the above identity and takin into account (c), and Lebesque theorem, and the fact that 2πσ e (y x)2 2σ 2 0 as x ±, we get 2π e ity φ 0 (t)e t 2 σ 2 2 dt = e (y x)2 2σ 2πσ 2 F (dx). (g) By multiplying both part in (f) by 2πσ and taking y = 0, we get φ 0(t) σ e t2 σ 2 2 dt = 2π e x 2 2σ 2 F (dx) F (+ ) F ( ). σ 2π e t2 σ 2 (g) By passing to the limit as σ 0 in the above equality and taking into account that (a) σ 2π e t2 σ as σ, for t 0, and (c) φ(t) is continuous in zero and φ(0) =, we get, 2 dt =, (b) = σ lim φ 0(t) σ e t2 σ 2 2 dt F (+ ) F ( ). 2π (h) This, F (+ ) F ( ) =, i.e., the distribution F (x) is a proper distribution. (i) In this case, the weak convergence F n r F as n implies by the first part of the theorem that φ n r (t) φ(t) = eitx F (dx) as n, t R. (j) This relation together with (c) implies that φ(t) = eitx F (dx) = φ 0 (t), t R. 4
15 (k) Therefore due to one-to-one correspondence between characteristic functions and distribution functions F (x) F 0 (x). (l) Therefore, by the subsequence definition of the weak convergence F n F 0 as n. Theorem 0.8* (continuity). Distribution functions F n (x) weakly converge to some distribution function F (x) if and only if the corresponding characteristic functions φ n (t) converge pointwise (for every t R ) to some continuous function φ(t). In this case, φ(t) is the characteristic function for the distribution function F (x). (a) Let φ n (t) φ(t) as n for every t R. Then φ(0) = ; (b) φ(t) is positively defined since functions φ n (t) possess these properties. (c) Since φ(t) is also continuous, the properties (a)-(c) pointed in Theorem 0. hold and, therefore, φ(t) is a characteristic function for some distribution function F (x). Then F n (x) weakly converge to F (x) by Theorem Weak law of large numbers (LLN) < Ω, F, P > is a probability space; X n, n = 0,, 2,... are independent identically distributed (i.i.d.) 5
16 random variables defined on a probability space < Ω, F, P >. Theorem 0.9 (weak LLN). If E X <, EX = a, then random variables X n = X + + X n d a as n. n (a) Let φ(t) = Ee itx, φ n(t) = Ee itx n be the corresponding characteristic functions. Then φ n (t) = (φ( t n ))n. (b) Since E X <, there exists the continuous first derivative φ (t) and, therefore, Taylor expansion for φ(t) in point t = 0 can be written down that is φ(t) = + φ (0)t + o(t) (c) Since φ (0) = iex = ia, the above Taylor expansion can be re-written. in the following form φ(t) = + iat + o(t). (d) Therefore, φ n (t) = (φ( t n ))n = ( + ia t n + o( t n ))n. (e) If u n 0 and v n then lim( + u n ) v n exists if and only if there exists lim u n v n = w and, in this case, lim(+u n ) v n = ew. (f) Using this fact, we get lim n φ n (t) = lim n ( + ia t n + o( t n ))n = e iat, for every t R. (g) Thus by the continuity theorem for characteristic functions d X n a as n. 0.0 Central Limit Theorem (CLT) < Ω, F, P > is a probability space; X n, n = 0,, 2,... are independent identically distributed (i.i.d.) 6
17 random variables defined on a probability space < Ω, F, P >; Z = N(0, ) is standard normal random variable with the distribution function F (x) = nσ x e y2 2 dy, < x <. Theorem 0.0 (CLT). If E X 2 <, EX = a, V arx = σ 2 > 0, then random variables Z n = X + + X n an nσ d Z as n. () Since, the limit distribution F (x) is continuous, the above relation means that P (Z n x) F (x) as n for every < x <. (a) Let introduce random variables Y n = X n a σ, n =, 2,..., then Z n = X + +X n an nσ = Y + +Y n n. (b) Let ψ(t) = Ee ity, ψ n(t) = Ee itz n. Then ψ n(t) = (ψ(t/ n)) n. (c) If E X 2 < then E Y 2 < and, moreover, EY = σ (EX a) = 0, E(Y ) 2 = σ 2 E(X a) 2 =. (d) Since E Y 2 <, there exist the continuous second derivative ψ (t) and, therefore, Taylor expansion for ψ(t) in point t = 0 can be written down that is ψ(t) = + ψ (0)t + 2 ψ (0)t 2 + o(t 2 ). (e) Since ψ (0) = iey = 0 and ψ (0) = i 2 E(Y ) 2 =, the above Taylor expansion can be re-written in the following form ψ(t) = 2 t2 + o(t 2 ). (f) Therefore, ψ n (t) = (ψ( t n )) n = ( t2 2n + o(t2 n ))n. (g) Using the above formula, we get lim n ψ n (t) = lim n ( t 2 2 2n + o(t2 n ))n = e t 2, for every t R. 7
18 (h) Thus by the continuity theorem for characteristic functions d Z n Z as n. 2.6 Law of small numbers Let X n,k, k =, 2,... are i.i.d. Bernoulli random variables defined on a probability space < Ω n, F n, P n > and taking values and 0, respectively, with probabilities p n and p n, where 0 p n. N(λ) = P(λ) is a Poissonian random variable with parameter λ, i.e., P (N(λ) = r) = λr r! e λ, r = 0,,.... Theorem 0. (LSN). If 0 < p n n λ <, then random variables N n = X n, + + X n,n d N(λ) as n. () The random variable N n is the number of successes in n Bernoulli trials. (2) The random variables N n = X n, + + X n,n, n =, 2,... are determined by series of random variables X, X 2,, X 2,2 X 3,, X 3,2, X 3, This representation gave the name to this type of models. as so-called triangle array mode. 8
19 (a) Let φ n (t) = Ee itn n The characteristic function EeitX n, = p n e it + p n and, thus, the characteristic function φ n (t) = Ee itn n = (p ne it + p n ) n. (b) Using the above formula, we get φ n (t) = (p n e it + p n ) n e p n(e it )n e λ(eit ) as n, for every t R. (c) Thus by the continuity theorem for characteristic functions d N n N(λ) as n. LN Problems. What is the characteristic function of random variable X which takes value and with probability Prove that the function cos n t is a characteristic function for every n =, 2, Let X is a uniformly distributed random variable on the interval [a, b]. Please find the characteristic function of the random variable X. 4. Let f(x) is a probability density for a random variable X. Prove that the characteristic function is a real-valued function if f(x) ia a symmetric function, i.e. f(x) = f( x), x Let random variables X and X 2 are independent and have gamma distributions s parameters α, β and α 2, β, respectively. Prove that the random variable Y = X + X 2 also has gamma distribution with parameters α, +α 2, β. 9
20 6. Let X has a geometrical distribution with parameter p. Find EX and V arx using characteristic functions. 7.Let X n are geometrical random variables with discrete distribution p Xn (k) = p n ( p n ) k, k =, 2,..., where 0 < p n 0 d as n. Prove that p n X n X as n, where X = Exp() is an exponential random variable with parameter. 20
THE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationWhat is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference
0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures
More informationThe Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationTransformations and Expectations of random variables
Transformations and Epectations of random variables X F X (): a random variable X distributed with CDF F X. Any function Y = g(x) is also a random variable. If both X, and Y are continuous random variables,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationSTAT 830 Convergence in Distribution
STAT 830 Convergence in Distribution Richard Lockhart Simon Fraser University STAT 830 Fall 2011 Richard Lockhart (Simon Fraser University) STAT 830 Convergence in Distribution STAT 830 Fall 2011 1 / 31
More informationLecture Notes 1. Brief Review of Basic Probability
Probability Review Lecture Notes Brief Review of Basic Probability I assume you know basic probability. Chapters -3 are a review. I will assume you have read and understood Chapters -3. Here is a very
More informationM2S1 Lecture Notes. G. A. Young http://www2.imperial.ac.uk/ ayoung
M2S1 Lecture Notes G. A. Young http://www2.imperial.ac.uk/ ayoung September 2011 ii Contents 1 DEFINITIONS, TERMINOLOGY, NOTATION 1 1.1 EVENTS AND THE SAMPLE SPACE......................... 1 1.1.1 OPERATIONS
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationDifferentiation and Integration
This material is a supplement to Appendix G of Stewart. You should read the appendix, except the last section on complex exponentials, before this material. Differentiation and Integration Suppose we have
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationMATH 381 HOMEWORK 2 SOLUTIONS
MATH 38 HOMEWORK SOLUTIONS Question (p.86 #8). If g(x)[e y e y ] is harmonic, g() =,g () =, find g(x). Let f(x, y) = g(x)[e y e y ].Then Since f(x, y) is harmonic, f + f = and we require x y f x = g (x)[e
More informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informatione.g. arrival of a customer to a service station or breakdown of a component in some system.
Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be
More informationProbability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X
Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationHomework 4 - KEY. Jeff Brenion. June 16, 2004. Note: Many problems can be solved in more than one way; we present only a single solution here.
Homework 4 - KEY Jeff Brenion June 16, 2004 Note: Many problems can be solved in more than one way; we present only a single solution here. 1 Problem 2-1 Since there can be anywhere from 0 to 4 aces, the
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationUNIT I: RANDOM VARIABLES PART- A -TWO MARKS
UNIT I: RANDOM VARIABLES PART- A -TWO MARKS 1. Given the probability density function of a continuous random variable X as follows f(x) = 6x (1-x) 0
More information5.3 Improper Integrals Involving Rational and Exponential Functions
Section 5.3 Improper Integrals Involving Rational and Exponential Functions 99.. 3. 4. dθ +a cos θ =, < a
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationIEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have
More informationStatistics 100A Homework 7 Solutions
Chapter 6 Statistics A Homework 7 Solutions Ryan Rosario. A television store owner figures that 45 percent of the customers entering his store will purchase an ordinary television set, 5 percent will purchase
More informationMath 526: Brownian Motion Notes
Math 526: Brownian Motion Notes Definition. Mike Ludkovski, 27, all rights reserved. A stochastic process (X t ) is called Brownian motion if:. The map t X t (ω) is continuous for every ω. 2. (X t X t
More informationManual for SOA Exam MLC.
Chapter 5. Life annuities. Extract from: Arcones Manual for the SOA Exam MLC. Spring 2010 Edition. available at http://www.actexmadriver.com/ 1/114 Whole life annuity A whole life annuity is a series of
More informationPractice Final Math 122 Spring 12 Instructor: Jeff Lang
Practice Final Math Spring Instructor: Jeff Lang. Find the limit of the sequence a n = ln (n 5) ln (3n + 8). A) ln ( ) 3 B) ln C) ln ( ) 3 D) does not exist. Find the limit of the sequence a n = (ln n)6
More informationCOMPLEX NUMBERS AND SERIES. Contents
COMPLEX NUMBERS AND SERIES MIKE BOYLE Contents 1. Complex Numbers Definition 1.1. A complex number is a number z of the form z = x + iy, where x and y are real numbers, and i is another number such that
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationGeneral Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions
More informationExponential Distribution
Exponential Distribution Definition: Exponential distribution with parameter λ: { λe λx x 0 f(x) = 0 x < 0 The cdf: F(x) = x Mean E(X) = 1/λ. f(x)dx = Moment generating function: φ(t) = E[e tx ] = { 1
More informationCourse Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics
Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used
More informationC. Complex Numbers. 1. Complex arithmetic.
C. Complex Numbers. Complex arithmetic. Most people think that complex numbers arose from attempts to solve quadratic equations, but actually it was in connection with cubic equations they first appeared.
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationStatistics 100A Homework 8 Solutions
Part : Chapter 7 Statistics A Homework 8 Solutions Ryan Rosario. A player throws a fair die and simultaneously flips a fair coin. If the coin lands heads, then she wins twice, and if tails, the one-half
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informationManual for SOA Exam MLC.
Chapter 4. Life Insurance. c 29. Miguel A. Arcones. All rights reserved. Extract from: Arcones Manual for the SOA Exam MLC. Fall 29 Edition. available at http://www.actexmadriver.com/ c 29. Miguel A. Arcones.
More informationChapter 7. BANDIT PROBLEMS.
Chapter 7. BANDIT PROBLEMS. Bandit problems are problems in the area of sequential selection of experiments, and they are related to stopping rule problems through the theorem of Gittins and Jones (974).
More informationImportant Probability Distributions OPRE 6301
Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.
More informationVERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationCOMPLEX NUMBERS. a bi c di a c b d i. a bi c di a c b d i For instance, 1 i 4 7i 1 4 1 7 i 5 6i
COMPLEX NUMBERS _4+i _-i FIGURE Complex numbers as points in the Arg plane i _i +i -i A complex number can be represented by an expression of the form a bi, where a b are real numbers i is a symbol with
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More information2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationMath 370, Spring 2008 Prof. A.J. Hildebrand. Practice Test 1 Solutions
Math 70, Spring 008 Prof. A.J. Hildebrand Practice Test Solutions About this test. This is a practice test made up of a random collection of 5 problems from past Course /P actuarial exams. Most of the
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationACTS 4301 FORMULA SUMMARY Lesson 1: Probability Review. Name f(x) F (x) E[X] Var(X) Name f(x) E[X] Var(X) p x (1 p) m x mp mp(1 p)
ACTS 431 FORMULA SUMMARY Lesson 1: Probability Review 1. VarX)= E[X 2 ]- E[X] 2 2. V arax + by ) = a 2 V arx) + 2abCovX, Y ) + b 2 V ary ) 3. V ar X) = V arx) n 4. E X [X] = E Y [E X [X Y ]] Double expectation
More informationFrom Binomial Trees to the Black-Scholes Option Pricing Formulas
Lecture 4 From Binomial Trees to the Black-Scholes Option Pricing Formulas In this lecture, we will extend the example in Lecture 2 to a general setting of binomial trees, as an important model for a single
More informationMathematics. (www.tiwariacademy.com : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI)
( : Focus on free Education) Miscellaneous Exercise on chapter 5 Question 1: Evaluate: Answer 1: 1 ( : Focus on free Education) Question 2: For any two complex numbers z1 and z2, prove that Re (z1z2) =
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More information4. Complex integration: Cauchy integral theorem and Cauchy integral formulas. Definite integral of a complex-valued function of a real variable
4. Complex integration: Cauchy integral theorem and Cauchy integral formulas Definite integral of a complex-valued function of a real variable Consider a complex valued function f(t) of a real variable
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationSystem of First Order Differential Equations
CHAPTER System of First Order Differential Equations In this chapter, we will discuss system of first order differential equations. There are many applications that involving find several unknown functions
More informationPreliminary Version: December 1998
On the Number of Prime Numbers less than a Given Quantity. (Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse.) Bernhard Riemann [Monatsberichte der Berliner Akademie, November 859.] Translated
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationDEFINITION 5.1.1 A complex number is a matrix of the form. x y. , y x
Chapter 5 COMPLEX NUMBERS 5.1 Constructing the complex numbers One way of introducing the field C of complex numbers is via the arithmetic of matrices. DEFINITION 5.1.1 A complex number is a matrix of
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More information6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.
hapter omplex integration. omplex number quiz. Simplify 3+4i. 2. Simplify 3+4i. 3. Find the cube roots of. 4. Here are some identities for complex conjugate. Which ones need correction? z + w = z + w,
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationSection 6.1 Joint Distribution Functions
Section 6.1 Joint Distribution Functions We often care about more than one random variable at a time. DEFINITION: For any two random variables X and Y the joint cumulative probability distribution function
More informationSums of Independent Random Variables
Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables
More information1 Prior Probability and Posterior Probability
Math 541: Statistical Theory II Bayesian Approach to Parameter Estimation Lecturer: Songfeng Zheng 1 Prior Probability and Posterior Probability Consider now a problem of statistical inference in which
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationLectures on Stochastic Processes. William G. Faris
Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3
More informationHEAVISIDE CABLE, THOMSON CABLE AND THE BEST CONSTANT OF A SOBOLEV-TYPE INEQUALITY. Received June 1, 2007; revised September 30, 2007
Scientiae Mathematicae Japonicae Online, e-007, 739 755 739 HEAVISIDE CABLE, THOMSON CABLE AND THE BEST CONSTANT OF A SOBOLEV-TYPE INEQUALITY Yoshinori Kametaka, Kazuo Takemura, Hiroyuki Yamagishi, Atsushi
More informationChapter 8 - Power Density Spectrum
EE385 Class Notes 8/8/03 John Stensby Chapter 8 - Power Density Spectrum Let X(t) be a WSS random process. X(t) has an average power, given in watts, of E[X(t) ], a constant. his total average power is
More informationFeb 28 Homework Solutions Math 151, Winter 2012. Chapter 6 Problems (pages 287-291)
Feb 8 Homework Solutions Math 5, Winter Chapter 6 Problems (pages 87-9) Problem 6 bin of 5 transistors is known to contain that are defective. The transistors are to be tested, one at a time, until the
More informationMathematical Finance
Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More informationAggregate Loss Models
Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMean value theorems for long Dirichlet polynomials and tails of Dirichlet series
ACA ARIHMEICA LXXXIV.2 998 Mean value theorems for long Dirichlet polynomials and tails of Dirichlet series by D. A. Goldston San Jose, Calif. and S. M. Gonek Rochester, N.Y. We obtain formulas for computing
More informationChapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationA SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More information3 Contour integrals and Cauchy s Theorem
3 ontour integrals and auchy s Theorem 3. Line integrals of complex functions Our goal here will be to discuss integration of complex functions = u + iv, with particular regard to analytic functions. Of
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationGradient, Divergence and Curl in Curvilinear Coordinates
Gradient, Divergence and Curl in Curvilinear Coordinates Although cartesian orthogonal coordinates are very intuitive and easy to use, it is often found more convenient to work with other coordinate systems.
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More information