A renewal process counts successive events whose interarrival times are independent and identically distributed. Allow nonnegative finite interarrival times, but require . Its renewal epochs and count are
The nondegeneracy condition makes almost surely, so the count is finite at every finite time. Zero interarrival times can give simultaneous renewals; strictly positive ones give distinct epochs. At each renewal the future interarrival sequence starts afresh, which models repeated replacement or completion events.
Exponential interarrival times give a Poisson process. Constant interarrival times give . A general renewal count is not a Markov process by itself: predicting the next arrival usually requires knowing the time since the last renewal, because a general interarrival law is not memoryless.
If , then almost surely. The strong law gives ; sandwiching between and proves the counting-rate limit. No exponential or continuous interarrival distribution is required for this long-run rate.
Alternately routing a rate- Poisson process produces non-Poisson streams with common interarrival law Erlang. The odd-numbered stream has an initial exponential delay, while the even-numbered stream is an ordinary renewal process. Their equilibrium delay survivor is . The probability of no odd-stream point in is ; for the even stream replace the minus by a plus. Conditioning on the parity of proves these formulas.
For independent uniform distribution increments on and , let be the first index at which their partial sum exceeds . First-step analysis gives , hence . Equivalently, is a simplex-volume probability and the tail-sum formula sums to . The strict inequality gives almost surely.
For a positive interarrival law , the renewal measure counts the expected number of renewal epochs in a set, including the epoch at zero through . Its cumulative function is one plus the usual renewal function. convolution against solves a renewal equation.
For positive nonarithmetic interarrival times with law and mean , let be their renewal measure. If is directly Riemann integrable, then , with . Thus a locally bounded solution of has this limit through its renewal representation. Arithmetic laws require the corresponding lattice version.
A renewal equation decomposes a process at its first renewal. For returns of a Markov chain to a fixed state, is the first-return probability and the probability of being at that state at time . Their probability generating functions satisfy .
For positive interarrivals with law and locally bounded forcing , the unique locally bounded solution of is , where is the renewal measure. Iteration proves the identity: the residual is bounded on each compact interval by a constant times the probability that the sum of many positive interarrivals stays in that interval, which tends to zero.
A Defective renewal equation is where the nonnegative kernel measure has total mass less than one. Its renewal representation is a convergent sum of convolutions. Exponential tilting can turn the kernel into a probability measure, enabling the key renewal theorem.
The ultimate ruin probability satisfies a tail-forced defective renewal equation. Multiplying it by at an adjustment coefficient turns its kernel into the probability density . normalization is exactly . The density is absolutely continuous even when the original claim law has atoms; thus it has a nonarithmetic distribution.
For nonnegative finite independent and identically distributed random variables as inter-arrivals with positive probability of exceeding , write . The count tail is bounded by , which has geometric decay times a polynomial in . Hence for every fixed finite and sufficiently small .
The renewal function is the expected number of renewals by time :
For strictly positive independent and identically distributed interarrival times with finite mean , the elementary renewal theorem states
This is a limit of expected counts. The renewal counting law of large numbers gives the almost-sure version, but almost-sure convergence alone does not justify moving the limit through an expectation.
An elementary proof uses Wald's equation. The first index for which the renewal sum exceeds is a stopping time; itself generally is not. The exponential moment of a renewal count ensures that its expectation is finite. Since , Wald's equation gives , proving the lower asymptotic bound.
For the upper bound, truncate each interarrival to , with mean . The truncated process has at least as many renewals, , and its first sum exceeding is at most . Hence
For fixed , this gives . Finally by monotone convergence. The two bounds prove the theorem without an unjustified interchange of expectation and limit.
A renewal-reward process attaches an integrable reward to each i.i.d. renewal cycle of length . Its cumulative reward sums completed-cycle rewards and may include reward accrued in the current unfinished cycle.
For independent identically distributed regenerative cycles with and , the long-run reward rate is
almost surely, provided the unfinished-cycle reward is negligible after division by .
If a repaired machine has independent exponential lifetimes of rate and is inspected and repaired every time units after each repair, then its cycle length is and its working reward is . Its long-run working proportion is
If , then the strong law and the inequalities imply almost surely.
The renewal interval containing a fixed time has length
The interval is selected by a time rather than by its index. In a stationary renewal process with positive interarrival law and finite mean , its distribution is size-biased:
The renewal-reward theorem explains this: give a cycle reward equal to its length when that length lies in , and zero otherwise. The long-run fraction of time spent in such cycles is exactly the displayed ratio. A longer cycle occupies more observation time and therefore has a higher chance of containing a typical observation.
If interarrivals are one or three time units with equal probabilities, an indexed cycle has probability of being long, but an equilibrium time falls in a long cycle with probability . The expected observed interval length is , compared with indexed mean two. This is an inspection effect, not a change to the underlying interarrival law. For a renewal process freshly started at zero, the exact finite-time distribution need not already equal the equilibrium size-biased law.
For a nonnegative random variable with , its size-biased version is defined by
for bounded measurable . If has density , then has density .
Reweight probabilities proportionally to the nonnegative value being observed, then divide by its positive finite expected value. This produces a size-biased distribution. Values twice as large receive twice the original relative weight; this is a change in the sampling law rather than a deterministic multiplication of the sampled value.
For the positive-support geometric distribution with success probability , size bias gives . The sum of two independent copies has positive-integer decompositions at value , so its shifted probability is exactly this expression. Its probability generating function is , also obtained by the size-biased probability generating function identity.
For a positive integer-valued random variable with finite mean , the size-biased distribution has probabilities . They sum to one by the definition of expected value. Multiplying the differentiated probability generating function by gives the displayed identity for , with the endpoint interpreted by its limit.
For exponential interarrival times of rate , the age and residual life at time converge jointly to independent rate- exponential variables. Their sum therefore converges to the Gamma distribution with density , the size-biased exponential law.
At every deterministic , the containing interval stochastically dominates an unselected interarrival time:
Conditioning on the first interarrival gives a renewal equation; subtracting the constant Tail probability leaves a renewal equation with a nonnegative forcing term.
The residual lifetime process of a renewal process is the time remaining until the next renewal:
The time since the last renewal is , and is the length of the renewal interval containing a fixed time. Between renewal epochs, decreases at speed one. On reaching zero it resets to a freshly drawn interarrival time. For strictly positive iid interarrivals, this deterministic motion and independent resetting make a Markov process, even when the count alone is not Markov.
Its initial and equilibrium laws can differ. An ordinary process started at a renewal has . A stationary observation instead has the equilibrium residual-life distribution, whose survival function is the integrated interarrival tail divided by its mean. For deterministic interarrivals of length , the initial residual is , but the equilibrium residual is uniform on . For exponential interarrivals the two laws agree, reflecting the memoryless property.
For non-arithmetic inter-renewal times with finite positive mean , the excess converges in distribution to with
Suppose an independent superposition of a positive-rate Poisson process and a renewal process with strictly positive nonarithmetic finite-mean interarrivals is itself a renewal process. Its first interarrival must be exponential; in fact the other process's interarrival law must also be exponential.
Let be the Poisson rate, the other interarrival survival function and its finite mean. The first superposed interarrival has survival and mean . Adding the two long-run counting rates gives . Computing the limiting excess in two ways, using the renewal excess limit theorem for the superposition and independence of the two excesses, gives
Set . Differentiating the displayed identity almost everywhere yields . Thus with , forcing . It follows that . The renewal assumption on the superposition is essential; independent superpositions of general renewal processes need not be renewal processes.
For a positive integer-valued lifetime , one discrete-time residual lifetime Markov chain uses states . From state it moves to . From zero it draws an independent new lifetime and moves to :
The subtraction of one specifies the sampling convention: the next step has already consumed one unit of the new lifetime. With this convention, successive visits to zero are separated by exactly steps, not .
Its Stationary distribution is . The tail-sum identity normalizes these masses, and the balance equations verify them, with the obvious top-state equation. If deterministically, the chain cycles and its stationary law is uniform. It is periodic, so a Stationary distribution does not imply convergence from every initial state.
The equilibrium residual-life distribution describes the remaining wait to a renewal when observing a stationary renewal process at an ordinary time. For positive interarrivals with finite mean , it has survival function and density
The density integrates to one by the Tail-sum formula for expectation. It exists even when the original lifetime law has atoms. A deterministic lifetime gives a uniform residual on ; an exponential lifetime gives the same exponential distribution as the original lifetime.
For the discrete chain convention in residual lifetime Markov chain, the invariant probabilities are instead for . A deterministic integer lifetime gives a uniform law on . These formulas describe observation at equilibrium; they do not make the first lifetime of an ordinary renewal process already have that residual law.
For inter-renewal times with an Erlang distribution of integer shape and rate , the mean is and survival function is . The equilibrium first-delay density is survival divided by the mean,
This is the equal mixture of Erlang distributions of shapes . It can be constructed by observing a Poisson clock with uniformly randomized phase modulo , whose every th event is a renewal.

Ancestors (5)

  1. Probability theory
  2. Probability and statistics
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.