Let be the exponential censoring rate and assume its time is independent of the exponential death time. Regard censoring as the competing event B. The preceding conditional-density calculation gives
Hence the reported death-only rate estimates the combined rate:
It is not, in general, an estimate of the death cause-specific hazard alone. This interpretation assumes the stated two-exponential competition without an additional administrative end of observation that truncates the conditional time distribution.
A right-censored subject contributes survival up to the recorded censoring time, not no information. Under independent censoring, write and . For exponential death rate , the event-model survival likelihood is
Discarding censored subjects drops observed exposure and selects people whose death occurred before censoring. Their recorded event times are not an unselected sample of all death times. The death-only conditional distribution can differ from the marginal death-time distribution even when censoring is independent. A correct maximum-likelihood estimate uses the total observed person-time, including censored follow-up.
Divide the joint first-event/type-A density by the type probability. For ,
It integrates to one, so the conditional time is exponential with rate . Type-A events that win the competition tend to occur sooner than an unrestricted latent A time. In fact the same conditional density holds for B, so the observed first-event time and its type are independent in this constant-rate model.
Letting in the cumulative incidence function gives the probability that the observed first event is of type A:
This is the sense of occurrence in the competing risks model. If one instead followed the latent exponential even after B, its eventual-occurrence probability would be one; that is a different question from observing A before the competing event.
Integrate the type-A first-event density from zero to . The type-A cumulative incidence is
This is the cumulative incidence function in the competing risks model, distinct from the hypothetical net risk obtained by removing B.
Multiply survival to by the conditional type-A event probability in the next infinitesimal interval. The unconditional type-A increment probability is
Equivalently, its exact value over a positive interval of length is . The factor is essential because a prior B event removes an individual from the relevant risk set.
Let be the first event time and its type. The cause-specific hazard for A is
It is a rate among people free of both event types, not the marginal probability of eventually experiencing A. Under the given independent latent event times, their constant hazard functions give exponential survivor functions. Therefore the first-event survivor is
The combined first-event rate is . Subsequent formulas concerning conditioning on type A require .
Put . A binary event increment has conditional variance . Since , its squared mean is of second order, giving
Treating the predictable risk set size as known given the history, the Nelson–Aalen estimator increment therefore has first-order variance
Substitute for to obtain the estimated increment variance . Summing these estimated predictable variances gives the usual Nelson–Aalen variance estimator:
The martingale has orthogonal increments, which justifies accumulating the predictable variances of the estimation error. This is an estimated sampling variance on the observed at-risk range, not a claim of exact finite-sample unbiasedness after the risk set becomes empty. For multiple events at an event time the usual extension replaces the numerator 1 by the event count.
In the no-simultaneous-event infinitesimal representation, the event increment is binary, so . Its second moment equals its first moment:
This uses the assumed binary increment. In an ordinary finite interval more than one event is possible, and the equality would not hold exactly; the no-ties counting-process calculation concerns the first-order infinitesimal terms.
The history contains the information observed strictly before : baseline characteristics, previous events and censoring, and therefore which individuals are currently eligible and under observation. Formally it is the pre- information in the relevant filtration. The at-risk process is 1 if individual is observed and event-free immediately before , and 0 otherwise. Let and write for the cumulative hazard increment.
The counting-process intensity in survival analysis gives
The common conditional hazard function is assumed to remain applicable after conditioning on the observed history, as under suitable independent censoring. Summing gives the conditional mean of the total event increment:
On times with , invert this relation to estimate the hazard increment:
The last sum is for untied events. This is the Nelson–Aalen estimator; for ties replace 1 by the number of events at that time. No increment can be estimated once the risk set is empty.
The expected values of early and late new diagnosis counts at step are
Each summand in corresponds to an infection that avoids early diagnosis, enters the non-early state one step later, remains there for the intervening steps and is then diagnosed. Define for , and take an empty sum as zero. The early share of diagnosis intensity is
It is defined only when ; in particular there are no diagnoses at step 1 under the initial condition. With infection counts following a Poisson distribution and independent marking, early and late diagnosis counts in a fixed interval are independent Poisson random variables. Conditional on a positive total, the early count has a binomial distribution given the total with probability , so this ratio also equals the expectation of the observed early fraction conditional on a nonzero total. Without that conditioning a sample fraction at zero diagnoses is undefined.
Use one transition per time step in the printed discrete-time multi-state diagnosis model. Put , , and . Let be the new infection count. Let be the undiagnosed non-early count present in state 3 at step , including those retained by its self-loop. Start with .
For the realised random variables, define conditionally
using independent individual transition choices, and set
The early split's two complementary counts are not independent conditional on , nor are the late split's two counts conditional on . Random state incidences must not be equated to their expectations.
Explicitly, the first four realised vectors are
Here and have the conditional laws just given; . The corresponding expressions solely in terms of the parameters are the mean flow vectors. Writing and interpreting state 3 with its self-loop as , they are
These follow from . They make the minimum one-step early delay and two-step late delay explicit. If “entering state 3” is reserved for first entry only, its incidence is with mean ; is then a separate occupancy variable. The late-diagnosis expressions are unchanged. This distinction resolves the wording's use of incidence alongside a state-3 self-loop.
With the onset means defined by the discrete back-calculation of infection incidence, the independent Poisson observation model yields the product likelihood
For positive means its log-likelihood is . A zero mean assigns probability one to a zero count and zero to a positive count. Any unknown pre-observation infection history must be parameterised or supplied as well; it cannot silently be excluded merely because the observation series starts at .
For the stated scale-parameterisation of the Weibull distribution, its incubation survivor function is for , with . The continuous back-calculation of infection incidence equation becomes
Set before the infection process's start if one is specified. For the equal-width endpoint approximation, integrate the incubation density over each delay bin:
Thus the discrete Weibull equation is
For unequal intervals replace by . These are probabilities, not point evaluations of a density; no additional factor of is needed after bin integration.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact