Thermal reduction of a two-mode squeezed vacuum Created 2026-10-20 Updated 2026-10-25
Tracing out one mode leaves geometric occupation probabilities with . In an oscillator basis of frequency , they are Boltzmann weights with . The joint state can be pure while each reduced state is mixed.
Thinning of a point process Created 2026-10-14 Updated 2026-11-05
Thinning removes points from a point process according to a retention rule. independent retention with probability changes the intensity measure to . For a Poisson point process, the retained and removed point processes are independent Poisson processes.
Thrashing (computer science) 2026-10-13
Memory thrashing is repeated costly cycling of memory pages out of and back into computer memory, leaving little useful computation between page faults. Active demand can exceed the available page frames, especially when multiprogramming admits too many operating-system processes. A high page fault rate during initial loading alone does not establish memory thrashing. [ref]
Beyond Physical Memory: Policies. Arpaci-Dusseau and Arpaci-Dusseau, OSTEP chapter 22, section 22.11: Thrashing
Consider one operating-system process making the 20 memory references : five repetitions of four memory pages. Start with an empty resident set, use demand paging and exact LRU replacement, and assume no prefetching or competing operating-system processes. A hit finds the requested memory page resident; a miss requires a nonresident page fault. With three page frames, references 1–3 load pages 1–3. Reference 4 evicts page 1, reference 5 reloads page 1 and evicts page 2, and the cycle continues: every return finds its memory page evicted. With four page frames, only the first four references miss; all four memory pages then remain resident.
| Available page frames | Misses in all 20 memory references | Overall page fault rate | Misses in references 5–20 | Page fault rate in references 5–20 | 3 | 20 | 100% | 16 | 100% | 4 | 4 | 20% | 0 | 0% |
|---|
The four initial misses with four page frames are compulsory first-use misses from the empty resident set. They are startup work; the three-page frame case keeps faulting after startup. This makes the difference between memory thrashing and loading a new working set visible. For the three-page frame trace, each reused memory page has three distinct intervening memory pages, so LRU replacement has already evicted it before its next use.
The same 20 memory references under LRU replacement: three page frames miss every time, four miss only during startup
. Details. To quantify the cost, assume each hit takes 100 nanoseconds and each miss incurs an additional 1 millisecond of page fault service, followed by the same 100-nanosecond memory access. These are toy latencies, not measurements. With miss probability , the expected value of access time isThe service cost is additional: it does not include the final 100 nanoseconds. Thus gives and gives , approximately a fivefold ratio over the complete trace. Over references 5–20, the corresponding ratio is : repeated page faults dominate the useful accesses. The expected value model follows the additive miss-penalty convention of OSTEP chapter 22, section 22.1. [ref]
Beyond Physical Memory: Policies. Arpaci-Dusseau and Arpaci-Dusseau, OSTEP chapter 22, equation 22.1: average memory access time
Not every page fault performs disk input-output: demand paging can allocate zero-filled memory pages, and copy-on-write can copy an existing page frame. The toy service cost models expensive misses; the miss trace alone establishes residency behavior, while memory thrashing additionally concerns repeated costly cycling. [ref]
https://pages.cs.wisc.edu/~remzi/OSTEP/vm-complete.pdf. Arpaci-Dusseau and Arpaci-Dusseau, OSTEP chapter 23, section 23.1, Other Neat Tricks: demand zeroing and copy-on-write
Possible remedies are more resident page frames, less multiprogramming, or reorganizing accesses to improve temporal locality. For this toy sequence, one extra page frame suffices under LRU replacement; that is not a universal threshold or policy. Page replacement alone cannot make every simultaneously needed memory page fit.
// Target: computer-science.bigb
Let be independent random variables, each with the Bernoulli distribution of parameter , and let . Multiplying their characteristic functions and expanding by the binomial theorem givesThe coefficients are exactly the probability mass function of the binomial distribution with parameters : the sum takes with probabilities . Direct outcome counting verifies them: an outcome with ones has probability , and there are such outcomes. The coefficients sum to one, recovering .
At , . This is also : the complex exponential now records parity. The moments agree by two routes: linearity of expectation gives , while the variance of a sum of independent random variables gives . Summing gives the second moment , also recovered as .
Three-input two-point additive-noise channel 2026-10-25
Let the input alphabet be and let the output be , where independent noise is uniform on two distinct integers. Translating the output alphabet reduces the noise to , . The reachable output alphabet has size : it is the union of two three-element intervals shifted by .
For , every row of the transition matrix has conditional information entropy one bit, so . Input probabilities make the output uniform and attain one bit per use. For , the two translated input alphabets are disjoint and every output identifies its input. A uniform input then attains bits per use.
For , reflection symmetry and concavity of information entropy permit restricting to input probabilities . Conditional on output parity, outputs whose labels are even integers have probabilities and outputs whose labels are odd integers have probabilities . Consequently . Its strictly negative second derivative and stationary equation give and channel capacity . All three values follow from overlap of translated input alphabets, rather than from output alphabet size alone.
Three-mode revival of a planar quantum rotor Created 2026-10-18 Updated 2026-11-05
For a quantum rotor with angle period , let and prepare . Its only nonzero angular-momentum amplitudes are and . Their energies are and , respectively, soThe state revives after and its density at is the initial density rotated by . At there are four equal angular maxima. This is interference between a stationary component and a degenerate pair of counter-rotating components; it is not a uniformly rotating rigid profile. Angular-momentum and energy probabilities stay constant.
Three-qubit bit-flip syndrome table 2026-10-14
Measure the commuting stabilizer generators and in that order. Use error syndrome bit for eigenvalue and bit for eigenvalue . For the Pauli X gate on physical qubit , every row holds for arbitrary normalized . This ordered parity-check convention follows [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.1
:| Error | State before recovery | eigenvalues | Error syndrome | Recovery |
|---|---|---|---|---|
Each pair of computational basis words within a row has the same two parities. Consequently the projective measurement reveals the row without distinguishing its two amplitudes. For example, becomes under . Both checks give with probability one, and applying restores both coefficients exactly, including the relative phase .
One implementation uses two quantum ancillas initialized to . Two controlled-NOT gates from data qubits 1 and 2 to the first quantum ancilla write their parity; two more from data qubits 2 and 3 to the second quantum ancilla write the other parity. Measuring only the quantum ancillas in the computational basis gives . Measuring the individual data qubits instead would reveal the encoded computational basis value and destroy the unknown quantum superposition. The existing coherent syndrome extraction for the three-qubit repetition code uses the alternative ordered checks , so its bit labels differ from this table.
The recovery also handles coherent errors. Put . Their images of the code are mutually orthogonal, giving , the Knill--Laflamme condition for this family. For any linear combination , its component in sector is . Measuring that error syndrome has probability on the normalized erroneous state, and recovery returns . More generally one recovery quantum channel corrects every noise quantum channel whose Kraus operators belong to this span. The assumption concerns the whole jointly correctable family; it does not extend to the span of arbitrary single-site Pauli errors. [ref]
https://www.preskill.caltech.edu/ph229/notes/chap7.pdf. Preskill, §7.2: correction of an error span
.A fully computed coherent example is the unitary operator . At it givesThe error syndromes and occur with probabilities and , independently of . Doing nothing for and applying for restores the same logical qubit in both branches; the scalar in the second branch is an irrelevant global phase. This is an example of linearity of coherent quantum error correction, rather than an assumption that the original error was a classical random bit flip.
Three-way qutrit sign-flip discrimination 2026-10-25
For the three qutrit unitary operators , prepare , query once, apply the known inversion about the mean , and use a computational-basis measurement to guess . Since , the processing is a unitary transformation. Direct multiplication gives , establishing success probability for each label. This calculation establishes the achieved probability, without requiring an optimality claim.
Threshold-censored normal likelihood 2026-10-25
Suppose conditionally independent latent values have normal distribution , with , but the observation only says which side of a known threshold contains each value. With for a value above the threshold and for a value below, the likelihood is the displayed product, where is the standard normal distribution function. Repeated thresholds give corresponding powers. These factors are tail probabilities, not probability densities evaluated at the thresholds. Multiplying normal densities at would describe a different observation process. The thresholds must be treated as fixed or otherwise modelled appropriately; informative selection of thresholds can change the likelihood.
Threshold stopping of an independent Gaussian series Created 2026-10-14 Updated 2026-11-05
Let , and stop on first reaching a fixed positive threshold. If the coefficient squares are summable, uniform integrability gives the stopped mean zero, with the terminal limit used on . If the coefficient squares diverge, for each fixed . Thus . This event is unaffected by changing finitely many of the independent variables, so the Kolmogorov zero-one law makes its probability one. Hence and is at least the positive threshold; its expectation, finite or infinite, cannot be zero.
Tie probability for independent binomial counts Created 2026-10-20 Updated 2026-11-05
For independent random variables with the same binomial distribution , partition the tie event into the mutually exclusive events . independence makes each probability the square of its binomial probability, proving the formula. At , Vandermonde's identity gives . Symmetry under exchange of the two variables then gives .
Time-independent Schrödinger equation Created 2026-09-24 Updated 2026-10-20
For a time-independent Hamiltonian operator , an energy eigenstate satisfiesFor a one-dimensional particle of mass in a real potential energy ,Its full time-dependent wavefunction is : substitution in the Schrödinger equation checks both the minus sign and the factor . Thus an energy eigenstate has stationary position probability density, even though its quantum phase evolves. The boundary conditions and operator domain are part of this eigenvalue problem, selecting physically allowed solutions; the infinite square well and Radial Schrodinger equation for the hydrogen atom give complementary confined examples.
For a complete discrete orthonormal basis of energy eigenstates, linearity gives , with . Cross terms in oscillate at angular frequencies . A continuous spectrum requires the corresponding spectral integrals; for a free particle on the whole line, individual plane waves are generalized eigenfunctions, and a normalized Gaussian wave packet is their integral quantum superposition. Adding a spatially constant real to shifts every energy eigenvalue by and multiplies the full state by , a global phase; energy differences, position probabilities and probability current are unchanged.
Time-integrated pulse operator has action units Created 2026-10-20 Updated 2026-11-05
For a short applied perturbation in a Quantum Hamiltonian, define . Since has energy units, has action units. In the ideal impulsive limit, during which the unperturbed evolution is negligible, the quantum state changes by if the perturbation commutes with itself at different times. More general pulses require time ordering.
Writing the impulse as makes the dimensions explicit: the Dirac delta function in time has inverse-time units. For an off-diagonal two-state impulse with coupling , the transition probability is . The ratio , rather than alone, is the dimensionless pulse strength. Integrating across the full pulse gives its full area; an artificial factor of one-half must not be introduced by treating the pulse as an endpoint without specifying a regularization.
Time-origin alignment of clinical endpoints Created 2026-10-14 Updated 2026-11-05
A clinical trial comparison must define a common time origin and observation window for both assigned treatments. A probability measured from allocation cannot be replaced by one measured from a later treatment-dependent release or discharge. The latter may describe a different time interval and a selected population. A numerical sample size cannot be obtained by silently treating those probabilities as interchangeable.
Time reversal of a continuous-time Markov chain Created 2026-10-05 Updated 2026-11-05
For an equilibrium chain with strictly positive stationary probabilities, reversed jump rates are . Under detailed balance they equal the original rates, making the stationary path law reversible. Holding times and jump directions reverse together; this is more than symmetry of one-time distributions.
Time-reversed Markov chain Created 2026-09-29 Updated 2026-11-05
For a stationary Markov chain with transition matrix and Stationary distribution , the time-reversed Markov chain has transition matrixon the support . The Stationary distribution is essential: Bayes' rule gives . The quotient is not defined at a zero-mass state, so arbitrary states outside the stationary support must not be included without an extra convention.
The stationarity equations give . Also , so the reversed kernel has the same invariant law. Multiplying the pairwise identity along a finite path proves equality between its forward Probability and the Probability of the reversed path under .
The reversed chain need not be the original chain. A directed three-state cycle has uniform Stationary distribution; time reversal traverses the cycle in the opposite direction. A stationary chain is reversible exactly when , which is equivalent to Detailed balance.
Total correlation Created 2026-09-28 Updated 2026-10-14
Total correlation measures how much dependence is lost when a joint probability distribution is replaced by the product of its marginal probability distributions. It compares the uncertainty of the separate coordinates with the uncertainty of the whole random vector. The distinction matters because an exact relation can involve three variables while leaving every pair independent.
For random variables with finite alphabets, defineHere is information entropy, the entropy of the full random vector is joint entropy, and is relative entropy. Base-two logarithms give bits; natural logarithms give nats. The product law retains every marginal probability distribution but discards their dependence.[ref]
Information Theoretical Analysis of Multivariate Correlation by Satosi Watanabe. Abstract, printed p. 66: total correlation for the partition into individual variables
A positive joint probability guarantees positive marginal probabilities at that outcome, so the displayed relative entropy is finite in this finite-alphabet setting.For two variables, total correlation is exactly mutual information. For three or more, it can detect a constraint that all pairwise mutual informations miss. Relative entropy nonnegativity gives , with equality exactly when the coordinates are jointly independent random variables.
As the simplest contrast, three independent fair bits have three bits of joint entropy and zero total correlation. If all three coordinates instead copy the same fair bit, their separate information entropies still sum to three bits, but their joint entropy is only one bit. Their total correlation is therefore two bits. The separate uncertainties count the same underlying choice three times.
Total infectiousness Created 2026-09-24 Updated 2026-11-05
For incidence and discrete generation-interval probabilities , the total infectiousness at time is .
Total variance stationary condition for excess of loss Created 2026-10-07 Updated 2026-11-05
For positive claim sizes with finite second moment in a compound Poisson distribution aggregate of parameter , the two excess of loss reinsurance payouts are and . The derivative of their total aggregate variance is . Thus the displayed condition characterizes stationarity. When the tail probability is positive it says that the retention equals the mean residual life. Global minimality requires an additional sign or comparison argument.
Total variation distance Created 2026-09-24 Updated 2026-10-13
Total variation distance asks how much two probability distributions can disagree about the same event. For probability measures on one measurable space , its definition isThe supremum ranges over all measurable sets, so guarantees that every yes-or-no prediction has probability error at most . This metric takes values between zero and one; it is zero exactly when the two probability measures agree. This makes it useful for comparing a sampling algorithm's output with its target probability distribution, and for defining the mixing time of a Markov chain.
On a finite set, add the excess probability mass wherever exceeds . That excess is also half the sum of all absolute differences:The last expression reveals the common probability mass that the two probability distributions can share.[ref]
Markov Chains and Mixing Times, second edition by David A. Levin and others. §4.1, Proposition 4.2 and Remark 4.3, printed p. 48; §4.2, equation (4.13), printed p. 51
The coupling characterization of total variation distance turns this overlap into an actual joint construction; minimum sum of errors in a simple hypothesis test gives it a statistical interpretation. One quantity connects probability bookkeeping, comparison of sampling methods, and the limits of a statistical test.

