Two-spin quenched and annealed free energies 2026-10-18
Choose two Ising spins with Hamiltonian , where independently takes or with equal prior probabilities and . This original finite example has no geometrical frustration and no phase transition. Its four spin assignments give . ThereforeThe concave function puts . For this two-value case the claim is just , obtained by squaring . Thus no formal continuation of replicas is needed to see the distinction.
In the annealed disorder ensemble, the stronger bond has probability , approaching one at low temperature. A quenched disorder collection instead retains one half at each coupling. As , and : averaging samples and allowing the material variables to equilibrate describe different physics.
Two-state excursion visit law Created 2026-09-24 Updated 2026-11-05
Let belong to an irreducible recurrent Discrete-time Markov chain. Write and . DefineThe positive return convention is essential: itself is zero when starting at . Let count visits to before the first positive return to , including repeated holding visits at . ThenWith Probability the excursion reaches . From each visit there, the Strong Markov property gives Probability of hitting before the next return to . recurrence ensures there is no third possibility of escaping both states forever. Thus, conditional on reaching , the visit count has a positive-support geometric distribution with mean .
Two-state ion-channel gating Created 2026-10-14 Updated 2026-10-14
Two-state ion-channel gating models an individual gate as a random switch between closed and open states. Write for its open probability; this is the in the header equation. An individual gate's state is always closed or open, rather than partly open. A population of identical gates can have a fraction open near , and averaging repeated identically prepared trials estimates the same probability. A finite population's observed fraction fluctuates. See Purves and colleagues, Neuroscience, 2nd edition (2001): Ion Channels Underlying Action Potentials for single-channel steps and their population averages.
At fixed membrane potential , let constant rates govern closed-to-open and open-to-closed transitions respectively, in . This is a two-state continuous-time Markov chain. Over a short interval , an initially closed gate opens with probability , and an initially open gate closes with probability . Gain minus loss gives the deterministic ordinary differential equation for the probability:Here is the fixed-voltage limiting open probability, and is a time constant. The ratio of the rates fixes the limit, while their sum fixes the speed. With initial probability ,For a short derivation, subtract : the deviation obeys , yielding the exponential function. After one time constant, of the initial deviation remains. The solution stays between and , so it remains a valid probability. The rate and time constant formulations are described in Gerstner and colleagues, Neuronal Dynamics, §2.2.2: transition rates and channel kinetics.
For a worked toy condition A, choose and . Then , , andIn a separately prepared condition B, choose , and the same . Now , , and . Condition B approaches a higher limit more quickly. These are two stipulated constant-rate conditions with held fixed in each experiment, not an empirical function relating rates to voltage or a sequential switch between conditions. The initial need not be the limiting probability at the newly imposed voltage.
Two-state ion-channel gating: two constant-rate relaxation conditions
. Original computed probability curves, both starting at . Dashed lines show the limiting open probabilities and ; dotted lines mark time constants and . The dot marks condition A at , where . Smooth curves represent open probability or population averages, not an individual gate's random state trace or an ionic electric current. Details.In the Hodgkin-Huxley model, the rates depend on membrane potential: and . Its is the limit for voltage held at that . During an action potential, changing changes the rates and gates feed back onto through ionic electric currents; substituting the present voltage into the constant-rate solution does not solve that coupled system. Gating describes availability of a conducting pathway. Even an open ion channel carries zero net ionic electric current at its reversal potential.
The useful bridge is from abrupt random molecular events to a smooth population prediction. A channel requiring several independent permissive gates in an ion channel has an open probability equal to their product; this can make channel availability much smaller than each gate's availability. The Hodgkin-Huxley model uses and for sodium and potassium electrical conductances, respectively.
Two-threshold concentration for certifiable functions Created 2026-10-14 Updated 2026-11-05
Suppose an integer-valued certifiable function is -Lipschitz under one-coordinate changes and a value at least has a certificate of at most coordinates. Any input with value at most must differ on at least certificate positions. Equal weights on those positions bound its Talagrand convex distance from the low-value event. Applying Talagrand's convex distance inequality gives the displayed product bound. For , median tails integrate to , and deviations of order have exponentially small probability.
Two-toss sample space 2026-10-14
Model two fair independent coin tosses, recording their order. Here denotes heads and tails, andThe power set includes every question expressible as a subset of these four outcomes. The mass comes from the fairness and independence assumptions. These are exact model probabilities, rather than measured toss frequencies.
Let be the event that the first toss is heads and the event that the second toss is heads. ThenThe union means “at least one head,” while the intersection means “both heads.” Their probabilities are and . Counting the union through the inclusion-exclusion principle gives ; alternatively its complement of an event is , of probability .
Four ordered outcomes and the event of at least one head
. Rows record the first toss and columns the second. Each cell has probability under fair independent tosses. The highlighted union includes , , and ; the overlap contains only . Details.On the same sample space, assigning masses to would still make each toss fair: . But , so the tosses would be dependent. The event of at least one head would have probability . Changing the probability measure changes the answer even when the sample space and the single-toss probabilities stay the same.
Two-turn renewal game 2026-10-20
Suppose each independent turn makes the current player win with probability , lose with probability , or pass with probability , with and . The players have identical turn rules and alternate after a pass. Before the first pair of turns finishes, the starting player wins with probability . Passing twice returns to the initial state with probability . First-step analysis therefore gives , proving the formula. The geometric series of repeated restarts converges because ; infinite play has probability zero. For , nobody ever wins, so that excluded case has no eventual winning probability summing to one.
Inside a rooted -ary subtree of a degree- regular tree, pair each cell root with one distinguished child. Keep reinfection inside each pair, suppress infection back into its parent cell, and allow each child cell to be activated only once. Offspring counts of different cells are independent and identically distributed, so cell genealogies form a Galton-Watson process. A cell root has outgoing child-cell edges and its paired vertex has . Starting at the root, the probabilities to send an arrow along one specified outgoing edge from these two vertices before internal extinction are respectivelyThey follow by first-step equations on the three nonempty pair states. The offspring mean is , andContinuity makes at some strictly smaller positive rate. The branching-process extinction criterion then gives positive survival probability for the suppressed process, hence for the original contact process.
Type (information theory) Created 2026-09-24 Updated 2026-10-14
A type summarizes a string by how often each symbol occurs. Fix a finite alphabet of cardinality and a positive length . For a string , its empirical distribution is the probability mass functionThe empirical distribution forgets order. The strings and both assign probability to each binary symbol; assigns to zero and to one. Thus a long string can have a short summary even though that summary does not reconstruct the original order.
For independent and identically distributed symbols, this loss of order has a useful consequence: all strings with the same empirical distribution have the same probability. The method of types uses this symmetry to turn questions about exponentially many strings into counting questions about relatively few frequency profiles.[ref]
The Method of Types by Imre Csiszár. §I, printed p. 2505: partition by empirical distribution and equiprobability under a memoryless model
Typical-set concentration for a biased coin 2026-10-14
The count has binomial distribution with mean and variance . The information content per symbol is an affine function of , so its variance isChebyshev's inequality therefore gives the finite-sample lower boundThe bound is often loose, but it proves that every fixed positive tolerance eventually captures nearly all the probability. Direct summation of the binomial distribution's probability masses gives . A finite sample does not need to have a nearly full typical set: the 40-symbol example above captures only about .
Longer biased-coin messages concentrate in typical sets with controlled size
. The left plot compares exact typical set probabilities with the lower bound from Chebyshev's inequality. The right shows and its finite-sample bounds. The tolerance stays fixed; the curve is not asserted to converge to exactly . All points are exact finite-model calculations. Details. Typical-set indexing example 2026-10-14
The typical sequence theorem turns a probability concentration into a coding construction. Assign one binary number index to each weakly typical sequence, plus a reserved index for every word outside the set. The decoder recovers every typical word exactly; the reserved index has one predetermined output. The block code usesbits and has reconstruction-error probability at most .
For this example and , needs 34 bits but permits error up to about . At , 570 bits suffice and the error bound is about . These are existence calculations for an explicitly enumerated collection, rather than claims about an efficient practical encoder. The reduction comes from protecting the whole high-probability collection, rather than just its single most likely member.
Let be the weak typical set of a finite alphabet independent and identically distributed source with Shannon entropy , and let be any sets with . The asymptotic equipartition property and union bound give . Every word in the intersection has probability mass between and . Summing these bounds givesFor every fixed , the first probability eventually exceeds , proving the title bound. A sample mean within a fixed positive tolerance of the expected value supplies by the strong law of large numbers.
Typical subspace theorem Created 2026-10-07 Updated 2026-11-05
For each fixed , the quantum typical subspace projector selects eigenvalues of between and . Its probability tends to one by the weak law of large numbers for the spectral information variable. If its probability is at least , its dimension is between and . These statements give the size and concentration estimates behind Schumacher compression.
Ultimate ruin probability Created 2026-10-07 Updated 2026-11-05
The probability that the insurance surplus in a classical risk model becomes negative at some finite time, starting from capital . Ultimate survival has probability . A finite-horizon ruin probability instead restricts the crossing time to a specified time interval.
A bound tending to zero with one factor's Gowers U3 norm, uniformly over all finite abelian groups, is false. On , choose a random independent sign at each point. A cube with eight distinct vertices has sign product of expectation zero. The probability of a collision among its vertices is at most , since each equality of distinct vertices imposes a nonzero linear equation in the increments. Thus some sign function has . But the four-term arithmetic progression is , so choosing factors gives correlation identically one. As , the norm tends to zero. Bounded torsion, as in cyclic groups, avoids this obstruction.
Uncorrelated random variables Created 2026-09-24 Updated 2026-10-14
Uniform balls-in-bins allocation Created 2026-10-06 Updated 2026-11-05
Place labelled balls independently into labelled bins, each with probability . The vector of bin counts has a multinomial distribution, and each count separately has the binomial distribution . Distinct bin counts have covariance , so they are dependent for and . Counts of bins of a specified size are sums of indicator variables; their expectations follow from the linearity of expectation, without any independence between bins.
Uniform convergence in probability Created 2026-10-06 Updated 2026-11-05
Uniform convergence in probability means that the supremum of the absolute discrepancy on the entire index set tends to zero in probability. It controls evaluation at random indices in that set, unlike pointwise convergence in probability. On a fixed compact index set it is a special case of uniform convergence on compacts in probability.
Uniform convergence on compacts in probability Created 2026-09-24 Updated 2026-11-05
For , the maximum of on occurs at . If one parameter is one, the maximum is attained at the corresponding endpoint; if both are one, is constant. Let . Accept an independent uniform distribution proposal when another uniform draw is at most . The accepted probability density function is the beta distribution, and acceptance probability is .
Uniform half-circle balance for independent Bernoulli variables Created 2026-10-31 Updated 2026-11-05
Let be even and let be independent Bernoulli variables with parameter , arranged on a circle. The probability that some consecutive half-circle has is at most . For a fixed , the variable has the binomial distribution , and the signed imbalance is . Apply Hoeffding inequality to this single binomial variable, then take a union bound over the at most intervals. Consequently suffices for uniform balance with probability tending to one whenever .



