Residual time explained

In the theory of renewal processes, a part of the mathematical theory of probability, the residual time or the forward recurrence time is the time between any given time

t

and the next epoch of the renewal process under consideration. In the context of random walks, it is also known as overshoot. Another way to phrase residual time is "how much more time is there to wait?".

The residual time is very important in most of the practical applications of renewal processes:

Formal definition

Consider a renewal process

\{N(t),t\geq0\}

, with holding times

Si

and jump times (or renewal epochs)

Ji

, and

i\inN

. The holding times

Si

are non-negative, independent, identically distributed random variables and the renewal process is defined as

N(t)=\sup\{n:Jn\leqt\}

. Then, to a given time

t

, there corresponds uniquely an

N(t)

, such that:

JN(t)\leqt<JN(t)+1.

The residual time (or excess time) is given by the time

Y(t)

from

t

to the next renewal epoch.

Y(t)=JN(t)+1-t.

Probability distribution of the residual time

Let the cumulative distribution function of the holding times

Si

be

F(t)=Pr[Si\leqt]

and recall that the renewal function of a process is

m(t)=E[N(t)]

. Then, for a given time

t

, the cumulative distribution function of

Y(t)

is calculated as:[2]

\Phi(x,t)=\Pr[Y(t)\leqx]=F(t+x)-

t
\int
0

\left[1-F(t+x-y)\right]dm(y)

Differentiating with respect to

x

, the probability density function can be written as

\phi(x,t)=f(t+x)+

t
\int
0

f(u+x)m'(t-u)du,

where we have substituted

u=t-y.

From elementary renewal theory,

m'(t)1/\mu

as

tinfty

, where

\mu

is the mean of the distribution

F

. If we consider the limiting distribution as

tinfty

, assuming that

f(t)0

as

tinfty

, we have the limiting pdf as

\phi(x)=

1
\mu
infty
\int
0

f(u+x)du=

1
\mu
infty
\int
x

f(v)dv=

1-F(x)
\mu

.

Likewise, the cumulative distribution of the residual time is

\Phi(x)=

1
\mu
x
\int
0

[1-F(u)]du.

For large

t

, the distribution is independent of

t

, making it a stationary distribution. An interesting fact is that the limiting distribution of forward recurrence time (or residual time) has the same form as the limiting distribution of the backward recurrence time (or age). This distribution is always J-shaped, with mode at zero.

The first two moments of this limiting distribution

\Phi

are:

E[Y]=

\mu2
2\mu

=

\mu2+\sigma2
2\mu

,

E[Y2]=

\mu3
3\mu

,

where

\sigma2

is the variance of

F

and

\mu2

and

\mu3

are its second and third moments.

Waiting time paradox

The fact that

E[Y]=

\mu2+\sigma2
2\mu

>

\mu
2

(for

\sigma>0

) is also known variously as the waiting time paradox, inspection paradox, or the paradox of renewal theory. The paradox arises from the fact that the average waiting time until the next renewal, assuming that the reference time point

t

is uniform randomly selected within the inter-renewal interval, is larger than the average inter-renewal interval
\mu
2
. The average waiting is

E[Y]=

\mu
2
only when

\sigma2=0

, that is when the renewals are always punctual or deterministic.

Special case: Markovian holding times

When the holding times

Si

are exponentially distributed with

F(t)=1-e

, the residual times are also exponentially distributed. That is because

m(t)=λt

and:

\Pr[Y(t)\leqx]=\left[1-e(t+x)\right]-

t
\int
0

\left[1-1+e(t+x-y)\right]d(λy)=1-e.

This is a known characteristic of the exponential distribution, i.e., its memoryless property. Intuitively, this means that it does not matter how long it has been since the last renewal epoch, the remaining time is still probabilistically the same as in the beginning of the holding time interval.

Related notions

Renewal theory texts usually also define the spent time or the backward recurrence time (or the current lifetime) as

Z(t)=t-JN(t)

. Its distribution can be calculated in a similar way to that of the residual time. Likewise, the total life time is the sum of backward recurrence time and forward recurrence time.

Notes and References

  1. William J. Stewart, "Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling", Princeton University Press, 2011,, 9781400832811
  2. Jyotiprasad Medhi, "Stochastic processes", New Age International, 1994,, 9788122405491