Poisson process. Etienne Pardoux. Aix Marseille Université. Etienne Pardoux (AMU) CIMPA, Ziguinchor 1 / 8



Similar documents
How To Find Out How Much Money You Get From A Car Insurance Claim

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra

Extension of measure

Gambling Systems and Multiplication-Invariant Measures

Lecture 13: Martingales

An example of a computable

Mathematics for Econometrics, Fourth Edition

The Exponential Distribution

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

Grey Brownian motion and local times

Lecture Notes 1. Brief Review of Basic Probability

User Guide Thank you for purchasing the DX90

Mathematical Finance

Probability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..

Homework set 4 - Solutions

Poisson Processes. Chapter Exponential Distribution. The gamma function is defined by. Γ(α) = t α 1 e t dt, α > 0.

Math 526: Brownian Motion Notes

Cycles and clique-minors in expanders

STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE

Monte Carlo Methods in Finance

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS

Exponential Distribution

THE CENTRAL LIMIT THEOREM TORONTO

The Ideal Class Group

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

Important Probability Distributions OPRE 6301

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab

Spread-Based Credit Risk Models

. (3.3) n Note that supremum (3.2) must occur at one of the observed values x i or to the left of x i.

Mathematics Course 111: Algebra I Part IV: Vector Spaces

LOGNORMAL MODEL FOR STOCK PRICES

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis

CHAPTER IV - BROWNIAN MOTION

4: SINGLE-PERIOD MARKET MODELS

Poisson processes (and mixture distributions)

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

The 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].

About the inverse football pool problem for 9 games 1

Random variables, probability distributions, binomial random variable

University of Miskolc

Math 151. Rumbos Spring Solutions to Assignment #22

Binomial lattice model for stock prices

DISINTEGRATION OF MEASURES

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

How To Prove The Dirichlet Unit Theorem

What is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference

On Some Aspects of Investment into High-Yield Bonds

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

Strong control, conservative point estimation and simultaneous conservative consistency of false discovery rates: a unified approach

CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.

Hydrodynamic Limits of Randomized Load Balancing Networks

Marshall-Olkin distributions and portfolio credit risk

Modelling Patient Flow in an Emergency Department

Diusion processes. Olivier Scaillet. University of Geneva and Swiss Finance Institute

Fixed Point Theorems

Hedging bounded claims with bounded outcomes

1. Prove that the empty set is a subset of every set.

On Compulsory Per-Claim Deductibles in Automobile Insurance

Probability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X

Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Lecture 19: Chapter 8, Section 1 Sampling Distributions: Proportions

A spot price model feasible for electricity forward pricing Part II

Lecture Notes on Measure Theory and Functional Analysis

LECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet Göteborg (Version: January 12)

Master thesis. Non-life insurance risk models under inflation

A power series about x = a is the series of the form

MATHEMATICAL METHODS OF STATISTICS

Insurance models and risk-function premium principle

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

Mathematical Methods of Engineering Analysis

Polarization codes and the rate of polarization

Harnack Inequality for Some Classes of Markov Processes

Metric Spaces. Chapter Metrics

A Martingale System Theorem for Stock Investments

e.g. arrival of a customer to a service station or breakdown of a component in some system.

Math 4310 Handout - Quotient Vector Spaces

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Sensitivity analysis of European options in jump-diffusion models via the Malliavin calculus on the Wiener space

Lebesgue Measure on R n

How To Find F Divergences In Probability Theory

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Notes on metric spaces

ALOHA Performs Delay-Optimum Power Control

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

LECTURE 15: AMERICAN OPTIONS

Probability and statistics; Rehearsal for pattern recognition

M/M/1 and M/M/m Queueing Systems

Probability for Estimation (review)

Nonparametric adaptive age replacement with a one-cycle criterion

Gambling and Data Compression

Continued Fractions and the Euclidean Algorithm

For a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )

Transcription:

Poisson process Etienne Pardoux Aix Marseille Université Etienne Pardoux (AMU) CIMPA, Ziguinchor 1 / 8

The standard Poisson process Let λ > be given. A rate λ Poisson (counting) process is defined as P t = sup{k 1, T k t}, where = T < T 1 < T 2 < < T k < <, the r.v. s {T k T k 1, k 1} being independent and identically distributed, each following the law Exp(λ). We have Proposition For all n 1, < t 1 < t 2 < < t n, the r.v. s P t1, P t2 P t1,..., P tn P tn 1 are independent, and for all 1 k n, P tk P tk 1 Poi[λ(t k t k 1 )]. Etienne Pardoux (AMU) CIMPA, Ziguinchor 2 / 8

The standard Poisson process Let λ > be given. A rate λ Poisson (counting) process is defined as P t = sup{k 1, T k t}, where = T < T 1 < T 2 < < T k < <, the r.v. s {T k T k 1, k 1} being independent and identically distributed, each following the law Exp(λ). We have Proposition For all n 1, < t 1 < t 2 < < t n, the r.v. s P t1, P t2 P t1,..., P tn P tn 1 are independent, and for all 1 k n, P tk P tk 1 Poi[λ(t k t k 1 )]. Etienne Pardoux (AMU) CIMPA, Ziguinchor 2 / 8

Elementary convergence in law Lemma We have For all n 1, let U n be a B(n, p n ) random variable. If np n λ as n, with λ >, then U n converges in law towards Poi(λ). To do : Exercise Let {P t, t } be a rate λ Poisson process, and {T k, k 1} the random points of this Poisson process, such that for all t >, P t = sup{k 1, T k t}. Let < p < 1. Suppose that each T k is selected with probability p, not selected with probability 1 p, independently of the others. Let P t denote the number of selected points on the interval [, t]. Then {P t, t } is a rate λp Poisson process. Etienne Pardoux (AMU) CIMPA, Ziguinchor 3 / 8

Elementary convergence in law Lemma We have For all n 1, let U n be a B(n, p n ) random variable. If np n λ as n, with λ >, then U n converges in law towards Poi(λ). To do : Exercise Let {P t, t } be a rate λ Poisson process, and {T k, k 1} the random points of this Poisson process, such that for all t >, P t = sup{k 1, T k t}. Let < p < 1. Suppose that each T k is selected with probability p, not selected with probability 1 p, independently of the others. Let P t denote the number of selected points on the interval [, t]. Then {P t, t } is a rate λp Poisson process. Etienne Pardoux (AMU) CIMPA, Ziguinchor 3 / 8

Rate λ and rate 1 Poisson processes A Poisson process will be called standard if its rate is 1. If P is a standard Poisson process, then {P(λt), t } is a rate λ Poisson process. A rate λ Poisson process (λ > ) is a counting process {Q t, t } such that Q t λt is a martingale. Let {P(t), t } be a standard Poisson process (i.e. with rate 1). Then P(λt) λt is martingale, and it is not hard to show that {P(λt), t } is a rate λ Poisson process. Etienne Pardoux (AMU) CIMPA, Ziguinchor 4 / 8

Rate λ and rate 1 Poisson processes A Poisson process will be called standard if its rate is 1. If P is a standard Poisson process, then {P(λt), t } is a rate λ Poisson process. A rate λ Poisson process (λ > ) is a counting process {Q t, t } such that Q t λt is a martingale. Let {P(t), t } be a standard Poisson process (i.e. with rate 1). Then P(λt) λt is martingale, and it is not hard to show that {P(λt), t } is a rate λ Poisson process. Etienne Pardoux (AMU) CIMPA, Ziguinchor 4 / 8

Rate λ and rate 1 Poisson processes A Poisson process will be called standard if its rate is 1. If P is a standard Poisson process, then {P(λt), t } is a rate λ Poisson process. A rate λ Poisson process (λ > ) is a counting process {Q t, t } such that Q t λt is a martingale. Let {P(t), t } be a standard Poisson process (i.e. with rate 1). Then P(λt) λt is martingale, and it is not hard to show that {P(λt), t } is a rate λ Poisson process. Etienne Pardoux (AMU) CIMPA, Ziguinchor 4 / 8

Varying rate Let now {λ(t), t } be a measurable and locally ( integrable ) t R + valued function. Then the process {Q t := P λ(s)ds, t } is called a rate λ(t) Poisson process. Clearly M t = Q t t λ(s)ds is a martingale, i.e. M t is F t = σ{q s, s t} measurable, and for s < t, E[M t F s ] = M s. We now want to consider the case where λ is random. For that purpose, it is convenient to give an alternative definition of the above process Q t. Etienne Pardoux (AMU) CIMPA, Ziguinchor 5 / 8

Varying rate Let now {λ(t), t } be a measurable and locally ( integrable ) t R + valued function. Then the process {Q t := P λ(s)ds, t } is called a rate λ(t) Poisson process. Clearly M t = Q t t λ(s)ds is a martingale, i.e. M t is F t = σ{q s, s t} measurable, and for s < t, E[M t F s ] = M s. We now want to consider the case where λ is random. For that purpose, it is convenient to give an alternative definition of the above process Q t. Etienne Pardoux (AMU) CIMPA, Ziguinchor 5 / 8

Poisson Random Measures Consider a standard Poisson random measure N on R + 2, which is defined as follows. N is the counting process associated to a random cloud of points in R 2 +. One way to construct that cloud of points is as follows. We can consider R 2 + = i=1 A i, where the A i s are disjoints squares with Lebesgue measure 1. Let K i, i 1 be i.i.d. Poisson r.v. s with mean one. Let {Xj i, j 1, i 1} be independent random points of R2 +, which are such that for any i 1, the Xj i s are uniformly distributed in A i. Then K i N(dx) = δ X i (dx). J i=1 j=1 λ(t) denoting a positive valued measurable function, the above {Q t, t } has the same law as Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 6 / 8

Poisson Random Measures Consider a standard Poisson random measure N on R + 2, which is defined as follows. N is the counting process associated to a random cloud of points in R 2 +. One way to construct that cloud of points is as follows. We can consider R 2 + = i=1 A i, where the A i s are disjoints squares with Lebesgue measure 1. Let K i, i 1 be i.i.d. Poisson r.v. s with mean one. Let {Xj i, j 1, i 1} be independent random points of R2 +, which are such that for any i 1, the Xj i s are uniformly distributed in A i. Then K i N(dx) = δ X i (dx). J i=1 j=1 λ(t) denoting a positive valued measurable function, the above {Q t, t } has the same law as Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 6 / 8

Poisson Random Measures Consider a standard Poisson random measure N on R + 2, which is defined as follows. N is the counting process associated to a random cloud of points in R 2 +. One way to construct that cloud of points is as follows. We can consider R 2 + = i=1 A i, where the A i s are disjoints squares with Lebesgue measure 1. Let K i, i 1 be i.i.d. Poisson r.v. s with mean one. Let {Xj i, j 1, i 1} be independent random points of R2 +, which are such that for any i 1, the Xj i s are uniformly distributed in A i. Then K i N(dx) = δ X i (dx). J i=1 j=1 λ(t) denoting a positive valued measurable function, the above {Q t, t } has the same law as Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 6 / 8

Random rate Let now {λ(t), t } be an R + valued stochastic process, which is assumed to be predictable, in the following sense. Let for t F t = σ{n(a), A Borel subset of [, t] R + }, and consider the σ algebra of subset of [, ) Ω generated by the subsets of the form 1 (s,t] 1 F, where s < t and F F s, which is called the predictable σ algebra. We assume moreover that E t λ(s)ds < for all t >. We now define as above Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 7 / 8

Random rate Let now {λ(t), t } be an R + valued stochastic process, which is assumed to be predictable, in the following sense. Let for t F t = σ{n(a), A Borel subset of [, t] R + }, and consider the σ algebra of subset of [, ) Ω generated by the subsets of the form 1 (s,t] 1 F, where s < t and F F s, which is called the predictable σ algebra. We assume moreover that E t λ(s)ds < for all t >. We now define as above Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 7 / 8

Random rate Let now {λ(t), t } be an R + valued stochastic process, which is assumed to be predictable, in the following sense. Let for t F t = σ{n(a), A Borel subset of [, t] R + }, and consider the σ algebra of subset of [, ) Ω generated by the subsets of the form 1 (s,t] 1 F, where s < t and F F s, which is called the predictable σ algebra. We assume moreover that E t λ(s)ds < for all t >. We now define as above Q t = t λ(s) N(ds, du). Etienne Pardoux (AMU) CIMPA, Ziguinchor 7 / 8

Lemma We have Q t t λ(s)ds is a martingale. Indication of proof : For any δ >, let Q δ t = t λ(s δ) N(ds, du), where λ(s) = for s <. It is not hard to show that Qt δ t λ(s δ)ds is a martingale which converges in L1 (Ω) to Q t t λ(s)ds. The result follows. If we let σ(t) = inf{r >, r λ(s)ds > t}, we have that P(t) := Q σ(t) is a standard Poisson process, and it is plain that ( t Q t = P ). λ(s)ds Etienne Pardoux (AMU) CIMPA, Ziguinchor 8 / 8

Lemma We have Q t t λ(s)ds is a martingale. Indication of proof : For any δ >, let Q δ t = t λ(s δ) N(ds, du), where λ(s) = for s <. It is not hard to show that Qt δ t λ(s δ)ds is a martingale which converges in L1 (Ω) to Q t t λ(s)ds. The result follows. If we let σ(t) = inf{r >, r λ(s)ds > t}, we have that P(t) := Q σ(t) is a standard Poisson process, and it is plain that ( t Q t = P ). λ(s)ds Etienne Pardoux (AMU) CIMPA, Ziguinchor 8 / 8

Lemma We have Q t t λ(s)ds is a martingale. Indication of proof : For any δ >, let Q δ t = t λ(s δ) N(ds, du), where λ(s) = for s <. It is not hard to show that Qt δ t λ(s δ)ds is a martingale which converges in L1 (Ω) to Q t t λ(s)ds. The result follows. If we let σ(t) = inf{r >, r λ(s)ds > t}, we have that P(t) := Q σ(t) is a standard Poisson process, and it is plain that ( t Q t = P ). λ(s)ds Etienne Pardoux (AMU) CIMPA, Ziguinchor 8 / 8