66
18.175: Lecture 13 Infinite divisibility and L´ evy processes Scott Sheffield MIT 18.175 Lecture 13

18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

  • Upload
    others

  • View
    0

  • Download
    0

Embed Size (px)

Citation preview

Page 1: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

18.175: Lecture 13

Infinite divisibility and Levy processes

Scott Sheffield

MIT

18.175 Lecture 13

Page 2: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 3: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 4: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 5: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 6: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 7: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 8: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 9: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 10: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 11: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson random variables: motivating questions

I How many raindrops hit a given square inch of sidewalkduring a ten minute period?

I How many people fall down the stairs in a major city on agiven day?

I How many plane crashes in a given year?

I How many radioactive particles emitted during a time periodin which the expected number emitted is 5?

I How many calls to call center during a given minute?

I How many goals scored during a 90 minute soccer game?

I How many notable gaffes during 90 minute debate?

I Key idea for all these examples: Divide time into largenumber of small increments. Assume that during eachincrement, there is some small probability of thing happening(independently of other increments).

18.175 Lecture 13

Page 12: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 13: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 14: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 15: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 16: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 17: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 18: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 19: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Bernoulli random variable with n large and np = λ

I Let λ be some moderate-sized number. Say λ = 2 or λ = 3.Let n be a huge number, say n = 106.

I Suppose I have a coin that comes up heads with probabilityλ/n and I toss it n times.

I How many heads do I expect to see?

I Answer: np = λ.

I Let k be some moderate sized number (say k = 4). What isthe probability that I see exactly k heads?

I Binomial formula:(nk

)pk(1− p)n−k = n(n−1)(n−2)...(n−k+1)

k! pk(1− p)n−k .

I This is approximately λk

k! (1− p)n−k ≈ λk

k! e−λ.

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

18.175 Lecture 13

Page 20: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Probabilities sum to one

I A Poisson random variable X with parameter λ satisfiesp(k) = P{X = k} = λk

k! e−λ for integer k ≥ 0.

I How can we show that∑∞

k=0 p(k) = 1?

I Use Taylor expansion eλ =∑∞

k=0λk

k! .

18.175 Lecture 13

Page 21: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Probabilities sum to one

I A Poisson random variable X with parameter λ satisfiesp(k) = P{X = k} = λk

k! e−λ for integer k ≥ 0.

I How can we show that∑∞

k=0 p(k) = 1?

I Use Taylor expansion eλ =∑∞

k=0λk

k! .

18.175 Lecture 13

Page 22: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Probabilities sum to one

I A Poisson random variable X with parameter λ satisfiesp(k) = P{X = k} = λk

k! e−λ for integer k ≥ 0.

I How can we show that∑∞

k=0 p(k) = 1?

I Use Taylor expansion eλ =∑∞

k=0λk

k! .

18.175 Lecture 13

Page 23: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 24: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 25: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 26: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 27: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 28: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Expectation

I A Poisson random variable X with parameter λ satisfiesP{X = k} = λk

k! e−λ for integer k ≥ 0.

I What is E [X ]?

I We think of a Poisson random variable as being (roughly) aBernoulli (n, p) random variable with n very large andp = λ/n.

I This would suggest E [X ] = λ. Can we show this directly fromthe formula for P{X = k}?

I By definition of expectation

E [X ] =∞∑k=0

P{X = k}k =∞∑k=0

kλk

k!e−λ =

∞∑k=1

λk

(k − 1)!e−λ.

I Setting j = k − 1, this is λ∑∞

j=0λj

j! e−λ = λ.

18.175 Lecture 13

Page 29: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 30: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 31: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 32: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 33: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 34: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 35: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Variance

I Given P{X = k} = λk

k! e−λ for integer k ≥ 0, what is Var[X ]?

I Think of X as (roughly) a Bernoulli (n, p) random variablewith n very large and p = λ/n.

I This suggests Var[X ] ≈ npq ≈ λ (since np ≈ λ andq = 1− p ≈ 1). Can we show directly that Var[X ] = λ?

I Compute

E [X 2] =∞∑k=0

P{X = k}k2 =∞∑k=0

k2λk

k!e−λ = λ

∞∑k=1

kλk−1

(k − 1)!e−λ.

I Setting j = k − 1, this is

λ

∞∑j=0

(j + 1)λj

j!e−λ

= λE [X + 1] = λ(λ+ 1).

I Then Var[X ] = E [X 2]− E [X ]2 = λ(λ+ 1)− λ2 = λ.

18.175 Lecture 13

Page 36: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson convergence

I Idea: if we have lots of independent random events, each withvery small probability to occur, and expected number to occuris λ, then total number that occur is roughly Poisson λ.

I Theorem: Let Xn,m be independent {0, 1}-valued randomvariables with P(Xn,m = 1) = pn,m. Suppose

∑nm=1 pn,m → λ

and max1≤m≤n pn,m → 0. ThenSn = Xn,1 + . . .+ Xn,n =⇒ Z were Z is Poisson(λ).

I Proof idea: Just write down the log characteristic functionsfor Bernoulli and Poisson random variables. Check theconditions of the continuity theorem.

18.175 Lecture 13

Page 37: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson convergence

I Idea: if we have lots of independent random events, each withvery small probability to occur, and expected number to occuris λ, then total number that occur is roughly Poisson λ.

I Theorem: Let Xn,m be independent {0, 1}-valued randomvariables with P(Xn,m = 1) = pn,m. Suppose

∑nm=1 pn,m → λ

and max1≤m≤n pn,m → 0. ThenSn = Xn,1 + . . .+ Xn,n =⇒ Z were Z is Poisson(λ).

I Proof idea: Just write down the log characteristic functionsfor Bernoulli and Poisson random variables. Check theconditions of the continuity theorem.

18.175 Lecture 13

Page 38: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Poisson convergence

I Idea: if we have lots of independent random events, each withvery small probability to occur, and expected number to occuris λ, then total number that occur is roughly Poisson λ.

I Theorem: Let Xn,m be independent {0, 1}-valued randomvariables with P(Xn,m = 1) = pn,m. Suppose

∑nm=1 pn,m → λ

and max1≤m≤n pn,m → 0. ThenSn = Xn,1 + . . .+ Xn,n =⇒ Z were Z is Poisson(λ).

I Proof idea: Just write down the log characteristic functionsfor Bernoulli and Poisson random variables. Check theconditions of the continuity theorem.

18.175 Lecture 13

Page 39: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 40: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 41: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall continuity theorem

I Strong continuity theorem: If µn =⇒ µ∞ thenφn(t)→ φ∞(t) for all t. Conversely, if φn(t) converges to alimit that is continuous at 0, then the associated sequence ofdistributions µn is tight and converges weakly to a measure µwith characteristic function φ.

18.175 Lecture 13

Page 42: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable law construction

I Suppose that P(X1 > x) = P(X1 < −x) = x−α/2 for0 < α < 2. This is a random variable with a “power law tail”.

I Compute 1− φ(t) ≈ C |t|α when |t| is large.

I If X1,X2, . . . have same law as X1 then we haveE exp(itSn/n

1/α) = φ(t/nα)n =(1− (1− φ(t/n1/α))

). As

n→∞, this converges pointwise to exp(−C |t|α).

I Conclude by continuity theorems that Xn/n1/α =⇒ Y where

Y is a random variable with φY (t) = exp(−C |t|α)

I Let’s look up stable distributions. Up to affinetransformations, this is just a two-parameter family withcharacteristic functions exp[−|t|α(1− iβsgn(t)Φ)] whereΦ = tan(πα/2) where β ∈ [−1, 1] and α ∈ (0, 2].

18.175 Lecture 13

Page 43: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable law construction

I Suppose that P(X1 > x) = P(X1 < −x) = x−α/2 for0 < α < 2. This is a random variable with a “power law tail”.

I Compute 1− φ(t) ≈ C |t|α when |t| is large.

I If X1,X2, . . . have same law as X1 then we haveE exp(itSn/n

1/α) = φ(t/nα)n =(1− (1− φ(t/n1/α))

). As

n→∞, this converges pointwise to exp(−C |t|α).

I Conclude by continuity theorems that Xn/n1/α =⇒ Y where

Y is a random variable with φY (t) = exp(−C |t|α)

I Let’s look up stable distributions. Up to affinetransformations, this is just a two-parameter family withcharacteristic functions exp[−|t|α(1− iβsgn(t)Φ)] whereΦ = tan(πα/2) where β ∈ [−1, 1] and α ∈ (0, 2].

18.175 Lecture 13

Page 44: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable law construction

I Suppose that P(X1 > x) = P(X1 < −x) = x−α/2 for0 < α < 2. This is a random variable with a “power law tail”.

I Compute 1− φ(t) ≈ C |t|α when |t| is large.

I If X1,X2, . . . have same law as X1 then we haveE exp(itSn/n

1/α) = φ(t/nα)n =(1− (1− φ(t/n1/α))

). As

n→∞, this converges pointwise to exp(−C |t|α).

I Conclude by continuity theorems that Xn/n1/α =⇒ Y where

Y is a random variable with φY (t) = exp(−C |t|α)

I Let’s look up stable distributions. Up to affinetransformations, this is just a two-parameter family withcharacteristic functions exp[−|t|α(1− iβsgn(t)Φ)] whereΦ = tan(πα/2) where β ∈ [−1, 1] and α ∈ (0, 2].

18.175 Lecture 13

Page 45: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable law construction

I Suppose that P(X1 > x) = P(X1 < −x) = x−α/2 for0 < α < 2. This is a random variable with a “power law tail”.

I Compute 1− φ(t) ≈ C |t|α when |t| is large.

I If X1,X2, . . . have same law as X1 then we haveE exp(itSn/n

1/α) = φ(t/nα)n =(1− (1− φ(t/n1/α))

). As

n→∞, this converges pointwise to exp(−C |t|α).

I Conclude by continuity theorems that Xn/n1/α =⇒ Y where

Y is a random variable with φY (t) = exp(−C |t|α)

I Let’s look up stable distributions. Up to affinetransformations, this is just a two-parameter family withcharacteristic functions exp[−|t|α(1− iβsgn(t)Φ)] whereΦ = tan(πα/2) where β ∈ [−1, 1] and α ∈ (0, 2].

18.175 Lecture 13

Page 46: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable law construction

I Suppose that P(X1 > x) = P(X1 < −x) = x−α/2 for0 < α < 2. This is a random variable with a “power law tail”.

I Compute 1− φ(t) ≈ C |t|α when |t| is large.

I If X1,X2, . . . have same law as X1 then we haveE exp(itSn/n

1/α) = φ(t/nα)n =(1− (1− φ(t/n1/α))

). As

n→∞, this converges pointwise to exp(−C |t|α).

I Conclude by continuity theorems that Xn/n1/α =⇒ Y where

Y is a random variable with φY (t) = exp(−C |t|α)

I Let’s look up stable distributions. Up to affinetransformations, this is just a two-parameter family withcharacteristic functions exp[−|t|α(1− iβsgn(t)Φ)] whereΦ = tan(πα/2) where β ∈ [−1, 1] and α ∈ (0, 2].

18.175 Lecture 13

Page 47: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable-Poisson connection

I Let’s think some more about this example, whereP(X1 > x) = P(X1 < −x) = x−α/2 for 0 < α < 2 andX1,X2, . . . are i.i.d.

I Now P(an1/α < X1 < bn1α = 12(a−α − b−α)n−1.

I So {m ≤ n : Xm/n1/α ∈ (a, b)} converges to a Poisson

distribution with mean (a−α − b−α)/2.

I More generally {m ≤ n : Xm/n1/α ∈ (a, b)} converges in law

to Poisson with mean∫A

α2|x |α+1 dx <∞.

18.175 Lecture 13

Page 48: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable-Poisson connection

I Let’s think some more about this example, whereP(X1 > x) = P(X1 < −x) = x−α/2 for 0 < α < 2 andX1,X2, . . . are i.i.d.

I Now P(an1/α < X1 < bn1α = 12(a−α − b−α)n−1.

I So {m ≤ n : Xm/n1/α ∈ (a, b)} converges to a Poisson

distribution with mean (a−α − b−α)/2.

I More generally {m ≤ n : Xm/n1/α ∈ (a, b)} converges in law

to Poisson with mean∫A

α2|x |α+1 dx <∞.

18.175 Lecture 13

Page 49: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable-Poisson connection

I Let’s think some more about this example, whereP(X1 > x) = P(X1 < −x) = x−α/2 for 0 < α < 2 andX1,X2, . . . are i.i.d.

I Now P(an1/α < X1 < bn1α = 12(a−α − b−α)n−1.

I So {m ≤ n : Xm/n1/α ∈ (a, b)} converges to a Poisson

distribution with mean (a−α − b−α)/2.

I More generally {m ≤ n : Xm/n1/α ∈ (a, b)} converges in law

to Poisson with mean∫A

α2|x |α+1 dx <∞.

18.175 Lecture 13

Page 50: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Recall stable-Poisson connection

I Let’s think some more about this example, whereP(X1 > x) = P(X1 < −x) = x−α/2 for 0 < α < 2 andX1,X2, . . . are i.i.d.

I Now P(an1/α < X1 < bn1α = 12(a−α − b−α)n−1.

I So {m ≤ n : Xm/n1/α ∈ (a, b)} converges to a Poisson

distribution with mean (a−α − b−α)/2.

I More generally {m ≤ n : Xm/n1/α ∈ (a, b)} converges in law

to Poisson with mean∫A

α2|x |α+1 dx <∞.

18.175 Lecture 13

Page 51: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Domain of attraction to stable random variable

I More generality: suppose thatlimx→∞ P(X1 > x)/P(|X1| > x) = θ ∈ [0, 1] andP(|X1| > x) = x−αL(x) where L is slowly varying (whichmeans limx→∞ L(tx)/L(x) = 1 for all t > 0).

I Theorem: Then (Sn − bn)/an converges in law to limitingrandom variable, for appropriate an and bn values.

18.175 Lecture 13

Page 52: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Domain of attraction to stable random variable

I More generality: suppose thatlimx→∞ P(X1 > x)/P(|X1| > x) = θ ∈ [0, 1] andP(|X1| > x) = x−αL(x) where L is slowly varying (whichmeans limx→∞ L(tx)/L(x) = 1 for all t > 0).

I Theorem: Then (Sn − bn)/an converges in law to limitingrandom variable, for appropriate an and bn values.

18.175 Lecture 13

Page 53: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 54: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 55: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 56: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 57: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 58: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 59: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 60: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Infinitely divisible laws

I Say a random variable X is infinitely divisible, for each n,there is a random variable Y such that X has the same law asthe sum of n i.i.d. copies of Y .

I What random variables are infinitely divisible?

I Poisson, Cauchy, normal, stable, etc.

I Let’s look at the characteristic functions of these objects.What about compound Poisson random variables (linearcombinations of independent Poisson random variables)?What are their characteristic functions like?

I What if have a random variable X and then we choose aPoisson random variable N and add up N independent copiesof X .

I More general constructions are possible via Levy Khintchinerepresentation.

18.175 Lecture 13

Page 61: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 62: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Outline

Poisson random variable convergence

Extend CLT idea to stable random variables

Infinite divisibility

Higher dimensional CFs and CLTs

18.175 Lecture 13

Page 63: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Higher dimensional limit theorems

I Much of the CLT story generalizes to higher dimensionalrandom variables.

I For example, given a random vector (X ,Y ,Z ), we can defineφ(a, b, c) = Ee i(aX+bY+cZ).

I This is just a higher dimensional Fourier transform of thedensity function.

I The inversion theorems and continuity theorems that applyhere are essentially the same as in the one-dimensional case.

18.175 Lecture 13

Page 64: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Higher dimensional limit theorems

I Much of the CLT story generalizes to higher dimensionalrandom variables.

I For example, given a random vector (X ,Y ,Z ), we can defineφ(a, b, c) = Ee i(aX+bY+cZ).

I This is just a higher dimensional Fourier transform of thedensity function.

I The inversion theorems and continuity theorems that applyhere are essentially the same as in the one-dimensional case.

18.175 Lecture 13

Page 65: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Higher dimensional limit theorems

I Much of the CLT story generalizes to higher dimensionalrandom variables.

I For example, given a random vector (X ,Y ,Z ), we can defineφ(a, b, c) = Ee i(aX+bY+cZ).

I This is just a higher dimensional Fourier transform of thedensity function.

I The inversion theorems and continuity theorems that applyhere are essentially the same as in the one-dimensional case.

18.175 Lecture 13

Page 66: 18.175: Lecture 13 .1in Infinite divisibility and Lévy processesmath.mit.edu/~sheffield/2016175/Lecture13.pdf · 18.175: Lecture 13 In nite divisibility and L evy processes Scott

Higher dimensional limit theorems

I Much of the CLT story generalizes to higher dimensionalrandom variables.

I For example, given a random vector (X ,Y ,Z ), we can defineφ(a, b, c) = Ee i(aX+bY+cZ).

I This is just a higher dimensional Fourier transform of thedensity function.

I The inversion theorems and continuity theorems that applyhere are essentially the same as in the one-dimensional case.

18.175 Lecture 13