The Poisson Process Properties of the Poisson Process

Similar documents
14. Poisson Processes

8. Queueing systems lect08.ppt S Introduction to Teletraffic Theory - Fall

Continuous Time Markov Chains

(1) Cov(, ) E[( E( ))( E( ))]

Fault Tolerant Computing. Fault Tolerant Computing CS 530 Probabilistic methods: overview

Least Squares Fitting (LSQF) with a complicated function Theexampleswehavelookedatsofarhavebeenlinearintheparameters

Generalized Semi- Markov Processes (GSMP)

The Mean Residual Lifetime of (n k + 1)-out-of-n Systems in Discrete Setting

θ = θ Π Π Parametric counting process models θ θ θ Log-likelihood: Consider counting processes: Score functions:

Solution. The straightforward approach is surprisingly difficult because one has to be careful about the limits.

FALL HOMEWORK NO. 6 - SOLUTION Problem 1.: Use the Storage-Indication Method to route the Input hydrograph tabulated below.

The Linear Regression Of Weighted Segments

Moment Generating Function

Moments of Order Statistics from Nonidentically Distributed Three Parameters Beta typei and Erlang Truncated Exponential Variables

Cyclone. Anti-cyclone

Chapter 8. Simple Linear Regression

The Signal, Variable System, and Transformation: A Personal Perspective

Lecture 3 Topic 2: Distributions, hypothesis testing, and sample size determination

Real-Time Systems. Example: scheduling using EDF. Feasibility analysis for EDF. Example: scheduling using EDF

Quantum Mechanics II Lecture 11 Time-dependent perturbation theory. Time-dependent perturbation theory (degenerate or non-degenerate starting state)

For the plane motion of a rigid body, an additional equation is needed to specify the state of rotation of the body.

th m m m m central moment : E[( X X) ] ( X X) ( x X) f ( x)

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

FORCED VIBRATION of MDOF SYSTEMS

Solution of Impulsive Differential Equations with Boundary Conditions in Terms of Integral Equations

MA 524 Homework 6 Solutions

Key words: Fractional difference equation, oscillatory solutions,

Partial Molar Properties of solutions

AML710 CAD LECTURE 12 CUBIC SPLINE CURVES. Cubic Splines Matrix formulation Normalised cubic splines Alternate end conditions Parabolic blending

International Journal Of Engineering And Computer Science ISSN: Volume 5 Issue 12 Dec. 2016, Page No.

4. THE DENSITY MATRIX

International Journal of Scientific & Engineering Research, Volume 3, Issue 10, October ISSN

Asymptotic Behavior of Solutions of Nonlinear Delay Differential Equations With Impulse

1 Solution to Problem 6.40

Chapter 5 Properties of a Random Sample

Midterm Exam. Tuesday, September hour, 15 minutes

Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles

Least squares and motion. Nuno Vasconcelos ECE Department, UCSD

Determination of Antoine Equation Parameters. December 4, 2012 PreFEED Corporation Yoshio Kumagae. Introduction

Probability Bracket Notation and Probability Modeling. Xing M. Wang Sherman Visual Lab, Sunnyvale, CA 94087, USA. Abstract

QR factorization. Let P 1, P 2, P n-1, be matrices such that Pn 1Pn 2... PPA

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE

Linear Regression Linear Regression with Shrinkage

Chapter 4 Multiple Random Variables

Redundancy System Fault Sampling Under Imperfect Maintenance

Solution set Stat 471/Spring 06. Homework 2

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

Queuing Theory: Memory Buffer Limits on Superscalar Processing

Econometric Methods. Review of Estimation

Law of Large Numbers

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

JORIND 9(2) December, ISSN

Regression Approach to Parameter Estimation of an Exponential Software Reliability Model

Lecture 4 Sep 9, 2015

Mathematical Formulation

Some Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables

Supplement Material for Inverse Probability Weighted Estimation of Local Average Treatment Effects: A Higher Order MSE Expansion

Fundamentals of Speech Recognition Suggested Project The Hidden Markov Model

VARIATIONAL ITERATION METHOD FOR DELAY DIFFERENTIAL-ALGEBRAIC EQUATIONS. Hunan , China,

-distributed random variables consisting of n samples each. Determine the asymptotic confidence intervals for

Chapter 14 Logistic Regression Models

The algebraic immunity of a class of correlation immune H Boolean functions

Lecture 9: Tolerant Testing

Stochastic Petri Nets with Low Variation Matrix Exponentially Distributed Firing Time

Third handout: On the Gini Index

Mixed Integral Equation of Contact Problem in Position and Time

Module 7. Lecture 7: Statistical parameter estimation

March 14, Title: Change of Measures for Frequency and Severity. Farrokh Guiahi, Ph.D., FCAS, ASA

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

CHAPTER VI Statistical Analysis of Experimental Data

D KL (P Q) := p i ln p i q i

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

The Occupancy and Coupon Collector problems

Interval Estimation. Consider a random variable X with a mean of X. Let X be distributed as X X

Simulation Output Analysis

As evident from the full-sample-model, we continue to assume that individual errors are identically and

CHAPTER 4 RADICAL EXPRESSIONS

M. Sc. MATHEMATICS MAL-521 (ADVANCE ABSTRACT ALGEBRA)

X ε ) = 0, or equivalently, lim

Anouncements. Conjugate Gradients. Steepest Descent. Outline. Steepest Descent. Steepest Descent

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

RATIO ESTIMATORS USING CHARACTERISTICS OF POISSON DISTRIBUTION WITH APPLICATION TO EARTHQUAKE DATA

Parameter, Statistic and Random Samples

Class 13,14 June 17, 19, 2015

Application of the stochastic self-training procedure for the modelling of extreme floods

Probability Bracket Notation, Probability Vectors, Markov Chains and Stochastic Processes. Xing M. Wang Sherman Visual Lab, Sunnyvale, CA, USA

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

ρ < 1 be five real numbers. The

Solving fuzzy linear programming problems with piecewise linear membership functions by the determination of a crisp maximizing decision

Fresnel Equations cont.

Efficient Estimators for Population Variance using Auxiliary Information

2. Independence and Bernoulli Trials

The ray paths and travel times for multiple layers can be computed using ray-tracing, as demonstrated in Lab 3.

Mu Sequences/Series Solutions National Convention 2014

Lecture 3 Probability review (cont d)

Density estimation III.

Random Variables and Probability Distributions

Multiple Choice Test. Chapter Adequacy of Models for Regression

Pricing Asian Options with Fourier Convolution

Transcription:

Posso Processes

Summary The Posso Process Properes of he Posso Process Ierarrval mes Memoryless propery ad he resdual lfeme paradox Superposo of Posso processes Radom seleco of Posso Pos Bulk Arrvals ad Compoud Posso Processes 2

The Posso Coug Process Le he process {N()} whch cous he umber of eves ha have occurred he erval [0,). For ay 0 N 0 N N... N... k 0 2 k 6 4 2 0 2 3 k- k, N N N k k k k Process wh depede cremes: The radom varables N( ), N(, 2 ),, N( k-, k ), are muually depede. Process wh saoary depede cremes: The radom varable N( k-, k ), does o deped o k-, k bu oly o k - k- 3

The Posso Coug Process Assumpos: A mos oe eve ca occur a ay me sa (o wo or more eves ca occur a he same me) A process wh saoary depede cremes Pr N, Pr N k k k k Gve ha a process sasfes he above assumpos, fd P Pr N, 0,,2,... 4

The Posso Process Sep : Deerme Sarg from P 0 Pr N 0 PrN s0 Pr N 0 ad N, s 0 Pr N 0 Pr Ns0 Saoary depede cremes P s P P s 0 0 0 Lemma: Le g() be a dffereable fuco for all 0 such ha g(0)= ad g() for all >0. The for ay, s 0 g ( s) g gs g e for some λ>0 5

The Posso Process Therefore P 0 Pr N 0 e Sep 2: Deerme P 0 (Δ) for a small Δ. 2 3 Pr 0 N e... 2! 3! o. Sep 3: Deerme P (Δ) for a small Δ. For =2,3, sce by assumpo o wo eves ca occur a he same me As a resul, for = P PrN o P Pr N o 6

The Posso Process Sep 4: Deerme P ( (+Δ) for ay P PrN P k Pk k 0 0. o o P P P P o Movg erms bewee ee sdes, P P o P P Takg he lm as Δ 0 P P o.. dp d P P 7

The Posso Process Sep 4: Deerme P ( (+Δ) for ay P PrN P k Pk k 0 0. o o P P P P o Movg erms bewee ee sdes, P P o P P Takg he lm as Δ 0 P P o.. dp d P P 8

The Posso Process Sep 5: Solve he dffereal equao o oba P Pr N e, 0, 0,, 2,...!! Ths expresso s kow as he Posso dsrbuo ad full characerzes he sochasc process {N()} [0,) [,) uder he assumpos ha No wo eves ca occur a exacly he same me, ad Idepede saoary cremes You should verfy ha E N N ad N var () Parameer λ has he erpreao of he rae ha eves 9 arrve.

Properes of he Posso Process: Iereve Tmes Le k be he me whe he k- eve has occurred ad le k- V k deoe he (radom varable) ereve me bewee he kh ad k- eves. Wha s he cdf of V k, G k ()? Pr Pr PrN 0 G V V k k k Pr 0 arrvals he erval [, ) e G e k k Saoary depede cremes V k k- + N( k-, k- +)=0 Expoeal Dsrbuo 0 k-

Properes of he Posso Process: Expoeal Iereve Tmes The process {V k } k=,2,,,, ha correspods o he ereve mes of a Posso process s a d sochasc sequece wh cdf G Pr V e k Therefore, he Posso s also a reewal process The correspodg pdf s p g e, 0 Oe ca easly show ha EV k ad k 2 var V

Properes of he Posso Process: Memoryless Propery Le k be he me whe prevous eve has occurred ad le V deoe he me ul he ex eve. Assumg ha we have bee a he curre sae for z me us, le Y be he remag me ul he ex eve. V Wha s he cdf of Y? k k +z Y=V-z Y Pr Pr Pr V z ad V z Pr Pr V z Pr V z F Y V z V z G z Gz G z F e G Y z e z e e z V z z Memoryless! I does o maer ha we have already spe z me us a he 2 curre sae.

Memoryless Propery Ths s a uque propery p of he expoeal dsrbuo. If a process has he memoryless propery, he mus be expoeal,.e., Pr V z V z Pr V Pr V e Posso Process λ Expoeal Iereve Tmes G()=-e -λ Memoryless Propery 3

Superposo of Posso Processes Cosder a DES wh m eves each modeled as a Posso Process wh rae λ, =,,m. Wha s he resulg process? Suppose a me k we observe eve. Le Y be he me ul he ex eve. Is cdf s G ()=-exp{-λ }. Le Y,,Y m deoe he resdual me ul he ex occurrece of he correspodg eve. Ther cdfs are: e G e V = Y Memoryless Propery k Y j =V j -z j Le Y * be he me ul he ex eve (ay ype). Y Therefore, we eed o fd * m Y e j * Pr G * Y 4 Y e V j

Superposo of Posso Processes Idepedece Pr m Y Y * Pr G Pr Y Y * GY Pr m Pr Y,..., Ym m Pr Y e * e m e m where = The superposo of m Posso processes s also a Posso process wh rae equal o he sum of he raes of he dvdual processes 5

Superposo of Posso Processes Suppose ha a me k a eve has occurred. Wha s he probably ha he ex eve o occur s eve j? Whou loss of geeraly, le j= ad defe m Y =m{y: Y=m{Y : =2,,m}. Pr ex eve s j Pr Y Y y 0 0 ~-exp exp 2 y y e e dy dy 0 y y e e dy where = 6 m

Resdual Lfeme Paradox Suppose ha buses pass by he bus sao accordg o a Posso process wh rae λ. A passeger arrves a he bus sao a some radom po. V b k p b k+ How log does he passeger has Z Y o wa? Soluo : E[V]= /λ. Therefore, sce he passeger wll (o average) arrve he mddle of he erval, he has o wa for E[Y]=E[V]/2= /(2λ). Bu usg he memoryless propery, he me ul he ex bus s expoeally dsrbued wh rae λ, herefore E[Y]=/λ o /(2λ)! Soluo 2: Usg he memoryless propery, he me ul he ex bus s expoeally dsrbued wh rae λ, herefore E[Y]=/λ. Bu oe ha E[Z]= /λ herefore E[V]= E[Z]+E[Y]= 2/λ o /λ! 7

Radom seleco of Posso Pos Le, 2,,, represe radom arrval pos of a Posso process X() wh parameer λ. Assocaed wh each po, we defe a depede Beroull R.V. N where P{ N } p, P{ N 0} p q. Defe Y ( ) X ( ) N ; Z( ) X ( ) ( N 2 ) X ( ) Y ( ) We clam ha boh Y() ad Z() are depede Posso processes wh parameers λp ad λq respecvely. 8

Radom seleco of Posso Pos Proof: P ( Y () k ) P { Y () k X () } P { X () )}. ( ) P { X ( ) } e.! k k k P{ Y( ) k X( ) } p q, 0 k, k pe PY { ( ) k} e pq ( ) k k! k k ( ) k ( q) ( k)! k!! ( k)! k k! k ( q) k k e p ( p) ( p) e, k 0,, 2, k! k! ~ P( p). e q 9

Radom seleco of Posso Pos Smlarly: P{ Z ( ) m} ~ P( q). More geerally, P { Y ( ) k, Z ( ) m } P { Y ( ) k, X ( ) Y ( ) m } PY { ( ) k, X( ) km} P{ Y( ) k X( ) km} P{ X( ) k m} km ( ) ( ) ( ) k m k m p p q q pq e e e k ( k m)! k! m! P{ Y( ) k} P{ Z( ) m}, PY ( ( ) k) PZ ( ( ) m) 20

Bulk Arrvals ad Compoud Posso Processes Cosder a radom umber of eves C occur smulaeously a ay eve sa me of a Posso process. 2 C 3 C 2 2 C 4 2 (a) Posso Process (b) Compoud Posso Process Le p P{ C k}, k 0,, 2,, he k s a compoud Posso process, where N() s a ordary Posso process. N() X() C, PX { ( ) m } PX { ( ) m N ( ) PN } { ( ) } 0 2

Bulk Arrvals ad Compoud Posso Processes ( z ) E { z C } P { C k } z C X k 0 ( ) { X() } { ( ) } m0 z E z P X m z m 0 0 PX { () m N () PN } { () z } m ( P{ C m} z ) P{ N( ) } 0 m0 k C m m C ( Ez { }) PN { ( ) } ( Ez { } ) PN { ( ) } 0 0 ( ( )) C C z PN { ( ) } e 0 ( ( z)) m 22

Bulk Arrvals ad Compoud Posso Processes 2 k We ca wre ( ( ( z ) 2 z ) k z ) ( z) e e e X We ca wre where k pk, whch shows ha he compoud Posso process ca be expressed as he sum of eger-scaled depede Posso processes m ), m ( ),. Thus X ( ) k k m k ( ). ( 2 More geerally, every lear combao of depede Posso processes represes a compoud Posso process. 23