Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 44 5 a by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 44 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The log-rank test compares event counts with their conditional expectations under equal group hazard functions, using the individuals currently in each risk set. Assume the usual independent censoring conditions and independent strata. At pooled event time , let be the group numbers at risk, , and let be the event counts with total . Under the null hypothesis, conditioning on the risk counts and total events gives the hypergeometric distributionThus the null expected A count and its conditional variance areWhen there is only one person at risk, the event allocation is deterministic and its variance is zero. The unstandardized log-rank statistic is , with variance estimate . Under standard large-sample conditions, is approximately standard normal under the null; the test detects systematic group differences in event rates. It is particularly effective for proportional-hazards alternatives, while crossing effects can cancel in the score.
For a stratified log-rank statistic, construct these risk sets and observed-minus-expected differences separately within each stratum , then sum:This allows different baseline hazard functions between strata and avoids comparing an event with individuals in another stratum. The null is equal A and B hazards within each stratum, together with a censoring mechanism that does not invalidate the within-risk-set comparison.
In a paired stratum, both individuals initially form the risk set. A first event while both are still observed gives one nontrivial event allocation. After either individual leaves, every subsequent event is certain to belong to the only remaining group and has observed count equal to expected count. Therefore each pair supplies at most one informative table. A pair supplies none if the first exit is censoring before either observed event, if neither has an event during their joint follow-up, or if both fail simultaneously so that the tied event allocation is fixed. An event-censoring tie needs a specified convention; with events processed before same-time censoring, the other individual remains at risk for that event and the pair is informative. The untied continuous-time case avoids this ambiguity.
If A has the informative first event, the table at that time isThe phrase in the second column refers only to this event time; it does not mean that B can never fail. The expected A count is , so this table contributes to , with variance . An informative B-first pair contributes . All other tables contribute zero. Therefore the requested unnormalized score isA positive score means more observed early events on A. There is no need to standardize it to answer the question.
To obtain an exact conditional law, put . Under the within-pair equal-hazard null, conditional on an event while both are at risk, either subject supplies it with probability . Equivalently, before the pair's first exit, the cause-specific event intensities for A and B are equal; integration over the common period of joint observation gives equal probabilities for the two informative outcomes. This argument requires noninformative observation of the failure process, not just equality of unadjusted marginal survival curves. Different independent pairs then have independent fair signs when informative. Conditioning on the set of informative pairs gives independent Bernoulli outcomes with probability ; conditioning only on their count mixes identical binomial laws and gives the same result:This proves the paired log-rank reduction to a sign test. The conditional mass function is , , so an exact two-sided p-value sums the masses for with . If , there is no information for a treatment comparison. Failure-time distances beyond their ordering play no role in this paired score.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 44 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A frailty model represents unobserved individual heterogeneity by a random effect in the hazard function. In a proportional frailty model, an individual with frailty random variable has hazard . The normalization identifies the scale of the baseline hazard: without it, multiplying all frailties by a constant and dividing by that constant would leave all individual hazards unchanged.
Let . Conditional survival follows by integrating the hazard function:Taking the expectation over the frailty law yieldsThis is the Laplace transform of the frailty density evaluated at the cumulative hazard. More generally, the same calculation integrates against a probability measure, allowing atoms. It averages conditional survival rather than substituting into its exponent. Indeed, the frailty distribution among survivors is proportional to , giving population hazardSurvival progressively selects smaller frailties, so the population hazard need not be the baseline or even retain the individual's proportional structure.
For the cure model, first take . The necessary mean-one frailty law and baseline hazard areThen . A cured person's conditional hazard is zero, while a susceptible person's conditional hazard is . Taking to be zero or one while leaving would instead have mean frailty and violate the required normalization.
The frailty law is the measurewhere the terms are Dirac measures. This is not an ordinary Lebesgue density; the cure construction requires permitting a discrete frailty law. Its Laplace transform isWriting , we have , and thereforeIf , the susceptible class eventually experiences the event and . If , the limiting survival is larger than because some susceptible subjects also never experience the event. At , everyone is cured: set and, for example, to retain mean one, giving without using the singular formula .
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





