Hazard versus risk
In discrete time, where follow-up is split into intervals, the hazard and the risk are easy to confuse, because both are probabilities of an event during follow-up. The risk is cumulative from baseline, while the discrete-time hazard concerns a single interval (unlike the continuous-time hazard, which is a rate, not a probability). They answer different questions [9, Ch. 17], Section 17.2:
The risk and the hazard are different measures. The denominator of the risk—the number of individuals at baseline—is constant across times \(k\) and its numerator—all events between baseline and \(k\)—is cumulative. That is, the risk will stay flat or increase as \(k\) increases. On the other hand, the denominator of the hazard—the number of individuals alive at \(k\)—varies over time \(t\) and its numerator includes only recent events—those during interval \(k\). That is, the hazard may increase or decrease over time.
To make that comparison precise, consider an event time \(T\) that takes values in \(\{1, 2, 3, \ldots\}\), such as the follow-up interval in which an event occurs.
Definition 12 (Discrete-time risk) For an event time \(T\) that takes values in \(\{1, 2, 3, \ldots\}\) and \(k = 1, 2, \ldots\), the risk by \(k\) is \(\pi(k) \stackrel{\text{def}}{=}\Pr(T \le k)\), the probability of an event in any interval up to and including \(k\) among everyone at baseline.
Definition 13 (Discrete-time hazard) For each \(k\) with \(\Pr(T \ge k) > 0\), so that someone is still event-free at the start of interval \(k\), the discrete-time hazard at \(k\) is \({\lambda}_k \stackrel{\text{def}}{=}\Pr(T = k \mid T \ge k)\), the probability of an event in interval \(k\) among those still event-free at the start of interval \(k\).
Example 15 (Hazard versus risk in a cohort) Suppose 1000 people are followed for four years with no censoring, and 100, 50, 40, and 60 of them have the event in years 1 through 4. The hazard divides each year’s events by the number still event-free at the start of that year; the risk divides the running total of events by the 1000 people at baseline:
| 1 |
100 |
1000 |
\(100/1000 = 0.100\) |
100 |
\(0.10\) |
| 2 |
50 |
900 |
\(50/900 \approx 0.056\) |
150 |
\(0.15\) |
| 3 |
40 |
850 |
\(40/850 \approx 0.047\) |
190 |
\(0.19\) |
| 4 |
60 |
810 |
\(60/810 \approx 0.074\) |
250 |
\(0.25\) |
The hazard falls and then rises, while the risk increases every year.
While anyone is still event-free, the risk can be recovered from the hazards, and Theorem 9 shows why it can never decrease.
Theorem 9 (Risk in terms of discrete-time hazards) Under Definition 12 and Definition 13, for each \(k\) with \(\Pr(T \ge k) > 0\),
\[
\pi(k) = 1 - \prod_{j=1}^{k} (1 - {\lambda}_j).
\tag{5}\]
Since each factor \(1 - {\lambda}_j\) lies in \([0, 1]\), the product can only shrink as \(k\) grows, so \(\pi(k)\) never decreases as \(k\) grows.
Proof. This proof uses the definition of conditional probability and the subset property. Because \(T\) takes integer values, \(\{T > j - 1\} = \{T \ge j\}\). For each \(j \le k\), \(\Pr(T \ge j) \ge \Pr(T \ge k) > 0\) by the subset property, since \(\{T \ge k\} \subseteq \{T \ge j\}\); so \({\lambda}_j\) is defined and conditioning on \(T > j - 1\) is allowed. For each such \(j\):
\[
\begin{aligned}
\Pr(T > j)
&= \Pr(T > j,\ T > j - 1)
&& \text{(}\{T > j\} \subseteq \{T > j - 1\}\text{)}
\\
&= \Pr(T > j \mid T > j - 1)\Pr(T > j - 1)
&& \text{(definition of conditional probability)}
\\
&= \Pr(T > j \mid T \ge j)\Pr(T > j - 1)
&& \text{(}T \text{ is integer-valued)}
\\
&= \mathopen{}\left[1 - \Pr(T = j \mid T \ge j)\right]\mathclose{}\Pr(T > j - 1)
&& \text{(complement rule, given } T \ge j\text{)}
\\
&= (1 - {\lambda}_j)\Pr(T > j - 1)
&& \text{(definition of } {\lambda}_j\text{)}
\end{aligned}
\tag{6}\]
Applying Equation 6 for \(j = k, k - 1, \ldots, 1\), and using \(\Pr(T > 0) = 1\):
\[
\begin{aligned}
\pi(k)
&= 1 - \Pr(T > k)
&& \text{(complement of } \pi(k) = \Pr(T \le k)\text{)}
\\
&= 1 - \prod_{j=1}^{k}(1 - {\lambda}_j)\Pr(T > 0)
&& \text{(apply the identity } k \text{ times)}
\\
&= 1 - \prod_{j=1}^{k}(1 - {\lambda}_j)
&& \text{(}\Pr(T > 0) = 1\text{)}
\end{aligned}
\tag{7}\]
Example 16 (Recovering the risk from the hazards) Using the hazards from Example 15, Theorem 9 gives the four-year risk:
\[
\begin{aligned}
\pi(4)
&= 1 - (1 - 0.100)\mathopen{}\left(1 - \tfrac{50}{900}\right)\mathclose{}\mathopen{}\left(1 - \tfrac{40}{850}\right)\mathclose{}\mathopen{}\left(1 - \tfrac{60}{810}\right)\mathclose{}
&& \text{(substitute the hazards)}
\\
&= 1 - \tfrac{900}{1000} \cdot \tfrac{850}{900} \cdot \tfrac{810}{850} \cdot \tfrac{750}{810}
&& \text{(subtract each hazard from 1)}
\\
&= 1 - \tfrac{750}{1000}
&& \text{(cancel the telescoping terms)}
\\
&= 0.25
&& \text{(arithmetic)}
\end{aligned}
\tag{8}\]
which matches the 250 events out of 1000 people in Example 15.
Likelihood with censoring
If an event time \(T\) is observed exactly as \(T=t\), then the likelihood of that observation is just its probability density function:
\[
\begin{aligned}
\mathcal{L}(t)
&= \operatorname{f}(T=t)\\
&\stackrel{\text{def}}{=}\operatorname{f}_T(t)\\
&= {\lambda}_T(t)\operatorname{S}_T(t)\\
\ell(t)
&\stackrel{\text{def}}{=}{\operatorname{log}\mathopen{}\left\{\mathcal{L}(t)\right\}\mathclose{}}\\
&= {\operatorname{log}\mathopen{}\left\{{\lambda}_T(t) \operatorname{S}_T(t)\right\}\mathclose{}}\\
&= {\operatorname{log}\mathopen{}\left\{{\lambda}_T(t)\right\}\mathclose{}} + {\operatorname{log}\mathopen{}\left\{\operatorname{S}_T(t)\right\}\mathclose{}}\\
&= {\operatorname{log}\mathopen{}\left\{{\lambda}_T(t)\right\}\mathclose{}} - {\Lambda}_T(t)\\
\end{aligned}
\]
If instead the event time \(T\) is censored and only known to be after time \(y\), then the likelihood of that censored observation is instead the survival function evaluated at the censoring time:
\[
\begin{aligned}
\mathcal{L}(y)
&=p_T(T>y)\\
&\stackrel{\text{def}}{=}\operatorname{S}_T(y)\\
\ell(y)
&\stackrel{\text{def}}{=}{\operatorname{log}\mathopen{}\left\{\mathcal{L}(y)\right\}\mathclose{}}\\
&={\operatorname{log}\mathopen{}\left\{\operatorname{S}(y)\right\}\mathclose{}}\\
&=-{\Lambda}(y)\\
\end{aligned}
\]
The simplified likelihood formulation is incomplete because it omits the censoring mechanism. We also observed whether or not the observation was censored. Let \(C\) denote the time when censoring would occur (if the event did not occur first); let \(f_C(y)\) and \(S_C(y)\) be the corresponding density and survival functions for the censoring event.
Let \(Y\) denote the time when observation ended (either by censoring or by the event of interest occurring), and let \(D\) be an indicator variable for the event occurring at \(Y\) (so \(D=0\) represents a censored observation and \(D=1\) represents an uncensored observation). In other words, let \(Y \stackrel{\text{def}}{=}\min(T,C)\) and \(D \stackrel{\text{def}}{=}{\mathbb{1}\mathopen{}\left\{T \le C\right\}\mathclose{}}\).
Then the complete likelihood of the observed data \((Y,D)\) is:
\[
\begin{aligned}
\mathcal{L}(y,d)
&= \operatorname{p}(Y=y, D=d)\\
&= \mathopen{}\left[\operatorname{p}(T=y,C> y)\right]\mathclose{}^d \cdot \mathopen{}\left[\operatorname{p}(T>y,C=y)\right]\mathclose{}^{1-d}\\
\end{aligned}
\]
Terminology varies across textbooks: some authors call condition 1 independent censoring and reserve non-informative censoring for condition 2 [6, Ch. 1]. In this chapter, “non-informative censoring” means both conditions together, since the likelihood factorization in this section uses both.
Typically, survival analyses assume that censoring is non-informative (Definition 14); in particular, \(C\) and \(T\) are mutually independent.
Then the joint likelihood \(\operatorname{p}(Y,D)\) factors into the product \(\operatorname{p}(Y), \operatorname{p}(D)\), and the likelihood reduces to:
\[
\begin{aligned}
\mathcal{L}(y,d)
&= \mathopen{}\left[\operatorname{p}(T=y,C> y)\right]\mathclose{}^d\cdot
\mathopen{}\left[\operatorname{p}(T>y,C=y)\right]\mathclose{}^{1-d}\\
&= \mathopen{}\left[\operatorname{p}(T=y)\operatorname{p}(C> y)\right]\mathclose{}^d\cdot
\mathopen{}\left[\operatorname{p}(T>y)\operatorname{p}(C=y)\right]\mathclose{}^{1-d}\\
&= \mathopen{}\left[\operatorname{f}_T(y)\operatorname{S}_C(y)\right]\mathclose{}^d\cdot
\mathopen{}\left[\operatorname{S}(y)\operatorname{f}_C(y)\right]\mathclose{}^{1-d}\\
&= \mathopen{}\left[\operatorname{f}_T(y)^d \operatorname{S}_C(y)^d\right]\mathclose{}\cdot
\mathopen{}\left[\operatorname{S}_T(y)^{1-d} \operatorname{f}_C(y)^{1-d}\right]\mathclose{}\\
&= \mathopen{}\left(\operatorname{f}_T(y)^d \cdot \operatorname{S}_T(y)^{1-d}\right)\mathclose{}\cdot
\mathopen{}\left(\operatorname{f}_C(y)^{1-d} \cdot \operatorname{S}_C(y)^{d}\right)\mathclose{}
\end{aligned}
\]
\[
\begin{aligned}
\ell(y,d)
&= {\operatorname{log}\mathopen{}\left\{\mathcal{L}(y,d)\right\}\mathclose{}}\\
&= {\operatorname{log}\mathopen{}\left\{
\mathopen{}\left(f_T(y)^d \cdot S_T(y)^{1-d}\right)\mathclose{}
\cdot
\mathopen{}\left(f_C(y)^{1-d} \cdot S_C(y)^{d}\right)\mathclose{}
\right\}\mathclose{}}
\\
&= {\operatorname{log}\mathopen{}\left\{f_T(y)^d \cdot S_T(y)^{1-d}\right\}\mathclose{}}
+
{\operatorname{log}\mathopen{}\left\{f_C(y)^{1-d} \cdot S_C(y)^{d}\right\}\mathclose{}}
\end{aligned}
\] Let
-
\(\theta_T\) represent the parameters of \(p_T(t)\),
-
\(\theta_C\) represent the parameters of \(p_C(c)\),
-
\(\theta = (\theta_T, \theta_C)\) be the combined vector of all parameters.
\[
\begin{aligned}
\ell'(y,d)
&= \frac{\partial}{\partial \theta}
\mathopen{}\left[
{\operatorname{log}\mathopen{}\left\{f_T(y)^d \cdot S_T(y)^{1-d}\right\}\mathclose{}}
+
{\operatorname{log}\mathopen{}\left\{f_C(y)^{1-d} \cdot S_C(y)^{d}\right\}\mathclose{}}
\right]\mathclose{}
\\
&=
\mathopen{}\left(
\frac{\partial}{\partial \theta}
{\operatorname{log}\mathopen{}\left\{
f_T(y)^d \cdot S_T(y)^{1-d}
\right\}\mathclose{}}
\right)\mathclose{}
+
\mathopen{}\left(
\frac{\partial}{\partial \theta}
{\operatorname{log}\mathopen{}\left\{
f_C(y)^{1-d} \cdot S_C(y)^{d}
\right\}\mathclose{}}
\right)\mathclose{}
\end{aligned}
\]
As long as \(\theta_C\) and \(\theta_T\) don’t share any parameters, then if censoring is non-informative, the partial derivative with respect to \(\theta_T\) is:
\[
\begin{aligned}
\ell'_{\theta_T}(y,d)
&\stackrel{\text{def}}{=}\frac{\partial}{\partial \theta_T}\ell(y,d)\\
&=
\mathopen{}\left(
\frac{\partial}{\partial \theta_T}
\text{log}{\mathopen{}\left\{
f_T(y)^d \cdot S_T(y)^{1-d}
\right\}\mathclose{}}
\right)\mathclose{}
+
\mathopen{}\left(
\frac{\partial}{\partial \theta_T}
\text{log}{\mathopen{}\left\{
f_C(y)^{1-d} \cdot S_C(y)^{d}
\right\}\mathclose{}}
\right)\mathclose{}\\
&=
\mathopen{}\left(
\frac{\partial}{\partial \theta_T}
\text{log}{\mathopen{}\left\{
f_T(y)^d \cdot S_T(y)^{1-d}
\right\}\mathclose{}}
\right)\mathclose{} + 0\\
&=
\frac{\partial}{\partial \theta_T}
\text{log}{\mathopen{}\left\{
f_T(y)^d \cdot S_T(y)^{1-d}
\right\}\mathclose{}}\\
\end{aligned}
\]
Thus, the MLE for \(\theta_T\) won’t depend on \(\theta_C\), and we can ignore the distribution of \(C\) when estimating the parameters of \(f_T(t)=p(T=t)\).
Then:
\[
\begin{aligned}
\mathcal{L}(y,d)
&= f_T(y)^d \cdot S_T(y)^{1-d}\\
&= \mathopen{}\left(h_T(y)^d S_T(y)^d\right)\mathclose{} \cdot S_T(y)^{1-d}\\
&= h_T(y)^d \cdot S_T(y)^d \cdot S_T(y)^{1-d}\\
&= h_T(y)^d \cdot S_T(y)\\
&= S_T(y) \cdot h_T(y)^d \\
\end{aligned}
\]
Specifically, if the event occurred at time \(y\) (i.e., if \(d=1\)), then the likelihood of \((Y,D) = (y,d)\) is equal to the hazard function at \(y\) times the survival function at \(y\). Otherwise, the likelihood is equal to just the survival function at \(y\).
The corresponding log-likelihood is:
\[
\begin{aligned}
\ell(y,d)
&=\text{log}{\mathopen{}\left\{\mathcal{L}(y,d)\right\}\mathclose{}}\\
&= \text{log}{\mathopen{}\left\{S_T(y) \cdot h_T(y)^d\right\}\mathclose{}}\\
&= \text{log}{\mathopen{}\left\{S_T(y)\right\}\mathclose{}} + \text{log}{\mathopen{}\left\{h_T(y)^d\right\}\mathclose{}}\\
&= \text{log}{\mathopen{}\left\{S_T(y)\right\}\mathclose{}} + d\cdot \text{log}{\mathopen{}\left\{h_T(y)\right\}\mathclose{}}\\
&= -H_T(y) + d\cdot \text{log}{\mathopen{}\left\{h_T(y)\right\}\mathclose{}}\\
\end{aligned}
\]
In other words, the log-likelihood contribution from a single observation \((Y,D) = (y,d)\) is equal to the negative cumulative hazard at \(y\), plus the log of the hazard at \(y\) if the event occurred at time \(y\).