Renewal Theory Definitions, Limit Theorems, Renewal Reward Processes, Alternating Renewal Processes, Age and Excess Life Distributions, Inspection Paradox.

Slides:



Advertisements
Similar presentations
Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Advertisements

Exponential and Poisson Chapter 5 Material. 2 Poisson Distribution [Discrete] Poisson distribution describes many random processes quite well and is mathematically.
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Exponential Distribution. = mean interval between consequent events = rate = mean number of counts in the unit interval > 0 X = distance between events.
Statistics review of basic probability and statistics.
Continuous Random Variables. L. Wang, Department of Statistics University of South Carolina; Slide 2 Continuous Random Variable A continuous random variable.
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Introduction to stochastic process
SUMS OF RANDOM VARIABLES Changfei Chen. Sums of Random Variables Let be a sequence of random variables, and let be their sum:
Introduction to the Continuous Distributions
Probability theory 2010 Outline  The need for transforms  Probability-generating function  Moment-generating function  Characteristic function  Applications.
Lec 6, Ch.5, pp90-105: Statistics (Objectives) Understand basic principles of statistics through reading these pages, especially… Know well about the normal.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Some standard univariate probability distributions
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
The moment generating function of random variable X is given by Moment generating function.
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
Introduction to Stochastic Models GSLM 54100
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,
Standard error of estimate & Confidence interval.
Chapter 4. Continuous Probability Distributions
Exponential Distribution & Poisson Process
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
Simulation Output Analysis
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
Exponential and Chi-Square Random Variables
Andy Guo 1 Handout Ch5(2) 實習. Andy Guo 2 Normal Distribution There are three reasons why normal distribution is important –Mathematical properties of.
Generalized Semi-Markov Processes (GSMP)
Intro. to Stochastic Processes
Stochastic Models Lecture 2 Poisson Processes
ENGR 610 Applied Statistics Fall Week 3 Marshall University CITE Jack Smith.
Modeling and Analysis of Computer Networks
1 Birth and death process N(t) Depends on how fast arrivals or departures occur Objective N(t) = # of customers at time t. λ arrivals (births) departures.
1 The Base Stock Model. 2 Assumptions  Demand occurs continuously over time  Times between consecutive orders are stochastic but independent and identically.
Sample Variability Consider the small population of integers {0, 2, 4, 6, 8} It is clear that the mean, μ = 4. Suppose we did not know the population mean.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
The final exam solutions. Part I, #1, Central limit theorem Let X1,X2, …, Xn be a sequence of i.i.d. random variables each having mean μ and variance.
Confidence Interval & Unbiased Estimator Review and Foreword.
Chapter 4-5 DeGroot & Schervish. Conditional Expectation/Mean Let X and Y be random variables such that the mean of Y exists and is finite. The conditional.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
1 Probability and Statistical Inference (9th Edition) Chapter 5 (Part 2/2) Distributions of Functions of Random Variables November 25, 2015.
Statistics Sampling Distributions and Point Estimation of Parameters Contents, figures, and exercises come from the textbook: Applied Statistics and Probability.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
Queueing Theory II.
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,
Probability Distributions: a review
The Exponential and Gamma Distributions
Exponential Distribution & Poisson Process
The Poisson Process.
Basic Modeling Components
Continuous Random Variables
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
Chapter 8: Fundamental Sampling Distributions and Data Descriptions:
Sample Mean Distributions
Chapter 7: Sampling Distributions
3.1 Expectation Expectation Example
Lecture on Markov Chain
CPSC 531: System Modeling and Simulation
C14: The central limit theorem
Queueing Theory II.
Counting Statistics and Error Prediction
Chapter 8: Fundamental Sampling Distributions and Data Descriptions:
Poisson Process and Related Distributions
Multinomial Experiments
CS723 - Probability and Stochastic Processes
Fundamental Sampling Distributions and Data Descriptions
Presentation transcript:

Renewal Theory Definitions, Limit Theorems, Renewal Reward Processes, Alternating Renewal Processes, Age and Excess Life Distributions, Inspection Paradox Chapter 7

Continuous Time Markov Chain: Exponential times between transitions Relax counting process Poisson Process: Counting process iid exponential times between arrivals Relax exponential interarrival times Renewal Process: Counting process iid times between arrivals Chapter 7

Counting Process A stochastic process {N(t), t  0} is a counting process if N(t) represents the total number of events that have occurred in [0, t] Then {N(t), t  0} must satisfy: N(t)  0 N(t) is an integer for all t If s < t, then N(s)  N(t) For s < t, N(t) - N(s) is the number of events that occur in the interval (s, t]. Chapter 7

Renewal Process A counting process {N(t), t  0} is a renewal process if for each n, Xn is the time between the (n-1)st and nth arrivals and {Xn, n  1} are independent with the same distribution F. The time of the nth arrival is with S0 = 0. Can write and if m = E[Xn], n  1, then the strong law of large numbers says that Note: m is now a time interval, not a rate; 1/ m will be called the rate of the r. p. Chapter 7

Fundamental Relationship It follows that where Fn(t) is the n-fold convolution of F with itself. The mean value of N(t) is Condition on the time of the first renewal to get the renewal equation: Chapter 7

Exercise 1 Is it true that: Chapter 7

Exercise 3 If the mean-value function of the renewal process {N(t), t  0} is given by Then what is P{N(5) = 0} ? Chapter 7

Exercise 6 Consider a renewal process {N(t), t  0} having a gamma (r,l) interarrival distribution with density Show that Hint: use the relationship between the gamma (r,l) distribution and the sum of r independent exponentials with rate l to define N(t) in terms of a Poisson process with rate l. Chapter 7

Limit Theorems With probability 1, Elementary renewal theorem: Central limit theorem: For large t, N(t) is approximately normally distributed with mean t/m and variance where s2 is the variance of the time between arrivals; in particular, Chapter 7

Exercise 8 A machine in use is replaced by a new machine either when it fails or when it reaches the age of T years. If the lifetimes of successive machines are independent with a common distribution F with density f, show that the long-run rate at which machines are replaced is the long-run rate at which machines in use fail equals Hint: condition on the lifetime of the first machine Chapter 7

Renewal Reward Processes Suppose that each time a renewal occurs we receive a reward. Assume Rn is the reward earned at the nth renewal and {Rn, n  1} are independent and identically distributed (Rn may depend on Xn). The total reward up to time t is If then and Chapter 7

Age & Excess Life of a Renewal Process The age at time t is A(t) = the amount of time elapsed since the last renewal. The excess life Y(t) is the time until the next renewal: SN(t) t A(t) Y(t) What is the average value of the age Chapter 7

Average Age of a Renewal Process Imagine we receive payment at a rate equal to the current age of the renewal process. Our total reward up to time s is and the average reward up to time s is If X is the length of a renewal cycle, then the total reward during the cycle is So, the average age is Chapter 7

Average Excess or Residual Now imagine we receive payment at a rate equal to the current excess of the renewal process. Our total reward up to time s is and the average reward up to time s is If X is the length of a renewal cycle, then the total reward during the cycle is So, the average excess is (also) Chapter 7

Inspection Paradox Suppose that the distribution of the time between renewals, F, is unknown. One way to estimate it is to choose some sampling times t1, t2, etc., and for each ti, record the total amount of time between the renewals just before and just after ti. This scheme will overestimate the inter-renewal times – Why? For each sampling time, t, we will record Find its distribution by conditioning on the time of the last renewal prior to time t Chapter 7

Inspection Paradox (cont.) SN(t) SN(t)+1 t-s t Chapter 7

Inspection Paradox (cont.) SN(t) SN(t)+1 t-s t For any s, so where X is an ordinary inter-renewal time. Intuitively, by choosing “random” times, it is more likely we will choose a time that falls in a long time interval. Chapter 7