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

Size: px
Start display at page:

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

Transcription

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

2 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

3 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

4 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

5 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

6 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

7 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

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

9 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

10 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

11 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

12 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

13 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

14 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

15 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

16 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

17 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

18 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

19 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

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

How To Find Out How Much Money You Get From A Car Insurance Claim Chapter 11. Poisson processes. Section 11.4. Superposition and decomposition of a Poisson process. Extract from: Arcones Fall 2009 Edition, available at http://www.actexmadriver.com/ 1/18 Superposition

More information

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

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra 54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue

More information

Extension of measure

Extension of measure 1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.

More information

Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

More information

Lecture 13: Martingales

Lecture 13: Martingales Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of

More information

An example of a computable

An example of a computable An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

More information

Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

More information

The Exponential Distribution

The Exponential Distribution 21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding

More information

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

Grey Brownian motion and local times

Grey Brownian motion and local times Grey Brownian motion and local times José Luís da Silva 1,2 (Joint work with: M. Erraoui 3 ) 2 CCM - Centro de Ciências Matemáticas, University of Madeira, Portugal 3 University Cadi Ayyad, Faculty of

More information

Lecture Notes 1. Brief Review of Basic Probability

Lecture Notes 1. Brief Review of Basic Probability Probability Review Lecture Notes Brief Review of Basic Probability I assume you know basic probability. Chapters -3 are a review. I will assume you have read and understood Chapters -3. Here is a very

More information

Mathematical Finance

Mathematical Finance Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European

More information

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

Probability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,

More information

Homework set 4 - Solutions

Homework set 4 - Solutions Homework set 4 - Solutions Math 495 Renato Feres Problems R for continuous time Markov chains The sequence of random variables of a Markov chain may represent the states of a random system recorded at

More information

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

Poisson Processes. Chapter 5. 5.1 Exponential Distribution. The gamma function is defined by. Γ(α) = t α 1 e t dt, α > 0. Chapter 5 Poisson Processes 5.1 Exponential Distribution The gamma function is defined by Γ(α) = t α 1 e t dt, α >. Theorem 5.1. The gamma function satisfies the following properties: (a) For each α >

More information

Math 526: Brownian Motion Notes

Math 526: Brownian Motion Notes Math 526: Brownian Motion Notes Definition. Mike Ludkovski, 27, all rights reserved. A stochastic process (X t ) is called Brownian motion if:. The map t X t (ω) is continuous for every ω. 2. (X t X t

More information

Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

More information

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

STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE TROY BUTLER 1. Random variables and distributions We are often presented with descriptions of problems involving some level of uncertainty about

More information

Monte Carlo Methods in Finance

Monte Carlo Methods in Finance Author: Yiyang Yang Advisor: Pr. Xiaolin Li, Pr. Zari Rachev Department of Applied Mathematics and Statistics State University of New York at Stony Brook October 2, 2012 Outline Introduction 1 Introduction

More information

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

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)

More information

Exponential Distribution

Exponential Distribution Exponential Distribution Definition: Exponential distribution with parameter λ: { λe λx x 0 f(x) = 0 x < 0 The cdf: F(x) = x Mean E(X) = 1/λ. f(x)dx = Moment generating function: φ(t) = E[e tx ] = { 1

More information

THE CENTRAL LIMIT THEOREM TORONTO

THE CENTRAL LIMIT THEOREM TORONTO THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................

More information

The Ideal Class Group

The Ideal Class Group Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

More information

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

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

Important Probability Distributions OPRE 6301

Important Probability Distributions OPRE 6301 Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.

More information

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

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?

More information

Spread-Based Credit Risk Models

Spread-Based Credit Risk Models Spread-Based Credit Risk Models Paul Embrechts London School of Economics Department of Accounting and Finance AC 402 FINANCIAL RISK ANALYSIS Lent Term, 2003 c Paul Embrechts and Philipp Schönbucher, 2003

More information

. (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.

. (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. Chapter 3 Kolmogorov-Smirnov Tests There are many situations where experimenters need to know what is the distribution of the population of their interest. For example, if they want to use a parametric

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

LOGNORMAL MODEL FOR STOCK PRICES

LOGNORMAL MODEL FOR STOCK PRICES LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as

More information

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

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied

More information

CHAPTER IV - BROWNIAN MOTION

CHAPTER IV - BROWNIAN MOTION CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time

More information

4: SINGLE-PERIOD MARKET MODELS

4: SINGLE-PERIOD MARKET MODELS 4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market

More information

Poisson processes (and mixture distributions)

Poisson processes (and mixture distributions) Poisson processes (and mixture distributions) James W. Daniel Austin Actuarial Seminars www.actuarialseminars.com June 26, 2008 c Copyright 2007 by James W. Daniel; reproduction in whole or in part without

More information

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

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

More information

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

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]. Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real

More information

About the inverse football pool problem for 9 games 1

About the inverse football pool problem for 9 games 1 Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

More information

Random variables, probability distributions, binomial random variable

Random variables, probability distributions, binomial random variable Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that

More information

University of Miskolc

University of Miskolc University of Miskolc The Faculty of Mechanical Engineering and Information Science The role of the maximum operator in the theory of measurability and some applications PhD Thesis by Nutefe Kwami Agbeko

More information

Math 151. Rumbos Spring 2014 1. Solutions to Assignment #22

Math 151. Rumbos Spring 2014 1. Solutions to Assignment #22 Math 151. Rumbos Spring 2014 1 Solutions to Assignment #22 1. An experiment consists of rolling a die 81 times and computing the average of the numbers on the top face of the die. Estimate the probability

More information

Binomial lattice model for stock prices

Binomial lattice model for stock prices Copyright c 2007 by Karl Sigman Binomial lattice model for stock prices Here we model the price of a stock in discrete time by a Markov chain of the recursive form S n+ S n Y n+, n 0, where the {Y i }

More information

DISINTEGRATION OF MEASURES

DISINTEGRATION OF MEASURES DISINTEGRTION OF MESURES BEN HES Definition 1. Let (, M, λ), (, N, µ) be sigma-finite measure spaces and let T : be a measurable map. (T, µ)-disintegration is a collection {λ y } y of measures on M such

More information

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

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 Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

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

What is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference 0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures

More information

On Some Aspects of Investment into High-Yield Bonds

On Some Aspects of Investment into High-Yield Bonds On Some Aspects of Investment into High-Yield Bonds Helen Kovilyanskaya Vom Fachbereich Mathematik der Universität Kaiserslautern zur Verleihung des akademischen Grades Doktor der Naturwissenschaften Doctor

More information

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

More information

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

Strong control, conservative point estimation and simultaneous conservative consistency of false discovery rates: a unified approach J. R. Statist. Soc. B (2004) 66, Part 1, pp. 187 205 Strong control, conservative point estimation and simultaneous conservative consistency of false discovery rates: a unified approach John D. Storey,

More information

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

CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is. Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,

More information

Hydrodynamic Limits of Randomized Load Balancing Networks

Hydrodynamic Limits of Randomized Load Balancing Networks Hydrodynamic Limits of Randomized Load Balancing Networks Kavita Ramanan and Mohammadreza Aghajani Brown University Stochastic Networks and Stochastic Geometry a conference in honour of François Baccelli

More information

Marshall-Olkin distributions and portfolio credit risk

Marshall-Olkin distributions and portfolio credit risk Marshall-Olkin distributions and portfolio credit risk Moderne Finanzmathematik und ihre Anwendungen für Banken und Versicherungen, Fraunhofer ITWM, Kaiserslautern, in Kooperation mit der TU München und

More information

Modelling Patient Flow in an Emergency Department

Modelling Patient Flow in an Emergency Department Modelling Patient Flow in an Emergency Department Mark Fackrell Department of Mathematics and Statistics The University of Melbourne Motivation Eastern Health closes more beds Bed closures to cause ambulance

More information

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

Diusion processes. Olivier Scaillet. University of Geneva and Swiss Finance Institute Diusion processes Olivier Scaillet University of Geneva and Swiss Finance Institute Outline 1 Brownian motion 2 Itô integral 3 Diusion processes 4 Black-Scholes 5 Equity linked life insurance 6 Merton

More information

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

More information

Hedging bounded claims with bounded outcomes

Hedging bounded claims with bounded outcomes Hedging bounded claims with bounded outcomes Freddy Delbaen ETH Zürich, Department of Mathematics, CH-892 Zurich, Switzerland Abstract. We consider a financial market with two or more separate components

More information

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

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since

More information

On Compulsory Per-Claim Deductibles in Automobile Insurance

On Compulsory Per-Claim Deductibles in Automobile Insurance The Geneva Papers on Risk and Insurance Theory, 28: 25 32, 2003 c 2003 The Geneva Association On Compulsory Per-Claim Deductibles in Automobile Insurance CHU-SHIU LI Department of Economics, Feng Chia

More information

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

Probability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random

More information

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

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

More information

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

Lecture 19: Chapter 8, Section 1 Sampling Distributions: Proportions Lecture 19: Chapter 8, Section 1 Sampling Distributions: Proportions Typical Inference Problem Definition of Sampling Distribution 3 Approaches to Understanding Sampling Dist. Applying 68-95-99.7 Rule

More information

A spot price model feasible for electricity forward pricing Part II

A spot price model feasible for electricity forward pricing Part II A spot price model feasible for electricity forward pricing Part II Fred Espen Benth Centre of Mathematics for Applications (CMA) University of Oslo, Norway Wolfgang Pauli Institute, Wien January 17-18

More information

Lecture Notes on Measure Theory and Functional Analysis

Lecture Notes on Measure Theory and Functional Analysis Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata [email protected] [email protected] aa 2006/07 Contents

More information

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

LECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 1 LECTURE NOTES IN MEASURE THEORY Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 2 PREFACE These are lecture notes on integration theory for a eight-week

More information

Master thesis. Non-life insurance risk models under inflation

Master thesis. Non-life insurance risk models under inflation Master thesis by Nicolai Schipper Jespersen, Copenhagen Business School Non-life insurance risk models under inflation Abstract In the first part of the paper we present some classical actuarial models

More information

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

A power series about x = a is the series of the form POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to

More information

MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

More information

Insurance models and risk-function premium principle

Insurance models and risk-function premium principle Insurance models and risk-function premium principle Aditya Challa Supervisor : Prof. Vassili Kolokoltsov July 2, 212 Abstract Insurance sector was developed based on the idea to protect people from random

More information

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations 56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

Polarization codes and the rate of polarization

Polarization codes and the rate of polarization Polarization codes and the rate of polarization Erdal Arıkan, Emre Telatar Bilkent U., EPFL Sept 10, 2008 Channel Polarization Given a binary input DMC W, i.i.d. uniformly distributed inputs (X 1,...,

More information

Harnack Inequality for Some Classes of Markov Processes

Harnack Inequality for Some Classes of Markov Processes Harnack Inequality for Some Classes of Markov Processes Renming Song Department of Mathematics University of Illinois Urbana, IL 6181 Email: [email protected] and Zoran Vondraček Department of Mathematics

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

A Martingale System Theorem for Stock Investments

A Martingale System Theorem for Stock Investments A Martingale System Theorem for Stock Investments Robert J. Vanderbei April 26, 1999 DIMACS New Market Models Workshop 1 Beginning Middle End Controversial Remarks Outline DIMACS New Market Models Workshop

More information

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

e.g. arrival of a customer to a service station or breakdown of a component in some system. Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

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

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

More information

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

Sensitivity analysis of European options in jump-diffusion models via the Malliavin calculus on the Wiener space Sensitivity analysis of European options in jump-diffusion models via the Malliavin calculus on the Wiener space Virginie Debelley and Nicolas Privault Département de Mathématiques Université de La Rochelle

More information

Lebesgue Measure on R n

Lebesgue Measure on R n 8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

How To Find F Divergences In Probability Theory

How To Find F Divergences In Probability Theory f-divergences: SUFFICIENCY, DEFICIENCY AND TESTING OF HYPOTHESES Friedrich Liese and Igor Vajda Abstract. This paper deals with f -divergences of probability measures considered in the same general form

More information

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

ALOHA Performs Delay-Optimum Power Control

ALOHA Performs Delay-Optimum Power Control ALOHA Performs Delay-Optimum Power Control Xinchen Zhang and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA {xzhang7,mhaenggi}@nd.edu Abstract As

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

LECTURE 15: AMERICAN OPTIONS

LECTURE 15: AMERICAN OPTIONS LECTURE 15: AMERICAN OPTIONS 1. Introduction All of the options that we have considered thus far have been of the European variety: exercise is permitted only at the termination of the contract. These

More information

Probability and statistics; Rehearsal for pattern recognition

Probability and statistics; Rehearsal for pattern recognition Probability and statistics; Rehearsal for pattern recognition Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception

More information

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

M/M/1 and M/M/m Queueing Systems M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential

More information

Probability for Estimation (review)

Probability for Estimation (review) Probability for Estimation (review) In general, we want to develop an estimator for systems of the form: x = f x, u + η(t); y = h x + ω(t); ggggg y, ffff x We will primarily focus on discrete time linear

More information

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: [email protected]

More information

Gambling and Data Compression

Gambling and Data Compression Gambling and Data Compression Gambling. Horse Race Definition The wealth relative S(X) = b(x)o(x) is the factor by which the gambler s wealth grows if horse X wins the race, where b(x) is the fraction

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

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 )

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 ) Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll

More information