Topics (318k) Articles (329k) Users (384) Discussions (237) Comments (383) Files (10k) New article
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 39 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Linkage disequilibrium means that alleles at different genetic loci are associated in population haplotypes. For two biallelic loci,The first quantity measures departure from independent allele frequencies; the second is the squared allelic correlation. Standardized linkage disequilibrium instead compares to its possible range at the given frequencies. High can coexist with low , so it need not make one genetic marker a good predictor of another. Genetic linkage is a different notion: it describes within-family transmission and the recombination fraction.
The chromosome-21 study of Patil and colleagues, Science 2001 found consecutive single-nucleotide polymorphisms organized into regions with comparatively few common haplotypes; typically three haplotypes accounted for over 80% of the sampled chromosomes within a block. Such haplotype blocks can be represented efficiently by tag SNPs. Strong association within blocks and weaker association across boundaries give a useful description, though block boundaries depend on allele frequencies, population history, sampling and the operational definition of a block. They do not divide chromosomes into regions where genetic recombination is respectively impossible and certain.
The ancestry explanation uses an ancestral recombination graph. Going backwards, ancestral lineages coalesce, while a genetic recombination event splits one lineage's ancestral material into contributions from two parents. At a fixed genomic position, retaining only its ancestry gives a phylogenetic tree with the appropriate coalescent law. Nearby positions often retain much of the same tree; mutations on shared branches then produce correlated allele states. Breakpoints can change the local tree, weakening that shared history.
Under a simple random-mating two-locus model, linkage-disequilibrium decay under recombination gives . Actual populations also undergo genetic drift, population bottlenecks, mutation and migration, which can create or preserve association. Recombination rates themselves vary along chromosomes: McVean and colleagues, Science 2004 inferred strong local variation from sequence data. These observations motivate an ancestry model with spatially varying recombination, rather than treating physical distance as the only determinant of linkage disequilibrium.
For fine mapping, a typed genetic marker can show genetic association because it is correlated with a nearby causal genetic variant. Linkage-disequilibrium marker tagging makes a sparse first-stage scan possible, but several variants in one block can produce nearly indistinguishable association patterns. Historical recombination and diverse local genealogies can narrow the interval when denser genotyping is available.
An ancestral recombination graph turns that intuition into a likelihood calculation. One can place a proposed disease-origin event on a local ancestral branch and integrate over possible graphs, mutation histories and unobserved haplotypes. The local phylogenetic tree then relates disease-bearing chromosomes and predicts which markers should remain associated. In a Bayesian inference, uncertainty in ancestry, mutation location and demographic parameters enters the posterior distribution rather than being replaced by one guessed tree. Whole-graph inference is computationally demanding, and approximate or pairwise methods often supply practical estimates.
The useful distinction is between finding an associated region and identifying its causal variant. Strong linkage disequilibrium improves marker coverage but can limit resolution inside the associated region. Population stratification, ascertainment, rare variants and misspecified population history can also mislead an association analysis. Combining fine mapping with independent biological evidence is therefore stronger than interpreting an association peak as proof of causation.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 38 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For subject , write , and define the counting process and pre-event at-risk process byUnder independent censoring and a common hazard, each observed event-free subject has conditional event probability in a short interval. Therefore to first order. Equivalently the compensator of a counting process is . Dividing the observed increments by current exposure gives the estimating equation , henceHere are distinct event times, the number of events at that time, and the number at risk immediately before it. One can also obtain the same increment by maximizing the local multiplicative-intensity likelihood : differentiation gives . This derives the Nelson–Aalen estimator, rather than merely naming it.
A censored observation contributes to the denominator while under observation, and then leaves the risk set; it contributes no event jump. For tied events, use the single increment , not successive one-event increments with shrinking denominators. If censoring and events share a recorded time, a convention is needed; counting the event before removing same-time censored subjects uses the pre-time risk set above. Rounded or interval-censored data may require a model suited to their observation mechanism.
For the distinct ordered observations in the question, let indicate whether is an event. The risk set at contains precisely the subjects whose recorded time is at least . ThusTherefore the sum of the fitted integrated hazards at all observation times equals the observed number of events, the event-count identity for Nelson–Aalen cumulative hazards. The grouped Nelson–Aalen event-count identity extends the same argument to tied observations with their multiplicities and the stated risk-set convention.
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





