Renewal theory

Renewal theory is the branch of probability theory that generalizes the Poisson process for arbitrary holding times. Instead of exponentially distributed holding times, a renewal process may have any independent and identically distributed (IID) holding times that have finite mean. A renewal-reward process additionally has a random sequence of rewards incurred at each holding time, which are IID but need not be independent of the holding times.

A renewal process has asymptotic properties analogous to the strong law of large numbers and central limit theorem. The renewal function $m(t)$ (expected number of arrivals) and reward function $g(t)$ (expected reward value) are of key importance in renewal theory. The renewal function satisfies a recursive integral equation, the renewal equation. The key renewal equation gives the limiting value of the convolution of $m'(t)$ with a suitable non-negative function. The superposition of renewal processes can be studied as a special case of Markov renewal processes.

Applications include calculating the best strategy for replacing worn-out machinery in a factory and comparing the long-term benefits of different insurance policies. The inspection paradox relates to the fact that observing a renewal interval at time t gives an interval with average value larger than that of an average renewal interval.

Renewal processes

Introduction

The renewal process is a generalization of the Poisson process. In essence, the Poisson process is a continuous-time Markov process on the positive integers (usually starting at zero) which has independent exponentially distributed holding times at each integer $i$ before advancing to the next integer, $i+1$ . In a renewal process, the holding times need not have an exponential distribution; rather, the holding times may have any distribution on the positive numbers, so long as the holding times are independent and identically distributed (IID) and have finite mean.

Formal definition

Sample evolution of a renewal process with holding times S_i and jump times J_n.

Let $S_{1},S_{2},S_{3},S_{4},S_{5},\ldots$ be a sequence of positive independent identically distributed random variables such that

0<\operatorname {E} [S_{i}]<\infty .

We refer to the random variable $S_{i}$ as the " $i$ -th holding time".

$\operatorname {E} [S_{i}]$ is the expectation of $S_{i}$ .

Define for each n > 0 :

J_{n}=\sum _{i=1}^{n}S_{i},

each $J_{n}$ is referred to as the " $n$ -th jump time" and the intervals $[J_{n},J_{n+1}]$ are called "renewal intervals".

Then $(X_{t})_{t\geq 0}$ is given by random variable

X_{t}=\sum _{n=1}^{\infty }\operatorname {\mathbb {I} } _{\{J_{n}\leq t\}}=\sup \left\{\,n:J_{n}\leq t\,\right\}

where $\operatorname {\mathbb {I} } _{\{J_{n}\leq t\}}$ is the indicator function

\operatorname {\mathbb {I} } _{\{J_{n}\leq t\}}={\begin{cases}1,&{\text{if }}J_{n}\leq t\\0,&{\text{otherwise}}\end{cases}}

$(X_{t})_{t\geq 0}$ represents the number of jumps that have occurred by time t, and is called a renewal process.

Interpretation

If one considers events occurring at random times, one may choose to think of the holding times $\{S_{i}:i\geq 1\}$ as the random time elapsed between two consecutive events. For example, if the renewal process is modelling the numbers of breakdown of different machines, then the holding time represents the time between one machine breaking down before another one does.

The Poisson process is the unique renewal process with the Markov property,[1] as the exponential distribution is the unique continuous random variable with the property of memorylessness.

Renewal-reward processes

Sample evolution of a renewal-reward process with holding times S_i, jump times J_n and rewards W_i

Let $W_{1},W_{2},\ldots$ be a sequence of IID random variables (rewards) satisfying

\operatorname {E} |W_{i}|<\infty .\,

Then the random variable

Y_{t}=\sum _{i=1}^{X_{t}}W_{i}

is called a renewal-reward process. Note that unlike the $S_{i}$ , each $W_{i}$ may take negative values as well as positive values.

The random variable $Y_{t}$ depends on two sequences: the holding times $S_{1},S_{2},\ldots$ and the rewards $W_{1},W_{2},\ldots$ These two sequences need not be independent. In particular, $W_{i}$ may be a function of $S_{i}$ .

Interpretation

In the context of the above interpretation of the holding times as the time between successive malfunctions of a machine, the "rewards" $W_{1},W_{2},\ldots$ (which in this case happen to be negative) may be viewed as the successive repair costs incurred as a result of the successive malfunctions.

An alternative analogy is that we have a magic goose which lays eggs at intervals (holding times) distributed as $S_{i}$ . Sometimes it lays golden eggs of random weight, and sometimes it lays toxic eggs (also of random weight) which require responsible (and costly) disposal. The "rewards" $W_{i}$ are the successive (random) financial losses/gains resulting from successive eggs (i = 1,2,3,...) and $Y_{t}$ records the total financial "reward" at time t.

Renewal function

We define the renewal function as the expected value of the number of jumps observed up to some time $t$ :

m(t)=\operatorname {E} [X_{t}].\,

Elementary renewal theorem

The renewal function satisfies

\lim _{t\to \infty }{\frac {1}{t}}m(t)={\frac {1}{\operatorname {E} [S_{1}]}}.

Proof

The strong law of large numbers for renewal processes implies

\lim _{t\to \infty }{\frac {X_{t}}{t}}={\frac {1}{\operatorname {E} [S_{1}]}}.

To prove the elementary renewal theorem, it is sufficient to show that $\left\{{\frac {X_{t}}{t}};t\geq 0\right\}$ is uniformly integrable.

To do this, consider some truncated renewal process where the holding times are defined by ${\overline {S_{n}}}=a\operatorname {\mathbb {I} } \{S_{n}>a\}$ where $a$ is a point such that $0<F(a)=p<1$ which exists for all non-deterministic renewal processes. This new renewal process ${\overline {X}}_{t}$ is an upper bound on $X_{t}$ and its renewals can only occur on the lattice $\{na;n\in \mathbb {N} \}$ . Furthermore, the number of renewals at each time is geometric with parameter $p$ . So we have

{\begin{aligned}{\overline {X_{t}}}&\leq \sum _{i=1}^{[at]}\operatorname {Geometric} (p)\\\operatorname {E} \left[\,{\overline {X_{t}}}^{2}\,\right]&\leq C_{1}t+C_{2}t^{2}\\P\left({\frac {X_{t}}{t}}>x\right)&\leq {\frac {\operatorname {E} \left[X_{t}^{2}\right]}{t^{2}x^{2}}}\leq {\frac {\operatorname {E} \left[{\overline {X_{t}}}^{2}\right]}{t^{2}x^{2}}}\leq {\frac {C}{x^{2}}}.\end{aligned}}

Elementary renewal theorem for renewal reward processes

We define the reward function:

g(t)=\operatorname {E} [Y_{t}].\,

The reward function satisfies

\lim _{t\to \infty }{\frac {1}{t}}g(t)={\frac {\operatorname {E} [W_{1}]}{\operatorname {E} [S_{1}]}}.

Renewal equation

The renewal function satisfies

m(t)=F_{S}(t)+\int _{0}^{t}m(t-s)f_{S}(s)\,ds

where $F_{S}$ is the cumulative distribution function of $S_{1}$ and $f_{S}$ is the corresponding probability density function.

Proof[2]

We may iterate the expectation about the first holding time:

m(t)=\operatorname {E} [X_{t}]=\operatorname {E} [\operatorname {E} (X_{t}\mid S_{1})].\,

From the definition of the renewal process, we have

\operatorname {E} (X_{t}\mid S_{1}=s)=\operatorname {\mathbb {I} } _{\{t\geq s\}}\left(1+\operatorname {E} [X_{t-s}]\right).\,

So

{\begin{aligned}m(t)&=\operatorname {E} [X_{t}]\\[12pt]&=\operatorname {E} [\operatorname {E} (X_{t}\mid S_{1})]\\[12pt]&=\int _{0}^{\infty }\operatorname {E} (X_{t}\mid S_{1}=s)f_{S}(s)\,ds\\[12pt]&=\int _{0}^{\infty }\operatorname {\mathbb {I} } _{\{t\geq s\}}\left(1+\operatorname {E} [X_{t-s}]\right)f_{S}(s)\,ds\\[12pt]&=\int _{0}^{t}\left(1+m(t-s)\right)f_{S}(s)\,ds\\[12pt]&=F_{S}(t)+\int _{0}^{t}m(t-s)f_{S}(s)\,ds,\end{aligned}}

as required.

Key renewal theorem

Let X be a renewal process with renewal function $m(t)$ and interrenewal mean $\mu$ . Let $g:[0,\infty )\rightarrow [0,\infty )$ be a function satisfying:

$\int _{0}^{\infty }g(t)\,dt<\infty$
g is monotone and non-increasing

The key renewal theorem states that, as $t\rightarrow \infty$ :[3]

\int _{0}^{t}g(t-x)m'(x)\,dx\rightarrow {\frac {1}{\mu }}\int _{0}^{\infty }g(x)\,dx

Renewal theorem

Considering $g(x)=\mathbb {I} _{[0,h]}(x)$ for any $h>0$ gives as a special case the renewal theorem:[4]

m(t+h)-m(t)\rightarrow {\frac {h}{\mu }}

as

t\rightarrow \infty

The result can be proved using integral equations or by a coupling argument.[5] Though a special case of the key renewal theorem, it can be used to deduce the full theorem, by considering step functions and then increasing sequences of step functions.[3]

Asymptotic properties

Renewal processes and renewal-reward processes have properties analogous to the strong law of large numbers, which can be derived from the same theorem. If $(X_{t})_{t\geq 0}$ is a renewal process and $(Y_{t})_{t\geq 0}$ is a renewal-reward process then:

\lim _{t\to \infty }{\frac {1}{t}}X_{t}={\frac {1}{\operatorname {E} [S_{1}]}}

[6]

\lim _{t\to \infty }{\frac {1}{t}}Y_{t}={\frac {1}{\operatorname {E} [S_{1}]}}\operatorname {E} [W_{1}]

almost surely.

Proof

First consider

(X_{t})_{t\geq 0}

. By definition we have:

J_{X_{t}}\leq t\leq J_{X_{t}+1}

for all $t\geq 0$ and so

{\frac {J_{X_{t}}}{X_{t}}}\leq {\frac {t}{X_{t}}}\leq {\frac {J_{X_{t}+1}}{X_{t}}}

for all t ≥ 0.

Now since $0<\operatorname {E} [S_{i}]<\infty$ we have:

X_{t}\to \infty

as $t\to \infty$ almost surely (with probability 1). Hence:

{\frac {J_{X_{t}}}{X_{t}}}={\frac {J_{n}}{n}}={\frac {1}{n}}\sum _{i=1}^{n}S_{i}\to \operatorname {E} [S_{1}]

almost surely (using the strong law of large numbers); similarly:

{\frac {J_{X_{t}+1}}{X_{t}}}={\frac {J_{X_{t}+1}}{X_{t}+1}}{\frac {X_{t}+1}{X_{t}}}={\frac {J_{n+1}}{n+1}}{\frac {n+1}{n}}\to \operatorname {E} [S_{1}]\cdot 1

almost surely.

Thus (since $t/X_{t}$ is sandwiched between the two terms)

{\frac {1}{t}}X_{t}\to {\frac {1}{\operatorname {E} [S_{1}]}}

almost surely.[3]

Next consider $(Y_{t})_{t\geq 0}$ . We have

{\frac {1}{t}}Y_{t}={\frac {X_{t}}{t}}{\frac {1}{X_{t}}}Y_{t}\to {\frac {1}{\operatorname {E} [S_{1}]}}\cdot \operatorname {E} [W_{1}]

almost surely (using the first result and using the law of large numbers on $Y_{t}$ ).

Renewal processes additionally have a property analogous to the central limit theorem:[6]

{\frac {X_{t}-t/\mu }{\sqrt {t\sigma ^{2}/\mu ^{3}}}}

Inspection paradox

The renewal interval determined by the random point t (shown in red) is stochastically larger than the first renewal interval.

A curious feature of renewal processes is that if we wait some predetermined time t and then observe how large the renewal interval containing t is, we should expect it to be typically larger than a renewal interval of average size.

Mathematically the inspection paradox states: for any t > 0 the renewal interval containing t is stochastically larger than the first renewal interval. That is, for all x > 0 and for all t > 0:

\operatorname {P} (S_{X_{t}+1}>x)\geq \operatorname {P} (S_{1}>x)=1-F_{S}(x)

where F_S is the cumulative distribution function of the IID holding times S_i.

The resolution of the paradox is that our sampled distribution at time t is size-biased, in that the likelihood an interval is chosen is proportional to its size. However, a renewal interval of average size is not size-biased.

Proof

Observe that the last jump-time before t is

J_{X_{t}}

; and that the renewal interval containing t is

S_{X_{t}+1}

. Then

{\begin{aligned}\operatorname {P} (S_{X_{t}+1}>x)&{}=\int _{0}^{\infty }\operatorname {P} (S_{X_{t}+1}>x\mid J_{X_{t}}=s)f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}=\int _{0}^{\infty }\operatorname {P} (S_{X_{t}+1}>x|S_{X_{t}+1}>t-s)f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}=\int _{0}^{\infty }{\frac {\operatorname {P} (S_{X_{t}+1}>x\,,\,S_{X_{t}+1}>t-s)}{\operatorname {P} (S_{X_{t}+1}>t-s)}}f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}=\int _{0}^{\infty }{\frac {1-F(\max\{x,t-s\})}{1-F(t-s)}}f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}=\int _{0}^{\infty }\min \left\{{\frac {1-F(x)}{1-F(t-s)}},{\frac {1-F(t-s)}{1-F(t-s)}}\right\}f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}=\int _{0}^{\infty }\min \left\{{\frac {1-F(x)}{1-F(t-s)}},1\right\}f_{J_{X_{t}}}(s)\,ds\\[12pt]&{}\geq \int _{0}^{\infty }(1-F(x))f_{J_{X_{t}}}(s)\,ds=1-F(x)=\operatorname {P} (S_{1}>x),\\[12pt]\end{aligned}}

since both ${\frac {1-F(x)}{1-F(t-s)}}$ and $1$ are greater than or equal to $1-F(x)$ for all values of s.

Superposition

Unless the renewal process is a Poisson process, the superposition (sum) of two independent renewal processes is not a renewal process.[7] However, such processes can be described within a larger class of processes called the Markov-renewal processes.[8] However, the cumulative distribution function of the first inter-event time in the superposition process is given by[9]

R(t)=1-\sum _{k=1}^{K}{\frac {\alpha _{k}}{\sum _{l=1}^{K}\alpha _{l}}}(1-R_{k}(t))\prod _{j=1,j\neq k}^{K}\alpha _{j}\int _{t}^{\infty }(1-R_{j}(u))\,{\text{d}}u

where R_k(t) and α_k > 0 are the CDF of the inter-event times and the arrival rate of process k.[10]

Example application

Eric the entrepreneur has n machines, each having an operational lifetime uniformly distributed between zero and two years. Eric may let each machine run until it fails with replacement cost €2600; alternatively he may replace a machine at any time while it is still functional at a cost of €200.

What is his optimal replacement policy?

Solution

The lifetime of the n machines can be modeled as n independent concurrent renewal-reward processes, so it is sufficient to consider the case n=1. Denote this process by

(Y_{t})_{t\geq 0}

. The successive lifetimes S of the replacement machines are independent and identically distributed, so the optimal policy is the same for all replacement machines in the process.

If Eric decides at the start of a machine's life to replace it at time 0 < t < 2 but the machine happens to fail before that time then the lifetime S of the machine is uniformly distributed on [0, t] and thus has expectation 0.5t. So the overall expected lifetime of the machine is:

{\begin{aligned}\operatorname {E} [S]&=\operatorname {E} [S\mid {\text{fails before }}t]\cdot \operatorname {P} [{\text{fails before }}t]+\operatorname {E} [S\mid {\text{does not fail before }}t]\cdot \operatorname {P} [{\text{does not fail before }}t]\\[6pt]&=0.5t({\frac {t}{2}})+t({\frac {2-t}{2}})\end{aligned}}

and the expected cost W per machine is:

{\begin{aligned}\operatorname {E} [W]&=\operatorname {E} [W\mid {\text{fails before }}t]\cdot \operatorname {P} ({\text{fails before }}t)+\operatorname {E} [W\mid {\text{does not fail before }}t]\cdot \operatorname {P} ({\text{does not fail before }}t)\\[6pt]&=2600({\frac {t}{2}})+200({\frac {2-t}{2}})=1200t+200.\end{aligned}}

So by the strong law of large numbers, his long-term average cost per unit time is:

{\frac {1}{t}}Y_{t}\simeq {\frac {\operatorname {E} [W]}{\operatorname {E} [S]}}={\frac {4(1200t+200)}{t^{2}+4t-2t^{2}}}

then differentiating with respect to t:

{\frac {\partial }{\partial t}}{\frac {4(1200t+200)}{t^{2}+4t-2t^{2}}}=4{\frac {(4t-t^{2})(1200)-(4-2t)(1200t+200)}{(t^{2}+4t-2t^{2})^{2}}},

this implies that the turning points satisfy:

{\begin{aligned}0&=(4t-t^{2})(1200)-(4-2t)(1200t+200)=4800t-1200t^{2}-4800t-800+2400t^{2}+400t\\[6pt]&=-800+400t+1200t^{2},\end{aligned}}

and thus

0=3t^{2}+t-2=(3t-2)(t+1).

We take the only solution t in [0, 2]: t = 2/3. This is indeed a minimum (and not a maximum) since the cost per unit time tends to infinity as t tends to zero, meaning that the cost is decreasing as t increases, until the point 2/3 where it starts to increase.

Notes

Grimmett & Stirzaker (1992), p. 393.
Grimmett & Stirzaker (1992), p. 390.
Grimmett & Stirzaker (1992), p. 395.
Feller (1971), p. 347–351.
Grimmett & Stirzaker (1992), p. 394–5.
Grimmett & Stirzaker (1992), p. 394.
Grimmett & Stirzaker (1992), p. 405.
Çinlar, Erhan (1969). "Markov Renewal Theory". Advances in Applied Probability. Applied Probability Trust. 1 (2): 123–187. doi:10.2307/1426216. JSTOR 1426216.
Lawrence, A. J. (1973). "Dependency of Intervals Between Events in Superposition Processes". Journal of the Royal Statistical Society. Series B (Methodological). 35 (2): 306–315. doi:10.1111/j.2517-6161.1973.tb00960.x. JSTOR 2984914. formula 4.1
Choungmo Fofack, Nicaise; Nain, Philippe; Neglia, Giovanni; Towsley, Don. "Analysis of TTL-based Cache Networks". Proceedings of 6th International Conference on Performance Evaluation Methodologies and Tools. Retrieved Nov 15, 2012.

References

Cox, David (1970). Renewal Theory. London: Methuen & Co. p. 142. ISBN 0-412-20570-X.
Doob, J. L. (1948). "Renewal Theory From the Point of View of the Theory of Probability" (PDF). Transactions of the American Mathematical Society. 63 (3): 422–438. doi:10.2307/1990567. JSTOR 1990567.
Feller, William (1971). An introduction to probability theory and its applications. 2 (second ed.). Wiley.
Grimmett, G. R.; Stirzaker, D. R. (1992). Probability and Random Processes (second ed.). Oxford University Press. ISBN 0198572220.
Smith, Walter L. (1958). "Renewal Theory and Its Ramifications". Journal of the Royal Statistical Society, Series B. 20 (2): 243–302. JSTOR 2983891.
Wanli Wang, Johannes H. P. Schulz, Weihua Deng, and Eli Barkai (2018). "Renewal theory with fat-tailed distributed sojourn times: Typical versus rare". Phys. Rev. E. 98 (4): 042139. arXiv:1809.05856. Bibcode:2018PhRvE..98d2139W. doi:10.1103/PhysRevE.98.042139.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[FOOTNOTEGrimmettStirzaker1992393-1] Grimmett & Stirzaker (1992), p. 393.

[FOOTNOTEGrimmettStirzaker1992390-2] Grimmett & Stirzaker (1992), p. 390.

[FOOTNOTEGrimmettStirzaker1992395-3] Grimmett & Stirzaker (1992), p. 395.

[FOOTNOTEFeller1971347–351-4] Feller (1971), p. 347–351.

[FOOTNOTEGrimmettStirzaker1992394–5-5] Grimmett & Stirzaker (1992), p. 394–5.

[FOOTNOTEGrimmettStirzaker1992394-6] Grimmett & Stirzaker (1992), p. 394.

[FOOTNOTEGrimmettStirzaker1992405-7] Grimmett & Stirzaker (1992), p. 405.

[8] Çinlar, Erhan (1969). "Markov Renewal Theory". Advances in Applied Probability. Applied Probability Trust. 1 (2): 123–187. doi:10.2307/1426216. JSTOR 1426216.

[9] Lawrence, A. J. (1973). "Dependency of Intervals Between Events in Superposition Processes". Journal of the Royal Statistical Society. Series B (Methodological). 35 (2): 306–315. doi:10.1111/j.2517-6161.1973.tb00960.x. JSTOR 2984914. formula 4.1

[10] Choungmo Fofack, Nicaise; Nain, Philippe; Neglia, Giovanni; Towsley, Don. "Analysis of TTL-based Cache Networks". Proceedings of 6th International Conference on Performance Evaluation Methodologies and Tools. Retrieved Nov 15, 2012.

Stochastic processes
Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding Biased Maximal entropy
Continuous time	Additive process Bessel process Birth–death process pure birth Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Empirical process Feller process Fleming–Viot process Gamma process Geometric process Hawkes process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage
Both	Branching process Galves–Löcherbach model Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process Stochastic chains with memory of variable length White noise
Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph
Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model
Financial models	Binomial options pricing model Black–Derman–Toy Black–Karasinski Black–Scholes Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie
Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson
Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c
Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible
Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal, Borel–Cantelli, Engelbert–Schmidt, Hewitt–Savage, Kolmogorov, Lévy)
Inequalities	Burkholder–Davis–Gundy Doob's martingale Doob's upcrossing Kunita–Watanabe
Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Karhunen–Loève_theorem Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract
Disciplines	Actuarial mathematics Control theory Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Signal processing Statistics System on Chip design Stochastic analysis Time series analysis Machine learning
List of topics Category

Renewal theory

Renewal processes

Introduction

Formal definition

Interpretation

Renewal-reward processes

Interpretation

Renewal function

Elementary renewal theorem

Elementary renewal theorem for renewal reward processes

Renewal equation

Key renewal theorem

Renewal theorem

Asymptotic properties

Inspection paradox

Superposition

Example application

See also

Notes

References