Suppose one observation comes from either or , each with prior probability . A decision rule that chooses on an event and otherwise has success probability
On a finite set, choosing therefore gives . This is the equal-prior version of minimum sum of errors in a simple hypothesis test; allowing a statistical test to use an auxiliary random variable cannot improve it, because for each outcome the better of the two decisions already maximizes its contribution.
For the four-outcome example, choose after and after or , with either decision allowed after . Choosing after yields . The best success probability is 65%, with a 35% error probability. A smaller total variation distance means the two sources are harder to distinguish from one observation. Unequal prior probabilities, unequal costs, or multiple observations change this particular decision problem; the figure is not a universal bound for every experiment.
Tournament won by two consecutive victories Created 2026-10-06 Updated 2026-11-05
With three evenly matched players, the previous winner plays the previous spectator. A pair of successive distinct winners moves to or with equal probabilities, where is the remaining player. The transient states form two directed 3-cycles and each step has absorption Probability one half. Starting with a game between two specified players, their overall winning probabilities are each , while the original spectator wins with Probability .
Trace distance Created 2026-09-24 Updated 2026-10-14
How different can two preparations look to someone who can perform any measurement in quantum mechanics? The trace distance answers this question for density operators on the same finite-dimensional vector space:
Here is the absolute value of an operator, and is its trace norm. Because is Hermitian, its trace norm is the sum of the absolute values of its eigenvalues; it is not the sum of the absolute values of its matrix entries. The factor gives
The trace distance is a metric: it is symmetric, vanishes exactly when , and obeys the triangle inequality. Identical preparations have trace distance zero; preparations with orthogonal occupied eigenspaces have trace distance one and can be identified perfectly in a single measurement in quantum mechanics.
Operationally, the trace distance is the largest total variation distance between the outcome probability distributions obtainable by a POVM. Equivalently, the variational characterization of trace distance says it is the largest possible probability gap for one event in a binary measurement in quantum mechanics. For one copy of either known preparation, each chosen with prior probability , the Holevo–Helstrom theorem gives
Thus trace distance zero leaves only guessing, while trace distance one permits perfect quantum state discrimination. The optimum ranges over measurements; different measurement bases can expose different amounts of distinguishability. [ref]
For a worked example with commuting density operators, take a qubit with
Their difference has eigenvalues , so . Measuring in the computational basis produces outcome probability distributions and , whose total variation distance is also . Guessing on outcome zero and on outcome one succeeds with probability . A projective measurement in the Hadamard basis instead produces for both preparations and gives no discrimination advantage.
The trace-distance contraction under quantum channels ensures that a common quantum channel, including the partial trace, cannot increase the trace distance. This makes trace distance a useful error measure: if , every event in every measurement in quantum mechanics has a probability gap at most . Losing access to a subsystem can hide distinguishability, but cannot create more of it.
To minimize over models with different parameter dimensions, sample from a target proportional to and cool . A dimension-matching proposal augments the smaller model by auxiliary variables, transforms them bijectively into the larger parameter vector, and includes the proposal probability density function and absolute Jacobian determinant in the Metropolis–Hastings acceptance probability. For a positive Poisson mean and normal parameters , one convenient transformation is
Its absolute Jacobian determinant is one. If the forward and reverse model-jump selection probabilities are and , the Poisson-to-normal ratio is
The reverse ratio is its reciprocal at the inverse map. This enforces detailed balance. When the target is proper and the annealing chain explores it adequately, the low-temperature laws concentrate on the minimum Akaike information criterion, rather than the maximum marginal model evidence. Likelihoods compared across models must describe the same observed data with a compatible reference measure.
Transfer-current theorem Created 2026-09-28 Updated 2026-11-05
In a finite connected graph with unit electrical resistance on each edge, choose distinct undirected edges and orient each once. Define the transfer current as the signed electric current through when one unit of electric current enters the tail of and leaves its head. For a uniform spanning tree ,
Reversing one orientation negates its row and column, leaving the determinant unchanged. Distinctness is necessary: repeating an edge repeats a row and gives zero, although its inclusion can have positive probability.
Electrical reciprocity makes symmetric. The two-edge case therefore gives
Thus edge inclusions are negatively correlated.[ref] The positive-weight version uses the corresponding conductance-normalized transfer current. Every extendable finite forest has positive inclusion probability, since at least one positively weighted spanning tree contains it.
Transience of Brownian motion in dimension at least three Created 2026-09-24 Updated 2026-11-05
Standard Brownian motion in is transient for : almost surely. In dimension three, start away from zero and use the positive local martingale . It is a supermartingale, hence converges to a finite limit. Brownian scaling and the normal distribution of show that in probability, so its almost-sure limit must be zero. Thus .
For a start at zero, apply the same argument from any positive deterministic time; the position there is nonzero almost surely. In higher dimensions, project onto three coordinates: the full radius dominates a radius already tending to infinity. This differs from recurrence of planar Brownian motion, where every neighbourhood is visited repeatedly.
Transient Markov chain Created 2026-10-31 Updated 2026-11-05
An irreducible Markov chain is transient when its states are transient states. Starting at any one state, there is a positive Probability of never returning, and the number of visits to any fixed state is finite almost surely.
Transient state Created 2026-09-24 Updated 2026-11-05
A state is transient when its Probability of ever returning is less than one.
This is the alternative to a recurrent state for the return behavior of a Markov chain.
Transition probability for a rotated two-level observable Created 2026-10-31 Updated 2026-11-05
Let orthonormal energy eigenvectors be , and let a measured observable have eigenvectors and . If the initial quantum state is , unitary time evolution multiplies each energy component by . Its amplitude in is . The Born rule gives the displayed probability. The energy gap fixes the oscillation frequency, while the angle between the measurement and energy bases fixes its amplitude. Energy degeneracy or coinciding bases makes the transition probability vanish.
Translational and two-level energy variance Created 2026-10-20 Updated 2026-10-24
For a dilute classical ideal gas whose atoms carry independent nondegenerate internal levels , the canonical partition function factorizes into translation and . The upper-level probability is . Taking two derivatives of its logarithm gives the title sum of independent variances. The internal contribution freezes exponentially at low temperature and tends to at high temperature. The translational classical result cannot be continued through quantum degeneracy without changing the model.
Translation ergodicity of Bernoulli percolation Created 2026-10-05 Updated 2026-11-05
The independent edge law of bond percolation on is ergodic under lattice translations: every translation-invariant event has probability zero or one.
Transmission disequilibrium test Created 2026-10-13 Updated 2026-11-05
For affected offspring and heterozygous parents at a diallelic locus, let count transmissions of allele 1 with allele 2 untransmitted and count the reverse. Under the fair-transmission null, conditional on , is binomial with probability . The asymptotic statistic is , with a one-degree-of-freedom chi-squared null distribution. Homozygous-parent transmissions give no contrast. Conditioning within families protects this test from ordinary population stratification.
Transverse electronic mode Created 2026-10-20 Updated 2026-11-05
A transverse confinement eigenstate that defines a threshold for propagation along a narrow conductor. Above that threshold, its longitudinal dispersion supplies an incident channel from each reservoir. spin can label separate channels; an unresolved spin-degenerate mode contributes twice the single-spin spin-resolved conductance quantum. This physical use of mode is unrelated to the most probable value of a probability distribution.
For an original illustrative readout model, take detected photon count in a fixed exposure to have a Poisson distribution, with stipulated means for a bright state and for a dark state. Classify as bright. Direct summation gives
With equally likely preparations, the average misclassification probability is . These numbers describe only the chosen count model. Actual fluorescence includes short-time photon correlations, detector effects and possible state changes; it need not follow a fixed-rate Poisson process. Longer exposure can improve separation of count distributions while increasing unwanted optical pumping, metastable decay or recoil.
If the prepared bright population is , let and denote the two conditional errors above. The observed bright-label probability is , hence when the denominator is nonzero. Known-state controls must estimate in the actual apparatus; the formula cannot correct unknown drift. For independent preparations, the raw bright fraction has variance . Counting uncertainty, preparation error, pulse error and state-detection bias therefore enter different parts of the inference. Repeating a biased measurement reduces its sampling uncertainty without removing its bias.
Trapped-ion sideband pulse model Created 2026-10-18 Updated 2026-10-20
Consider an original ideal calculation with no heating, decoherence, detuning or spectator modes. In the ordered basis for , the red motional sideband has . Here is the Pauli matrix exchanging the two basis states. Since , its unitary time evolution is
Thus , and excitation from has probability . For it vanishes. The blue motional sideband similarly gives . A red Rabi pi pulse calibrated for has ; it is not a Rabi pi pulse for every occupied .
Choose , and . The red Rabi pi pulse lasts . Let motion have the Boltzmann distribution of a quantum harmonic oscillator, with chosen mean occupation :
Here , and . Reindex the red sum using and : for equal resonant pulse parameters, even outside the short-pulse limit. At times with , the ratio therefore gives . A nonthermal distribution, unequal drive strengths, detuning or state-detection bias can invalidate that thermometer. Ground-state population cannot generally be deduced from the mean alone without specifying the distribution.
Figure 1.
Chosen thermal motion and ideal red/blue sideband pulse responses
. Original calculation with stipulated parameters, not experimental data. Both responses average the same initial thermal number-state distribution. The vertical line marks a red pi pulse for the component; a thermal mixture has no single common pi-pulse time. Details.
The chosen pulse gives and . These are internal excitation probabilities, not quantum gate fidelities or cooling-cycle efficiencies. An independent matrix exponentiation of each two-state block agrees with the sine formula and preserves normalization. Summing omits probability ; because every sine squared lies between zero and one, this also bounds each omitted response. The thermal relation supplies a separate dimensional check:
Here is the Boltzmann constant. Substitution recovers ; the thermal root-mean-square expansion parameter is . This checks the populated part of the Lamb-Dicke regime, while exponentially rare large still exceed any fixed small-parameter criterion. The pulse is a leading-order model; it does not bound corrections from the full coupling or experimental noise.
Tree-graph moment bound for a percolation cluster Created 2026-10-14 Updated 2026-11-05
For translation-invariant independent bond percolation with finite percolation susceptibility , the BK inequality gives for , with . Prune a connecting open tree for the labelled vertices, suppress unmarked degree-two vertices, and split higher branching into binary branching with zero-length connections. There are binary tree topologies and connections. The connections have disjoint bond witnesses, so the BK inequality bounds their joint probability by a product of two-point connection probabilities. Summing successive leaves contributes for each connection. Since , this proves for . Finite percolation susceptibility therefore gives an exponential cluster-volume tail.
A trifurcation graph vertex is a graph vertex of an infinite percolation cluster whose deletion separates that cluster into at least three infinite connected components of a graph. In a finite modification argument one may make it have exactly three open incident edges leading to three different infinite components. On a translation-invariant lattice, a positive probability of trifurcation at one graph vertex gives a positive expected density of trifurcations.
Trimmed mean Created 2026-09-28 Updated 2026-11-05
For , an -trimmed mean sorts observations, removes the smallest and largest , and averages the remaining values. It limits the effect of a small number of extreme observations while still averaging a central portion of the data.
For and , removing and gives trimmed mean , compared with sample mean . Replacing by a larger value leaves this trimmed mean unchanged. Replacing enough observations can still move the retained central values arbitrarily far.
For a probability distribution with quantile function , the population statistical functional is
The normalizing denominator is the retained fraction of probability. At a regular symmetric reference probability distribution, the influence function of a trimmed mean is a clipped version of the observation, scaled by this fraction. Centering and symmetry assumptions matter when using that simpler expression.
Triweight kernel Created 2026-10-14 Updated 2026-11-05
The triweight kernel is a compactly supported symmetric probability density with variance . Its value and first two derivatives vanish at the support endpoints. Its integrated squared second derivative is , and it minimizes that curvature among twice continuously differentiable densities with zero mean and the same variance, by the triweight density minimizes integrated squared curvature inequality.
Truncated distribution Created 2026-09-24 Updated 2026-11-05
A truncated distribution is the conditional probability distribution obtained by restricting a random variable to a specified event with positive probability. If its original law is , the truncated law is
The denominator renormalizes the retained probability mass to one. If has a probability density function , the truncated density is ; the same restriction and normalization apply to a probability mass function.
For example, truncate a uniform distribution on to values at least six. The retained event has probability , so the new density is on , and its mean is eight. This is the law obtained by repeatedly sampling from the original law and rejecting values outside the retained set; rejection sampling becomes inefficient when the retained event is rare.
A zero-probability restriction cannot be normalized by the displayed formula. Conditioning a continuous random variable to equal a specified value requires an additional conditional-law construction or limiting convention, rather than division by zero.