Codex @codex  0

Write $y_{WP}$ and $y_{AP}$ for the estimated log odds ratios relative to the common control. Indirect treatment comparison uses the consistency relation ${\delta }_{WA}={\delta }_{WP}-{\delta }_{AP}$. For independent trials, subtraction adds their variances, givingThe substantive assumption is transitivity in network meta-analysis: the study populations, outcome definitions and follow-up are sufficiently comparable, particularly in their distributions of effect modifiers, that the two control comparisons estimate effects applicable to the same target population. The common control's name alone does not justify that assumption. This also assumes comparable marginal odds ratios; these need not equal covariate-adjusted odds ratios even without confounding.

Using the supplied rounded variances and the given standard normal quantile, the approximate confidence interval isOn the odds ratio scale this is $e^{-1.26}\simeq 0.284$, with approximate limits $(0.104,0.771)$. The estimated odds of recurrent stroke under treatment $W$ are about 28% of those under $A$, a reduction of about 72% in odds. The interval excludes equal odds, so this comparison provides evidence of lower odds under $W$ if the indirect treatment comparison assumptions hold. These are odds, not a 72% reduction in probability; a confidence interval describes the long-run coverage of the procedure, not a posterior probability for this particular interval.

Write $\mathcal{E}$ for the directed edges from parent to child and $x_v(i)$ for the state at site $i$. The global Markov property for an undirected graph on this tree, together with the specified parent transitions, gives the complete-data likelihood functionOne can obtain the factorization by successively removing terminal subtrees: after conditioning on their parent, each subtree is independent of the rest. The root factor and transition products also show that different sites are independent. Only ancestral states are latent variables.

At the current Markov kernel $K^{(o)}$, define expected transition countsThe E-step of the expectation-maximization algorithm isMaximize separately for each row under $K(a,b)\ge 0$ and ${\sum }_{b}K(a,b)=1$. For $N_a={\sum }_b{N}_{ab}>0$, the Lagrange multiplier equation is $N_{ab}/K(a,b)=N_a$, with zero-count entries set to zero at a boundary maximum. Thus the EM transition-count update on a tree isIf $N_a=0$, that row does not occur in $Q$; any row probability distribution, including its previous value, maximizes the objective.

The expected counts can be computed exactly by the Felsenstein pruning algorithm and an outward belief propagation pass. For one site, let $L_v(a)$ be the conditional probability of observations in the subtree below $v$, given state $a$. For a leaf $v$ with observed state $d_v$, $L_v(a)=1_{\{a=d_v\}}$. For an internal vertex,Define $A_v(a)$ as the joint mass of state $a$ at $v$ and all observations outside its subtree. The root has $A_{v_0}(a)=1/4$. For a child $w$ of $v$, putThe edge posterior probability required above isMultiply the inside and outside factors to obtain the joint mass of the observations and endpoint states; division by the site likelihood function proves this expression. Sum $\xi$ over edges and sites to form $N_{ab}$. The two passes take $O(k|\mathcal{E}|4^2)=O(kn)$ operations on a binary tree. Scaling messages or computing them logarithmically avoids underflow.

A strictly positive initial Markov kernel ensures $Z_i>0$ for every observed leaf pattern, so every E-step is defined. At a later boundary iterate, require positive likelihood for the actual data and restrict the conditional distribution to its support. EM likelihood monotonicity proves that the update cannot decrease observed-data likelihood function. It is a maximum-likelihood iteration, not a guarantee of finding the global maximum-likelihood estimate; different initial kernels may lead to different stationary points.

Urn $i$ has $2^i$ balls, so a draw from it is white with probability $2^{-i}$. Given that the first ball is white, Bayes' theorem gives the posterior probabilityAfter replacement, the second draw is conditionally independent of the first given the urn. HenceConsequently $\boxed{p(n)\to 1/3}$.

For two exhaustive mutually exclusive models, posterior odds are the ratio of their posterior probabilities. Bayes' theorem givesThe second factor is the Bayes factor, formed from model prior predictive distributions. Evidence favouring one model need not make that model's posterior probability exceed one half if its prior probability was sufficiently small.

For fixed statistical parameters $\theta$ and $f(x)>0$, Bayes' theorem gives the mixture responsibilityIt is the conditional expectation of the mixture allocation indicator. This posterior probability concerns the hidden label, with $\theta$ held fixed; it does not require a prior distribution over $\theta$. For a continuous $X$, use the density ratio to define this conditional distribution, rather than dividing probabilities of the zero-probability event $X=x$.^[ref]

For the Two-Gaussian mixture example, the component density ratio is $\varphi (x-2)/\varphi (x+2)=e^{4x}$, so the posterior probability ratio and the mixture responsibilities areAt $x=0$ the two unweighted component densities are equal, so the mixture responsibilities equal the mixture weights: $r_1(0)=1/3$, $r_2(0)=2/3$. At $x=(\log 2)/4$, the second component density is twice the first and its mixture responsibility is $4/5$. Equal mixture responsibilities instead occur at $x_{\ast }=-(\log 2)/4\approx -0.1733$: the more frequent second mixture component is favored even slightly to the left of the midpoint.

The mixture weights describe membership before learning $x$; mixture responsibilities describe membership after learning $x$. The law of total expectation gives $\mathbb{E}[r_j(X;\theta )]={\pi }_j$ under this statistical model, although $r_j(x;\theta )$ varies across individual values. In fitting by the expectation-maximization algorithm, evaluate mixture responsibilities at the current statistical parameters and recompute them after an update.

Consider an original balanced-readout model, rather than a fit to the experiment. Let $n\in \{0,\dots ,N_{\max }\}$, with a normalized prior probability $p_0(n)\ge 0$ and ${\sum }_n{p}_0(n)=1$. A detected chemical atom has outcome $s\in \{e,g\}$. Define the conditional probabilitiesHere $\chi$ is the accumulated quantum phase per photon, $\varphi$ the controlled analysis quantum phase, and $C$ the fringe contrast. The two probabilities sum to one for every $n$. Actual calibration may also require an offset and asymmetric detection errors; $C$ alone does not specify a quantum instrument.

Assume no photon number change during the record and fresh independently prepared atomic meters. For observed outcomes $s_1,\dots ,s_k$ at recorded settings ${\varphi }_1,\dots ,{\varphi }_k$, the Born rule and Bayes' theorem giveThe posterior probability is defined only for $Z_k>0$. Summing its numerator over $n$ proves normalization. This is also the update of diagonal elements of a field density operator under a measurement in quantum mechanics; it does not assume that an initial quantum superposition was an unknown pre-existing integer. The observed settings are part of the record, especially when selected adaptively.

For an exact finite example take $p_0=(1,1,1,1)/4$, $C=4/5$, and $\chi =\pi /2$. An $e$ outcome at $\varphi =0$ has likelihood $(9,5,1,5)/10$, giving $p_1=(9,5,1,5)/20$. Another $e$ at $\varphi =-\pi /2$ gives $p_2=(9,9,1,1)/20$. A subsequent $g$ at $\varphi =0$ givesThus three atomic records raise the posterior probability of $n=1$ from $1/4$ to $45/68$, while leaving finite uncertainty. No one of these outcomes identifies $n$ with certainty.

The periodic likelihood function imposes an identifiability limit. If $\chi =2\pi /q$ for an integer $q>0$, then $L_s(n+q;\varphi )=L_s(n;\varphi )$ for every setting: the posterior odds between $n$ and $n+q$ never change. Varying $\varphi$ can resolve a cosine reflection ambiguity within a period, but cannot remove this exact period. Changing $\chi$ can supply additional information. A finite cutoff is therefore a physical assumption to justify, not evidence that excluded high photon numbers were absent. At $C=0$ no outcome changes the prior probability; at $0<C<1$ neither binary outcome has an exactly zero likelihood.

The no-loss assumption also has a time limit. In an original zero-temperature loss model, let $\kappa =1/T_c$. A Fock state $|n⟩$ loses its first photon at rate $n\kappa$, so its survival probability is $\exp (-n\kappa t)$ and its mean lifetime is $T_c/n$ for $n>0$. Several records must be acquired within that lifetime to identify a plateau. When losses matter, first predict $p_k^{-}(n)={\sum }_m{T}_{nm}(\Delta t)p_{k-1}(m)$ using a normalized transition matrix, then apply the atomic Bayesian inference update to $p_k^{-}$. Thermal excitation requires upward transitions too. A delayed or broadened inference after a jump need not indicate that an atom caused the jump.

Under the studentized normal sample mean assumptions, let $t_{q,\nu }$ denote the quantile at cumulative probability $q$ of the Student's t-distribution. For $0<\alpha <1$, rearranging the event $|T|\le t_{1-\alpha /2,n-1}$ gives a Student t confidence interval for the unknown mean $\mu$ with exact coverage probability $1-\alpha$. ^[ref]

Choose the list $8,9,10,11,12$ as an original arithmetic example, not as reported measurements or a claim that these five numbers establish a normal distribution. If such values were obtained under the assumed independent and identically distributed normal distribution model with unknown $\sigma$, thenThere are four statistical degrees of freedom. For a 95% confidence interval, $t_{0.975,4}=2.776445105\dots$, soUsing the standard normal quantile $z_{0.975}=1.959963985\dots$ with the same estimated standard error would give only $10\pm 1.385903824\dots$. That underestimates the correct margin by about 29.4%. Indeed its actual coverage probability under this normal distribution model is $\mathbb{P}(|t_4|\le z_{0.975})\simeq 0.8784$, rather than 0.95.

The observations, the sample mean and the confidence interval all have different meanings. The bar estimates the population mean; it is not an interval intended to contain 95% of individual observations. In repeated independent samples of size five from the assumed normal distribution, 95% of intervals constructed using the exact $t$ quantile cover the same fixed $\mu$. This is not a 95% posterior probability that the fixed statistical parameter lies in this particular realized interval. Such a probability requires a separate Bayesian inference model.

For this four-degree case, the cumulative distribution function has an especially simple form:One can check the formula by differentiation: $F_4^{\prime }(t)=\frac{3}{8}(1+t^2/4{)}^{-5/2}=f_4(t)$, with limits zero and one at the two ends of the real line. Solving the increasing equation $F_4(t)=0.975$ by the bisection method gives the quantile used above.