The Central Limit Theorem

Size: px
Start display at page:

Download "The Central Limit Theorem"

Transcription

1 The Central Limit Theorem (A rounding-corners overiew of the proof for a.s. convergence assuming i.i.d.r.v. with 2 moments in L 1, provided swaps of lim-ops are legitimate) If {X k } n k=1 are i.i.d., all X k f, E(X k ) = µ and finite Var(X k ) = σ 2, and n 1 Z n = X k nµ σ = X n µ n σ/ n f Z n, then, under certain regularity and decay conditions of the moments of f, f Zn (x) a.s. e x2 /2, n. The Central Limit Theorem 1 / 9

2 Sums of independent r.v. are convolutions The convolution of two densities f 1,2 is given by f 1 f 2 (x) = def f 1 (x t)f 2 (t) dt = f 2 f 1 (t). Let X 1 f 1 and X 2 f 2 be independent. Then X 1 + X 2 f 1 f 2 : Let Y = X 1 + X 2. Then its cdf F Y = P(X 1 + X 2 y) is given by F Y (y) = x 1 +x 2 y = f 1 (x 1 )f 2 (x 2 ) dx 1 dx 2 = f 1 (x 1 )F 2 (y x 1 ) dx 1 = f 1 F 2 (y). y x1 f 1 (x 1 ) dx 1 f 2 (x 2 ) dx 2 Now differentiate under the integral sign: f Y (y) = F Y (y) = f 1 f 2 (y). The Central Limit Theorem 2 / 9

3 The Fourier transform (CF) of a probability density The FT (the characteristic function, CF) ˆf (ω) = Ff (ω) of a density f : Ff (ω) = def f (x) e iωx dx F 1ˆf (x) = 1 def f (x) e iωx dω. Uniqueness: If f 1,2 L 1 and continuous, f 1 f 2 ˆf 1 ˆf 2. The Fourier transform is an automorphism on the Schwartz class S(). The FT maps convolutions products: ( f 1 f 2 )(w) = ˆf 1 (ω)ˆf 2 (ω) Pf : ( f 1 f 2 )(ω) = e ixω ( f 1 (x t)f 2 (t) dt) dx = f 2 (t) e itω ( f 1 (x t)e iω(x t) dx) dt = ˆf 1 (ω) f 2 (x) e ixω dx = ˆf 1 (ω)ˆf 2 (ω). The Central Limit Theorem 3 / 9

4 If X f : E(X ) = iˆf (0), E(X 2 ) = ˆf X (0) If f is a distribution and X f, then ˆf (0) = f (x) e 0 dx = E(1) = 1. The Fourier transform maps derivatives moments, and in particular, ( d ) kˆf (ω) = ( ix) k f (x) e iωx dx dω {ˆf (0) = ie(x ) ˆf (0) = E(X 2 ). Note that: If E(X ) = 0, then Var(X ) = E(X 2 ) = ˆf (0). Standard (µ, σ 2 ) = (0, 1) always achievable by X X µ σ If f 1,2 are distributions E(f 1 f 2 ) = ( f 1 f 2 )(0) = ˆf 1 (0)ˆf 2 (0) = 1. The Central Limit Theorem 4 / 9

5 Scaled r.v. Y = ax, density and its Fourier transform: The density f ax of a scaled r.v. Y = ax : If X f X and a > 0, then the scaled r.v. Y = ax 1 a f X ( a ). 1 ( y ) 1 = f X (x) dx = {y = ax} = a f X dy. a Now, the Fourier transform of the density of a scaled r.v: For a > 0, the Fourier transform ˆf ax (ω) = ˆf X (aω): ˆf ax (ω) = 1 f X ( x a a )e ixω dx = f X (t)e it(aω) dx = ˆf X (aω). The Central Limit Theorem 5 / 9

6 The Gaussian is an eigenfunction for the FT: Fg = g Pf. Let g denote the Gaussian ( -scaled pdf of the normal distribution) g(x) = e x2 /2. Its FT is given by ĝ(ω) = e x2 /2 ixω dx = e (iω)2 /2 where φ( + iω) = e (x+iω)2 /2 dx; φ( ) = e (x+iω)2 /2 dx = g(ω)φ( + iω), e x2 /2 dx =. Will use that the Gaussian g(z) is an entire function to show that φ( + iω) = = const, ω. The Central Limit Theorem 6 / 9

7 The Gaussian = Gaussian, Fg = g (cont.) If γ be the rectangular contour in the complex plane γ : ( + iω) ( + iω) ( ) cycle, then the circulation of g around γ is zero: 0 = g(z) dz = γ [g(x) g(x + iω)] dx + }{{} φ( ) φ( +iω) ω 0 [g( +iy) g( +iy)] dy. The integrals on the vertical segments vanish rapidly far out, ω 0 g(± + iy) dy ω e (2 ω 2 )/2 0,. Now pass to yield the result: 0 = lim g(z) dz = φ( ) φ( + iω) Fg(ω) = g(ω). γ The Central Limit Theorem 7 / 9

8 Last, recap of two additional results: esult 1: F 1 ĝ(ω) = g(x) = 1 e x2 /2, the density of N(0, 1). Just a rephrasing of the fact that ĝ = Fg = g.. [ esult 2: For any fixed a, lim 1 + a ] n n n + o( 1 n ) = e a. For any fixed a and all sufficiently small ε > 0, ln[1 + aε + o(ε)] = [ξ ξ2 2 + ξ3 3 + ] ξ=aε+o(ε) = aε + o(ε). Hence, for fixed a and large integers n, [ 1 + a n + o( 1 n ) ] n = e n ln[1+a/n+o(n 1 )] = e n[a/n+o(n 1 )] = e a e o(1). The Central Limit Theorem 8 / 9

9 The Central Limit Theorem Let {X k } n 1 be i.i.d., X k f, E(X k ) = 0, Var(X k ) = 1 = E(Xk 2 ). Then, if n Z n = S n n, S n = k=1 X k, then f Zn (x) e x2 /2, n. Pf. By esult 1, it suffices to show that the CF, Ff Zn (ω) = e ω2 /2. Now ˆf Zn (ω) = ( f 1 n S n )(ω) = ( f Sn ) ( ω n ) = F(f f ) ( ω n ) = [ˆf ( ω n ) ] n. Maclaurin-expand f Zn & use ˆf (0) = ie(x ) = 0, ˆf (0) = E(X 2 ) = 1: ˆf Zn (ω) = [ˆf (0) + ˆf (0) 1! ω + ˆf (0) n 2! ω 2 n + o( 1 n ) ] n = [ 1 ω2 2n + o( 1 n ) ] n. Finally, pass n and use esult 2 with a = ω 2 /2. Done! The Central Limit Theorem 9 / 9

18.175: Lecture 15 Characteristic functions and central limit theorem

18.175: Lecture 15 Characteristic functions and central limit theorem 18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.

More information

Math 341: Probability Eighteenth Lecture (11/12/09)

Math 341: Probability Eighteenth Lecture (11/12/09) Math 341: Probability Eighteenth Lecture (11/12/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams

More information

Lecture 4: Fourier Transforms.

Lecture 4: Fourier Transforms. 1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()

More information

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real

More information

Continuous Random Variables

Continuous Random Variables 1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables

More information

Fourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University

Fourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University The Fourier Transform R. C. Trinity University Partial Differential Equations April 17, 214 The Fourier series representation For periodic functions Recall: If f is a 2p-periodic (piecewise smooth) function,

More information

Moments. Raw moment: February 25, 2014 Normalized / Standardized moment:

Moments. Raw moment: February 25, 2014 Normalized / Standardized moment: Moments Lecture 10: Central Limit Theorem and CDFs Sta230 / Mth 230 Colin Rundel Raw moment: Central moment: µ n = EX n ) µ n = E[X µ) 2 ] February 25, 2014 Normalized / Standardized moment: µ n σ n Sta230

More information

the convolution of f and g) given by

the convolution of f and g) given by 09:53 /5/2000 TOPIC Characteristic functions, cont d This lecture develops an inversion formula for recovering the density of a smooth random variable X from its characteristic function, and uses that

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Introduction to Probability and Statistics Lecture 14: Continuous random variables Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin www.cs.cmu.edu/

More information

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued Chapter 3 sections Chapter 3 - continued 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions

More information

Chapter 4. Chapter 4 sections

Chapter 4. Chapter 4 sections Chapter 4 sections 4.1 Expectation 4.2 Properties of Expectations 4.3 Variance 4.4 Moments 4.5 The Mean and the Median 4.6 Covariance and Correlation 4.7 Conditional Expectation SKIP: 4.8 Utility Expectation

More information

The Fourier Transform Method

The Fourier Transform Method The Fourier Transform Method R. C. Trinity University Partial Differential Equations April 22, 2014 Recall The Fourier transform The Fourier transform of a piecewise smooth f L 1 (R) is ˆf(ω) = F(f)(ω)

More information

sech(ax) = 1 ch(x) = 2 e x + e x (10) cos(a) cos(b) = 2 sin( 1 2 (a + b)) sin( 1 2

sech(ax) = 1 ch(x) = 2 e x + e x (10) cos(a) cos(b) = 2 sin( 1 2 (a + b)) sin( 1 2 Math 60 43 6 Fourier transform Here are some formulae that you may want to use: F(f)(ω) def = f(x)e iωx dx, F (f)(x) = f(ω)e iωx dω, (3) F(f g) = F(f)F(g), (4) F(e α x ) = α π ω + α, F( α x + α )(ω) =

More information

Part II Probability and Measure

Part II Probability and Measure Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Compensation. June 29, Arizona State University. Edge Detection from Nonuniform Data via. Convolutional Gridding with Density.

Compensation. June 29, Arizona State University. Edge Detection from Nonuniform Data via. Convolutional Gridding with Density. Arizona State University June 29, 2012 Overview gridding with density compensation is a common method for function reconstruction nonuniform Fourier data. It is computationally inexpensive compared with

More information

1 Solution to Problem 2.1

1 Solution to Problem 2.1 Solution to Problem 2. I incorrectly worked this exercise instead of 2.2, so I decided to include the solution anyway. a) We have X Y /3, which is a - function. It maps the interval, ) where X lives) onto

More information

Lecture 2. Spring Quarter Statistical Optics. Lecture 2. Characteristic Functions. Transformation of RVs. Sums of RVs

Lecture 2. Spring Quarter Statistical Optics. Lecture 2. Characteristic Functions. Transformation of RVs. Sums of RVs s of Spring Quarter 2018 ECE244a - Spring 2018 1 Function s of The characteristic function is the Fourier transform of the pdf (note Goodman and Papen have different notation) C x(ω) = e iωx = = f x(x)e

More information

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued Chapter 3 sections 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions 3.6 Conditional

More information

Continuous Random Variables

Continuous Random Variables MATH 38 Continuous Random Variables Dr. Neal, WKU Throughout, let Ω be a sample space with a defined probability measure P. Definition. A continuous random variable is a real-valued function X defined

More information

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Reading Chapter 5 (continued) Lecture 8 Key points in probability CLT CLT examples Prior vs Likelihood Box & Tiao

More information

Review: mostly probability and some statistics

Review: mostly probability and some statistics Review: mostly probability and some statistics C2 1 Content robability (should know already) Axioms and properties Conditional probability and independence Law of Total probability and Bayes theorem Random

More information

λ n = L φ n = π L eınπx/l, for n Z

λ n = L φ n = π L eınπx/l, for n Z Chapter 32 The Fourier Transform 32. Derivation from a Fourier Series Consider the eigenvalue problem y + λy =, y( L = y(l, y ( L = y (L. The eigenvalues and eigenfunctions are ( nπ λ n = L 2 for n Z +

More information

2 Random Variable Generation

2 Random Variable Generation 2 Random Variable Generation Most Monte Carlo computations require, as a starting point, a sequence of i.i.d. random variables with given marginal distribution. We describe here some of the basic methods

More information

Mathematical Statistics 1 Math A 6330

Mathematical Statistics 1 Math A 6330 Mathematical Statistics 1 Math A 6330 Chapter 2 Transformations and Expectations Mohamed I. Riffi Department of Mathematics Islamic University of Gaza September 14, 2015 Outline 1 Distributions of Functions

More information

Fourier Transforms of Measures

Fourier Transforms of Measures Fourier Transforms of Measures Sums of Independent andom Variables We begin our study of sums of independent random variables, S n = X 1 + X n. If each X i is square integrable, with mean µ i = EX i and

More information

1 From Fourier Series to Fourier transform

1 From Fourier Series to Fourier transform Differential Equations 2 Fall 206 The Fourier Transform From Fourier Series to Fourier transform Recall: If fx is defined and piecewise smooth in the interval [, ] then we can write where fx = a n = b

More information

Random Variables and Their Distributions

Random Variables and Their Distributions Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital

More information

1 The Complex Fourier Series

1 The Complex Fourier Series The Complex Fourier Series Adding Complexity to life The complex Fourier series is in some ways a superior product, at least for those people who are not terrified by complex numbers. Suppose fx) is a

More information

Chapter 3: Random Variables 1

Chapter 3: Random Variables 1 Chapter 3: Random Variables 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.

More information

Chapter 5 continued. Chapter 5 sections

Chapter 5 continued. Chapter 5 sections Chapter 5 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

Probability, CLT, CLT counterexamples, Bayes. The PDF file of this lecture contains a full reference document on probability and random variables.

Probability, CLT, CLT counterexamples, Bayes. The PDF file of this lecture contains a full reference document on probability and random variables. Lecture 5 A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2015 http://www.astro.cornell.edu/~cordes/a6523 Probability, CLT, CLT counterexamples, Bayes The PDF file of

More information

p. 6-1 Continuous Random Variables p. 6-2

p. 6-1 Continuous Random Variables p. 6-2 Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability (>). Often, there is interest in random variables

More information

8 - Continuous random vectors

8 - Continuous random vectors 8-1 Continuous random vectors S. Lall, Stanford 2011.01.25.01 8 - Continuous random vectors Mean-square deviation Mean-variance decomposition Gaussian random vectors The Gamma function The χ 2 distribution

More information

MAS113 Introduction to Probability and Statistics

MAS113 Introduction to Probability and Statistics MAS113 Introduction to Probability and Statistics School of Mathematics and Statistics, University of Sheffield 2018 19 Identically distributed Suppose we have n random variables X 1, X 2,..., X n. Identically

More information

MATH4210 Financial Mathematics ( ) Tutorial 7

MATH4210 Financial Mathematics ( ) Tutorial 7 MATH40 Financial Mathematics (05-06) Tutorial 7 Review of some basic Probability: The triple (Ω, F, P) is called a probability space, where Ω denotes the sample space and F is the set of event (σ algebra

More information

3 Operations on One Random Variable - Expectation

3 Operations on One Random Variable - Expectation 3 Operations on One Random Variable - Expectation 3.0 INTRODUCTION operations on a random variable Most of these operations are based on a single concept expectation. Even a probability of an event can

More information

Brief Review of Probability

Brief Review of Probability Maura Department of Economics and Finance Università Tor Vergata Outline 1 Distribution Functions Quantiles and Modes of a Distribution 2 Example 3 Example 4 Distributions Outline Distribution Functions

More information

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) = Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of

More information

6.1 Moment Generating and Characteristic Functions

6.1 Moment Generating and Characteristic Functions Chapter 6 Limit Theorems The power statistics can mostly be seen when there is a large collection of data points and we are interested in understanding the macro state of the system, e.g., the average,

More information

5 Operations on Multiple Random Variables

5 Operations on Multiple Random Variables EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y

More information

Chapter 4. Continuous Random Variables 4.1 PDF

Chapter 4. Continuous Random Variables 4.1 PDF Chapter 4 Continuous Random Variables In this chapter we study continuous random variables. The linkage between continuous and discrete random variables is the cumulative distribution (CDF) which we will

More information

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. Chapter 2 Random Variable CLO2 Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. 1 1. Introduction In Chapter 1, we introduced the concept

More information

Transform Techniques - CF

Transform Techniques - CF Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t t M () t E[ e ] e Characteristic Function (CF) k t k For a real ω, the characteristic function

More information

David A. Stephens Department of Mathematics and Statistics McGill University. October 28, 2006

David A. Stephens Department of Mathematics and Statistics McGill University. October 28, 2006 556: MATHEMATICAL STATISTICS I COMPUTING THE HYPEBOLIC SECANT DISTIBUTION CHAACTEISTIC FUNCTION David A. Stephens Department of Mathematics and Statistics McGill University October 8, 6 Abstract We give

More information

II. FOURIER TRANSFORM ON L 1 (R)

II. FOURIER TRANSFORM ON L 1 (R) II. FOURIER TRANSFORM ON L 1 (R) In this chapter we will discuss the Fourier transform of Lebesgue integrable functions defined on R. To fix the notation, we denote L 1 (R) = {f : R C f(t) dt < }. The

More information

Stochastic Models (Lecture #4)

Stochastic Models (Lecture #4) Stochastic Models (Lecture #4) Thomas Verdebout Université libre de Bruxelles (ULB) Today Today, our goal will be to discuss limits of sequences of rv, and to study famous limiting results. Convergence

More information

8 Laws of large numbers

8 Laws of large numbers 8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable

More information

MATHS & STATISTICS OF MEASUREMENT

MATHS & STATISTICS OF MEASUREMENT Imperial College London BSc/MSci EXAMINATION June 2008 This paper is also taken for the relevant Examination for the Associateship MATHS & STATISTICS OF MEASUREMENT For Second-Year Physics Students Tuesday,

More information

Math 341: Probability Seventeenth Lecture (11/10/09)

Math 341: Probability Seventeenth Lecture (11/10/09) Math 341: Probability Seventeenth Lecture (11/10/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams

More information

Lecture I: Asymptotics for large GUE random matrices

Lecture I: Asymptotics for large GUE random matrices Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random

More information

Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27

Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27 Probability Review Yutian Li Stanford University January 18, 2018 Yutian Li (Stanford University) Probability Review January 18, 2018 1 / 27 Outline 1 Elements of probability 2 Random variables 3 Multiple

More information

Transform Techniques - CF

Transform Techniques - CF Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t t M () t E[ e ] e Characteristic Function (CF) k t k For a real ω, the characteristic function

More information

M412 Assignment 9 Solutions

M412 Assignment 9 Solutions M4 Assignment 9 Solutions. [ pts] Use separation of variables to show that solutions to the quarter-plane problem can be written in the form u t u xx ; t>,

More information

Fourier transforms. Up to now, we ve been expressing functions on finite intervals (usually the interval 0 x L or L x L) as Fourier series: a n cos L

Fourier transforms. Up to now, we ve been expressing functions on finite intervals (usually the interval 0 x L or L x L) as Fourier series: a n cos L ourier transforms Motivation and definition Up to now, we ve been expressing functions on finite intervals (usually the interval 0 x or x ) as ourier series: fpxq a 0 8 nπx a n cos n b n sin nπx where

More information

Probability and Distributions

Probability and Distributions Probability and Distributions What is a statistical model? A statistical model is a set of assumptions by which the hypothetical population distribution of data is inferred. It is typically postulated

More information

REVIEW OF MAIN CONCEPTS AND FORMULAS A B = Ā B. Pr(A B C) = Pr(A) Pr(A B C) =Pr(A) Pr(B A) Pr(C A B)

REVIEW OF MAIN CONCEPTS AND FORMULAS A B = Ā B. Pr(A B C) = Pr(A) Pr(A B C) =Pr(A) Pr(B A) Pr(C A B) REVIEW OF MAIN CONCEPTS AND FORMULAS Boolean algebra of events (subsets of a sample space) DeMorgan s formula: A B = Ā B A B = Ā B The notion of conditional probability, and of mutual independence of two

More information

MATH FALL 2014 HOMEWORK 10 SOLUTIONS

MATH FALL 2014 HOMEWORK 10 SOLUTIONS Problem 1. MATH 241-2 FA 214 HOMEWORK 1 SOUTIONS Note that u E (x) 1 ( x) is an equilibrium distribution for the homogeneous pde that satisfies the given boundary conditions. We therefore want to find

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,

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

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction

More information

Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes

Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of

More information

We denote the space of distributions on Ω by D ( Ω) 2.

We denote the space of distributions on Ω by D ( Ω) 2. Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study

More information

Transform Techniques - CF

Transform Techniques - CF Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t e k p ( k) discrete t t k M () t E[ e ] e t e f d continuous Characteristic Function (CF)

More information

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3)

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3) STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 07 Néhémy Lim Moment functions Moments of a random variable Definition.. Let X be a rrv on probability space (Ω, A, P). For a given r N, E[X r ], if it

More information

PROBABILITY THEORY LECTURE 3

PROBABILITY THEORY LECTURE 3 PROBABILITY THEORY LECTURE 3 Per Sidén Division of Statistics Dept. of Computer and Information Science Linköping University PER SIDÉN (STATISTICS, LIU) PROBABILITY THEORY - L3 1 / 15 OVERVIEW LECTURE

More information

A Brief Analysis of Central Limit Theorem. SIAM Chapter Florida State University

A Brief Analysis of Central Limit Theorem. SIAM Chapter Florida State University 1 / 36 A Brief Analysis of Central Limit Theorem Omid Khanmohamadi (okhanmoh@math.fsu.edu) Diego Hernán Díaz Martínez (ddiazmar@math.fsu.edu) Tony Wills (twills@math.fsu.edu) Kouadio David Yao (kyao@math.fsu.edu)

More information

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

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

Mathematical Methods and its Applications (Solution of assignment-12) Solution 1 From the definition of Fourier transforms, we have.

Mathematical Methods and its Applications (Solution of assignment-12) Solution 1 From the definition of Fourier transforms, we have. For 2 weeks course only Mathematical Methods and its Applications (Solution of assignment-2 Solution From the definition of Fourier transforms, we have F e at2 e at2 e it dt e at2 +(it/a dt ( setting (

More information

1 Random Variable: Topics

1 Random Variable: Topics Note: Handouts DO NOT replace the book. In most cases, they only provide a guideline on topics and an intuitive feel. 1 Random Variable: Topics Chap 2, 2.1-2.4 and Chap 3, 3.1-3.3 What is a random variable?

More information

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function Generating and characteristic functions Generating and Characteristic Functions September 3, 03 Probability generating function Moment generating function Power series expansion Characteristic function

More information

Gaussian vectors and central limit theorem

Gaussian vectors and central limit theorem Gaussian vectors and central limit theorem Samy Tindel Purdue University Probability Theory 2 - MA 539 Samy T. Gaussian vectors & CLT Probability Theory 1 / 86 Outline 1 Real Gaussian random variables

More information

Chapter 3: Random Variables 1

Chapter 3: Random Variables 1 Chapter 3: Random Variables 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.

More information

17 The functional equation

17 The functional equation 18.785 Number theory I Fall 16 Lecture #17 11/8/16 17 The functional equation In the previous lecture we proved that the iemann zeta function ζ(s) has an Euler product and an analytic continuation to the

More information

Dangerous and Illegal Operations in Calculus Do we avoid differentiating discontinuous functions because it s impossible, unwise, or simply out of

Dangerous and Illegal Operations in Calculus Do we avoid differentiating discontinuous functions because it s impossible, unwise, or simply out of Dangerous and Illegal Operations in Calculus Do we avoid differentiating discontinuous functions because it s impossible, unwise, or simply out of ignorance and fear? Despite the risks, many natural phenomena

More information

CSE 312, 2017 Winter, W.L. Ruzzo. 7. continuous random variables

CSE 312, 2017 Winter, W.L. Ruzzo. 7. continuous random variables CSE 312, 2017 Winter, W.L. Ruzzo 7. continuous random variables The new bit continuous random variables Discrete random variable: values in a finite or countable set, e.g. X {1,2,..., 6} with equal probability

More information

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and

More information

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012 Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM

More information

Continuous distributions

Continuous distributions CHAPTER 7 Continuous distributions 7.. Introduction A r.v. X is said to have a continuous distribution if there exists a nonnegative function f such that P(a X b) = ˆ b a f(x)dx for every a and b. distribution.)

More information

Generalized Central Limit Theorem and Extreme Value Statistics

Generalized Central Limit Theorem and Extreme Value Statistics Generalized Central Limit Theorem and Extreme Value Statistics Ariel Amir, 9/2017 Let us consider some distribution P (x) from which we draw x1, x2,..., xn. If the distribution has a finite standard deviation

More information

APPM/MATH 4/5520 Solutions to Exam I Review Problems. f X 1,X 2. 2e x 1 x 2. = x 2

APPM/MATH 4/5520 Solutions to Exam I Review Problems. f X 1,X 2. 2e x 1 x 2. = x 2 APPM/MATH 4/5520 Solutions to Exam I Review Problems. (a) f X (x ) f X,X 2 (x,x 2 )dx 2 x 2e x x 2 dx 2 2e 2x x was below x 2, but when marginalizing out x 2, we ran it over all values from 0 to and so

More information

MTH 3102 Complex Variables Solutions: Practice Exam 2 Mar. 26, 2017

MTH 3102 Complex Variables Solutions: Practice Exam 2 Mar. 26, 2017 Name Last name, First name): MTH 31 omplex Variables Solutions: Practice Exam Mar. 6, 17 Exam Instructions: You have 1 hour & 1 minutes to complete the exam. There are a total of 7 problems. You must show

More information

Math 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential.

Math 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential. Math 8A Lecture 6 Friday May 7 th Epectation Recall the three main probability density functions so far () Uniform () Eponential (3) Power Law e, ( ), Math 8A Lecture 6 Friday May 7 th Epectation Eample

More information

Pointwise convergence rates and central limit theorems for kernel density estimators in linear processes

Pointwise convergence rates and central limit theorems for kernel density estimators in linear processes Pointwise convergence rates and central limit theorems for kernel density estimators in linear processes Anton Schick Binghamton University Wolfgang Wefelmeyer Universität zu Köln Abstract Convergence

More information

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes. Fourier series Fourier series of a periodic function f (t) with period T and corresponding angular frequency ω /T : f (t) a 0 + (a n cos(nωt) + b n sin(nωt)), n1 Fourier series is a linear sum of cosine

More information

Chapter One. The Calderón-Zygmund Theory I: Ellipticity

Chapter One. The Calderón-Zygmund Theory I: Ellipticity Chapter One The Calderón-Zygmund Theory I: Ellipticity Our story begins with a classical situation: convolution with homogeneous, Calderón- Zygmund ( kernels on R n. Let S n 1 R n denote the unit sphere

More information

More on Distribution Function

More on Distribution Function More on Distribution Function The distribution of a random variable X can be determined directly from its cumulative distribution function F X. Theorem: Let X be any random variable, with cumulative distribution

More information

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as L30-1 EEL 5544 Noise in Linear Systems Lecture 30 OTHER TRANSFORMS For a continuous, nonnegative RV X, the Laplace transform of X is X (s) = E [ e sx] = 0 f X (x)e sx dx. For a nonnegative RV, the Laplace

More information

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015 Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 8 10/1/2008 CONTINUOUS RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 8 10/1/2008 CONTINUOUS RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 8 10/1/2008 CONTINUOUS RANDOM VARIABLES Contents 1. Continuous random variables 2. Examples 3. Expected values 4. Joint distributions

More information

CS711008Z Algorithm Design and Analysis

CS711008Z Algorithm Design and Analysis CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial

More information

Chap 2.1 : Random Variables

Chap 2.1 : Random Variables Chap 2.1 : Random Variables Let Ω be sample space of a probability model, and X a function that maps every ξ Ω, toa unique point x R, the set of real numbers. Since the outcome ξ is not certain, so is

More information

Bayesian decision theory Introduction to Pattern Recognition. Lectures 4 and 5: Bayesian decision theory

Bayesian decision theory Introduction to Pattern Recognition. Lectures 4 and 5: Bayesian decision theory Bayesian decision theory 8001652 Introduction to Pattern Recognition. Lectures 4 and 5: Bayesian decision theory Jussi Tohka jussi.tohka@tut.fi Institute of Signal Processing Tampere University of Technology

More information

Exercises with solutions (Set D)

Exercises with solutions (Set D) Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where

More information

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows. Chapter 5 Two Random Variables In a practical engineering problem, there is almost always causal relationship between different events. Some relationships are determined by physical laws, e.g., voltage

More information

Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages

Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages ELEC206 Probability and Random Processes, Fall 2014 Gil-Jin Jang gjang@knu.ac.kr School of EE, KNU page 1 / 15 Chapter 7. Sums of Random

More information

MAT 372 K.T.D.D. Final Sınavın Çözümleri N. Course. Question 1 (Canonical Forms). Consider the second order partial differential equation

MAT 372 K.T.D.D. Final Sınavın Çözümleri N. Course. Question 1 (Canonical Forms). Consider the second order partial differential equation OKAN ÜNİVERSİTESİ FEN EDEBİYAT FAKÜTESİ MATEMATİK BÖÜMÜ 1.5. MAT 7 K.T.D.D. Final Sınavın Çözümleri N. Course Question 1 (Canonical Forms). Consider the second order partial differential equation (sin

More information

CS145: Probability & Computing

CS145: Probability & Computing CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,

More information

ELEMENTS OF PROBABILITY THEORY

ELEMENTS OF PROBABILITY THEORY ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable

More information

STA205 Probability: Week 8 R. Wolpert

STA205 Probability: Week 8 R. Wolpert INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and

More information