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 2017 iii Paper 207 3 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a treated patient the recovery transition intensity is per year. A symptoms spell is a holding time with an exponential distribution of rate , soThe treatment multiplier for onset affects how often symptoms begin, not the duration of a spell once the patient is in state 2, under this homogeneous continuous-time Markov chain.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Visits can be missed or rescheduled because of illness, clinic availability or patient choice; follow-up may end through dropout or right censoring. The correct panel-observed multi-state likelihood uses each observed interval length :Thus the four aggregated one-year counts are generally no longer sufficient; records must retain actual durations. Numerical maximum likelihood estimation uses the corresponding transition probabilities, or a matrix exponential of the generator when a larger model is fitted. One must not treat a two-year interval as a single one-year transition or as two known transitions through an unobserved intermediate state.
This conditional calculation is valid when visit scheduling and loss to follow-up are ignorable given the modeled information. If symptomatic patients are systematically examined earlier or leave the study differently, observation itself may be informative; the visit or dropout process may require a joint statistical model. Simply replacing one year by the actual interval does not correct informative observation.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Set , and . With equal positive rates, the one-year probability of a change is , so the conditional likelihood function is proportional toFor , its unrestricted binomial maximizer is . A finite interior positive-rate maximum exists exactly when , orIndeed the binomial log-likelihood is strictly concave at this interior maximum and is strictly increasing. If and , the likelihood increases towards its supremum as , requiring ; no finite maximum exists. Equality also has only this limiting maximum.
If , allowing the boundary gives a finite maximum there; insisting on gives only a supremum as . Thus if “valid” includes zero rates, the condition is with ; if rates must be strictly positive, it is . If , every rate has the same empty-data likelihood and the statistical parameter is not identifiable. These boundary qualifications prevent a negative or infinite plug-in rate from being called a valid interior estimate.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Condition on each patient's initial observed state and assume independent patient trajectories and observation times that do not carry additional information about the unobserved path. The Markov property factors each trajectory's likelihood function into its successive one-year transition probabilities. ThusMore explicitly, with and ,Successive transitions within one patient need not be independent unconditionally: this is a product of conditional factors justified by the Markov property. If initial-state probabilities are modeled rather than conditioned on, their likelihood contributions must also be included. Zero-count terms contribute zero; a positive count attached to a zero model probability makes the log-likelihood equal to .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 a iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Dividing the expected occupation time of a continuous-time Markov chain by and letting givesFor this is also the almost-sure long-run time fraction, not just the limit of an expectation. The two-state continuous-time Markov chain is irreducible and positive recurrent. Alternatively, a regeneration cycle consists of a mean symptom-free holding time followed by a mean symptomatic holding time; the renewal-reward theorem gives . This agrees with the stationary distribution solving and .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let be the occupation time of a continuous-time Markov chain in the symptoms state. Tonelli theorem permits exchanging the nonnegative integral and expectation. Starting from state 1, put . ThensoFor small the answer is , as expected when onset must first occur. It is between zero and . If , no transition can occur and the answer is zero; the displayed quotient is interpreted separately in that degenerate case.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 3 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The first departure from the no-symptoms state has an exponential distribution with rate . Spending the entire interval there means no departure at all, soThis is the holding time survival probability. The transition probability only says that the patient is symptom-free at the endpoint, allowing an onset and recovery in between, and is therefore not the answer. The formula also covers , when state 1 is absorbing.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let contain independent complete observations of the -dimensional vector, and let be a directed acyclic graph. A Gaussian Bayesian network uses, for node ,Here is an intercept, the vector of parent coefficients, and the conditional variance; the vector collects these statistical parameters. Its likelihood function factors asChoose a proper statistical parameter prior distribution and a graph prior distribution . Bayes' theorem gives the Bayesian network structure score, up to the normalization common to graphs,The integral is Bayesian model evidence: it averages over nuisance parameters rather than substituting their best-fitting values. A graph prior can favor sparse graphs, while the evidence balances fit against the amount of prior statistical parameter space that predicts the observations well. Compare these scores over admissible directed acyclic graphs, using enumeration when feasible or a search procedure otherwise; search need not find a global maximum, and observational data need not identify a unique causal orientation.
A conjugate prior makes the integral analytic. For example, for take , , where is positive-definite matrix and ; these are independent local normal-inverse-gamma priors. Under prior independence between nodes, the evidence is a product of local regression evidences. Each posterior has the same family, so the local integral is the ratio of prior and posterior normalization constants, with the likelihood's constants included. This avoids costly numerical integration and makes local graph updates inexpensive. Hyperparameters must be specified coherently if score equivalence between observationally equivalent graphs is desired; arbitrary local priors do not automatically have that property.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The original PDF shows the chain , not a collider. Its Bayesian network factorization is . For any with positive marginal probability,Integrating or summing over also gives the same conditional marginal . ThusThis is conditional independence; the graph does not generally imply marginal independence, since summing over can transmit dependence from to . Special statistical parameter choices can make marginal independence hold as well, so the claim is that only the conditional statement is guaranteed by the graph. Conditional distributions on null values of are immaterial to this assertion.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Reading the arrows in the original diagram gives parents , and . The Bayesian network factorization isFor binary variables, each conditional probability table has one free probability per parent configuration, since its two entries sum to one. There are one each for and , four for , and two for , givingThis is the dimension of the unrestricted binary Bayesian network family; extra statistical parameter equalities or deterministic relationships would describe a smaller model and are not imposed by the diagram.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 a iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The Bonferroni correction compares every p-value with . Only the first two displayed values lie below that threshold; all undisplayed values are at least the tenth displayed value. HenceFor the Benjamini-Hochberg procedure at false discovery rate level , the rank- threshold is . The first nine displayed ranks meet their thresholds, while rank ten does not: . Consequently nine is the intended count if every later rank also fails its threshold. The rule is a step-up rule, however:It does not stop at the first failed comparison. The full rejection count is therefore not determined by ten order statistics. For example, completing the list with values equal to gives , whereas completing it with values equal to gives , since . Both completions respect the printed ten smallest p-values. Thus at least nine are rejected; exactly nine requires an extra assumption about the undisplayed ranks. In the second completion even the tenth marker is rejected, despite failing its own rank threshold. The false discovery rate guarantee also requires the usual validity and independence or appropriate positive-dependence assumptions, unlike the arbitrary-dependence Bonferroni correction.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Under the intended additional assumption of mutually independent, continuously calibrated null p-values, each test fails to reject with probability . The familywise error rate is thereforeThere is a qualification to the printed use of “not correlated”: zero pairwise correlation coefficients do not generally imply mutual independence. A multivariate normal distribution with zero off-diagonal covariances does give independence, but an arbitrary biomarker distribution need not. The formula above requires independent rejection events, not just uncorrelated measurements.
The usual intuition for positively dependent tests is that they reject together, reducing the effective number of opportunities for a false positive. A rigorous sufficient assumption is positive association of random variables for the rejection indicators . Products of their non-rejection indicators are decreasing functions; association and induction giveThus under this stronger positive-dependence assumption the probability is no larger, and perfect dependence gives instead of . Strict inequality is not forced by every form of positive dependence.
Pairwise positive correlation coefficients alone, as printed, is insufficient. For a counterexample choose a vector of ten exchangeable random variables that are rejection indicators as follows: with probabilities , respectively, reject none, reject one uniformly selected test, or reject all ten. Thenbut the familywise error rate is . This can be realized with valid null p-values: conditional on the indicators, independently draw uniformly on if and on otherwise. Every is uniform on , and . Taking biomarker statistics gives pairwise positively correlated null statistics with exactly these one-sided tests. Therefore the unconditional larger-or-smaller claim needs a specified dependence model.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 207 2 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
A Type I error is rejecting a true null hypothesis. Here it means declaring a statistical association between the biomarker and bowel cancer when, in the population and under the association model being tested, there is no statistical association. It is a false positive association finding, not merely a large estimation error. A test with level limits this probability to under the null hypothesis, subject to valid calibration; the p-value is not the probability that the null hypothesis is true.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 2 a iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
With the normalization used in the Chordal Loewner equation, half-plane-capacity parameterization meansThus is empty and the half-plane-capacity composition rule gives . The factor two produces . A convention using half-plane capacity instead changes that coefficient to one and rescales time; the convention must be kept consistent.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 2 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write and let be the relatively closed hull obtained by mapping the increment through . For a bounded compact H-hull , defineThe Loewner local growth property isOne can equivalently use diameter: for a nonempty compact H-hull, , using a point of its closure on for the second inequality. The condition concerns the mapped increment, not the original difference , which can be large when a narrow opening closes. It makes growth occur near one continuous Loewner driving function rather than by a sudden addition at separated boundary points.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 2 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
A family of compact H-hulls is non-decreasing whenThis permits equal hulls at different times. A Loewner chain with strictly increasing half-plane capacity has strict inclusion for . Usually its initial compact H-hull is .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 1 c iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Suppose . Map out and let be the relatively closed image hull corresponding to , with bounded complementary components filled if needed. Then maps onto . Uniqueness of the mapping-out function of a compact H-hull gives . Comparing their Laurent series yields the half-plane-capacity composition ruleThe Brownian representation of half-plane capacity makes the last term nonnegative, proving monotonicity of half-plane capacity:
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 1 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For , the conformal map maps onto and has Laurent series . The uniqueness in hydrodynamic normalization at infinity givesAt the scaled closure is contained in , so the interior compact H-hull is empty and both sides are zero. This is the scaling part of scaling and translation of half-plane capacity.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 203 1 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For , the conformal mapmaps onto and has hydrodynamic normalization at infinity. Its Laurent series is . Uniqueness of the mapping-out function of a compact H-hull therefore givesThis is the translation part of scaling and translation of half-plane capacity.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 201 2 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For the converse in the characterization of a martingale by stopped expectations, fix and . Define the bounded stopping timeIndeed, its only nontrivial sublevel event is . Applying the assumed stopped-expectation equality to and to the deterministic stopping time givesThis holds for every . Since is adapted and both variables are integrable, the defining test-event property of conditional expectation yieldsTogether with the given adaptation and integrability, this is exactly the martingale property.
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





