Rectangle crossing in bond percolation Created 2026-10-14 Updated 2026-11-05
For the induced square lattice subgraph in , is the probability of an open graph path from its left boundary to its right boundary under independent bond percolation of density . Width and height count lattice spacings. Dual bond percolation exchanges failure with a top-to-bottom dual crossing of dimensions , with the usual exterior boundary vertices.
An irreducible Markov chain is recurrent exactly when every nonnegative superharmonic function for a Markov chain is constant. In the recurrent case, absorb the chain at . The inequality and almost-sure hitting give ; exchange . In the transient case, the hitting probability of a state is one there and satisfies the superharmonic inequality, but its one-step average at is the strictly smaller return Probability. It is a nonconstant example.
Recurrence criterion by return probabilities Created 2026-09-24 Updated 2026-11-05
A state is recurrent exactly when the sum over time of its return probabilities diverges.
Recurrence survives deletion of self-transitions Created 2026-10-14 Updated 2026-11-05
An irreducible recurrent discrete-time Markov chain with at least two states has everywhere. Removing repeated consecutive states from a positive-probability path proves irreducibility of its discrete-time jump chain. Each sojourn in a state is almost surely finite; infinitely many visits to a recurrent state therefore correspond to infinitely many distinct returning sojourns. The jump chain remains recurrent, although deleting holding times may change periodicity.
Recurrent Markov chain Created 2026-09-24 Updated 2026-11-05
A Recurrent Markov chain returns to its states rather than eventually leaving them forever. A state is recurrent if its positive first return time satisfies . A chain is recurrent when every state is recurrent. Within an irreducible class, recurrence is shared by every state, so testing one state suffices.
The Strong Markov property at successive return times shows that a Recurrent state is visited infinitely often almost surely when starting there. If its return Probability is , the number of visits including time zero has a geometric distribution on the positive integers, with mean . Consequently the Green-function criterion is
Tonelli's theorem identifies this sum with the expected number of visits. recurrence does not require a finite mean return time: null recurrence and positive recurrence distinguish infinite from finite mean recurrence time. simple symmetric random walk on the integers is null recurrent, whereas every finite irreducible chain is positive recurrent.
Recurrent state Created 2026-09-24 Updated 2026-11-05
A state is recurrent when a Markov chain started there returns to it with Probability one.
Red-ball prediction with one certain red ball Created 2026-10-31 Updated 2026-11-05
A box contains one certainly red ball and independently coloured extra balls, each red with probability . Conditional on the first draw being red, a second draw without replacement is red with probability . To see the effect of using a conditional probability, let , where has a binomial distribution with parameters . The conditional probability is : histories with more red balls are more likely to produce the first red draw and therefore receive greater weight.
A compound lottery first selects branch with probability and then outcome with conditional probability . Its reduced lottery assigns the total probability . The law of total expectation gives the same expected utility in either description:
This rule assumes that only the final outcome matters. A preference for a particular randomization procedure requires including that procedure in the outcome description; it cannot be captured by changing the arithmetic of expected utility on a fixed outcome set.
Reflected biased random walk on the nonnegative integers Created 2026-09-24 Updated 2026-11-05
Let a discrete-time chain move up with probability and down with probability away from zero, while at zero it moves up with probability and stays with probability . It is transient for , null recurrent for , and positive recurrent for . In the positive-recurrent case its invariant distribution is
and aperiodicity from the self-loop at zero implies convergence to this distribution.
Reflected chain with geometric downward jumps Created 2026-10-14 Updated 2026-11-05
Fix and put . For independent geometric random variables with for , the Reflected chain with geometric downward jumps obeys . Its transition probabilities are for and .
The Probability of hitting zero from is one when and when . The first-step boundary equation at is essential for the extra exponent. Before reflection the mean increment is : downward drift corresponds to .
The chain is positive recurrent for , with Stationary distribution for . The ratio ensures these weights sum to one. It is null recurrent at and transient for . The parameter restriction matters: does not define the displayed geometric distribution, and produces deterministic upward motion rather than an irreducible chain.
Reflected lazy walk with doubled endpoint transitions Created 2026-10-31 Updated 2026-11-05
On the finite path , take interior neighbor probabilities , endpoint inward Probability , and holding Probability , with . Detailed balance gives the displayed invariant distribution: endpoint weights are half the interior weights. For the chain is irreducible and aperiodic, so transition probabilities converge to it. At parity alternates and the period is two.
Reflected nearest-neighbour random walk Created 2026-09-24 Updated 2026-11-05
On , let the chain jump from every to with probability and to with probability , and jump from zero to one. It is recurrent exactly when ; at it is null recurrent.
For the Bell state , let both zero-input measurements use the computational basis, and let the one-input bases be rotated by for Alice and for Bob in the real qubit plane. In the CHSH game, the four conditional winning probabilities are . They follow by contraction of the Bell state with vectors from the real orthonormal bases used for the basic measurements. Their average is the displayed expression. On , this beats exactly when and reaches at , since .
Reflecting boundary condition for a diffusion Created 2026-09-28 Updated 2026-11-05
A reflecting boundary confines a diffusion without losing probability. Its forward condition is zero outward Fokker-Planck probability current, , and its backward condition is a zero conormal derivative.
Reflection comparison of random-cluster connections Created 2026-10-14 Updated 2026-11-05
Choose a graph vertex on the boundary of a cubic lattice box. Translation and reflection invariance identify the probabilities of and . Their intersection implies , so positive association of random variables gives . A union bound and cubic lattice symmetries choose such an with probability at least the box-boundary connection probability divided by the number of boundary graph vertices. This polynomial factor disappears in the exponential rate, identifying boundary and axial inverse correlation lengths.
Reflectionless potential Created 2026-09-24 Updated 2026-11-05
A reflectionless potential transmits every scattering state with zero reflected probability.
In one-dimensional inverse scattering, its continuous reflection coefficient vanishes and its remaining discrete scattering data reconstruct multisoliton potentials.
For bond percolation on the square lattice, write and . A maximal-probability boundary graph vertex can be placed at by symmetry. Reflection about identifies its connection probability from with that from . The Harris-FKG inequality yields for .
Regular pair of bipartite partitions Created 2026-10-03 Updated 2026-10-06
Let and be set partitions of the two parts of a bipartite graph. The pair of partitions is -regular when
Thus a uniformly random pair in lies in an irregular cell pair with probability at most .
Rejection region Created 2026-10-14 Updated 2026-11-05
A rejection region is the set of sample outcomes on which a hypothesis test rejects its null hypothesis. Its probability under the null determines the type I error rate.
Relative-entropy identity for rank-one dephasing Created 2026-10-06 Updated 2026-11-05
Because is diagonal, . Hence . Support inclusion under rank-one dephasing handles zero probabilities, and Klein's inequality makes the difference nonnegative. Equality holds exactly when the state was already diagonal.