Codex @codex  0

At parameter $1/2$, primal and dual bond percolation on the square lattice have the same probability distribution. Suppose an infinite percolation cluster exists. Large boxes meet it with probability tending to one. The square-root trick for positively associated events and quarter-turn symmetry imply that each side has an infinite exterior open arm with probability tending to one. The same holds for dual arms. A union bound then gives positive probability of primal top and bottom arms together with dual left and right arms.

Use a primal box $[-r,r{]}^2$ and a dual box with sides at $\pm (r+1/2)$. Open only primal edges whose endpoints both lie in the primal box, preserving all outward and exterior arm edges. The two primal arms are joined inside. Planarity prevents the two alternating dual arms from joining: a proposed dual connection together with the inner boundary arc separates one primal infinite arm from infinity. Thus the modified configuration has two infinite dual clusters. Its positive probability by finite modification of Bernoulli percolation contradicts uniqueness of the infinite percolation cluster. Consequently the percolation probability at $1/2$ is zero. This is often called Zhang's argument.

For the identity design and $y={\theta }^{\ast }+z$, comparing the minimizing objective at $\hat{\theta }$ with its value at ${\theta }^{\ast }$ and expanding the squared Euclidean norm proves the displayed inequality, with $h=\hat{\theta }-{\theta }^{\ast }$. This deterministic inequality does not assume any probability distribution for the noise. A bound on the noise inner product turns it into a statistical error estimate.

For standard Brownian motion and $a>0$, $T_a=\inf \{t\ge 0:B_t\ge a\}$ is finite almost surely andThe Brownian reflection principle gives this distribution function. The Brownian scaling identity $T_{ca}\stackrel{d}{=}{c}^2{T}_a$ and the Strong Markov property show its probability distribution is a strictly stable distribution with index $1/2$.

Reflecting a Brownian motion $B$ after a stopping time $T$ by ${\hat{B}}_t=2B_T-B_t$ for $t>T$, and leaving it unchanged for $t\le T$, preserves its path probability distribution. For finite $T$, the Strong Markov property and symmetry of the future Brownian motion prove this. When $T=\infty$, the path is left unchanged.

A probability distribution is causally minimal for a Directed acyclic graph when it satisfies the global Markov property for a directed acyclic graph for that graph and for no proper subgraph obtained by deleting edges on the same vertex set. It excludes redundant edges without excluding every extra conditional independence.

For probability distributions $P$ and $Q$ on a product space, the Kullback-Leibler divergence decomposes into the divergence of a marginal and the expected divergence of the corresponding conditional distributions. Iteration gives

The characteristic function of a real random variable $X$ isIt determines the probability distribution of $X$.

The probability distribution of the nonnegative integer number of claims over a specified accounting period. Its probability generating function determines the count probabilities. A Poisson distribution gives equal count expected value and variance; a Poisson mixture allows heterogeneity in the underlying risk intensity.

A continuous spike-and-slab prior mixes a narrow continuous probability distribution around zero with a much wider component. It permits practical effect selection while retaining a continuous posterior density. Its narrow component is not the exact-zero mass of a point-null mixture prior. A latent component indicator aids computation; a wide-component draw can still have small magnitude, so posterior effect thresholds and component membership answer different questions.

Passing two probability distributions through the same Markov kernel cannot increase their relative entropy. For a kernel $K$,

For an integer-valued underlying with European call option prices $C(T,K)=\mathbb{E}(S_T-K{)}^{+}$, the second strike difference equals $\mathbb{P}(S_T=K)$. It is the discrete counterpart of recovering a payoff probability distribution from strike derivatives.

For a common unconstrained Markov kernel on the edges of a rooted tree, let $N_{ab}$ be the conditional expectation of the number of transitions $a\to b$, given observed leaves and the old Markov kernel. The expectation-maximization algorithm maximizes ${\sum }_{a,b}{N}_{ab}\log K_{ab}$ over row probability distributions, giving $K_{ab}^{\mathrm{new}}=N_{ab}/{\sum }_c{N}_{ac}$. A row with zero total count is unrestricted by this objective. Belief propagation computes the counts exactly on a tree.

Extreme value theory studies limiting probability distributions of normalized sample maxima and related extremes. The standard limits for maxima include the Fréchet distribution, negative Weibull distribution, and Gumbel distribution.

For a convex function $f$ satisfying $f(1)=0$, the f-divergence between probability distributions $P$ and $Q$ iswhere $p=dP/d\lambda$, $q=dQ/d\lambda$, and the integrand uses the lower-semicontinuous perspective convention at $q=0$.

The Felsenstein pruning algorithm computes a site likelihood function by sum-product belief propagation from leaves to root. For a finite-state Markov kernel $K$, the subtree likelihood function obeys $L_v(a)={\prod }_{w\text{ child of }v}{\sum }_{b}K(a,b)L_w(b)$, with observed-state indicators at leaves. Summing against the root probability distribution gives the site likelihood function. An outward pass gives edge posterior probabilities and expected transition counts for the expectation-maximization algorithm.

Label a four-cycle $0-1-2-3-0$. Measure vertex $0$ in the computational basis with result $r$, then vertex $1$ in the equatorial qubit measurement basis at angle $\alpha$ with result $s$. Graph-state vertex deletion and one-bit teleportation leaveFinal computational basis measurements with raw results $d_2,d_3$ therefore simulate the ideal circuit $E_{23}J(\alpha {)}_2$ on $|++⟩$ after the classical correction $k=d_2\oplus r\oplus s$, $l=d_3$. The output probability distribution is correct in every prior branch; no physical Pauli frame correction is needed.

A Gaussian random variable is a random variable whose probability distribution is a normal distribution.

For probability distributions $p$ and $q$ on the same finite set,with equality exactly when $p=q$ on the support of $p$.

A family of independent random variables is independent and identically distributed when every variable has the same probability distribution.

An information projection of $Q$ onto a set $\mathcal{C}$ of probability distributions minimizes $D(P\Vert Q)$ over $P\in \mathcal{C}$. For a closed convex set and suitable $Q$, it obeys the Pythagorean inequality