A. A. Barker Created 2026-10-24 Updated 2026-11-05
A. A. Barker authored a 1965 calculation of radial distribution functions for a proton–electron plasma. The associated Barker acceptance probability supplies a useful rule for equilibrium Markov chain Monte Carlo: if the probability-and-proposal ratio for a proposed move is , accept with probability . For reverse moves the ratio is , so the acceptance probabilities have ratio , giving detailed balance. The rule connects a microscopic sampling decision with the desired equilibrium distribution.[ref]
Author credited under these initials on the 1965 Monte Carlo method plasma paper Monte Carlo Calculations of the Radial Distribution Functions for a Proton-Electron Plasma by A. A. Barker. The initials are not expanded because an exact identity beyond the publication credit has not been established here. University of Adelaide thesis addendum identifying the 1965 publication.
Alternating access model 2026-11-05
The alternating access model describes membrane transport by a carrier protein whose binding region is exposed successively to opposite sides of a cell membrane. A solute can bind on one side, remain associated while the carrier protein changes conformation, and be released on the other. Unlike an open ion channel, this mechanism need not provide a continuous aqueous passage across the cell membrane.[ref]
The model explains a route, while thermodynamics determines the possible net direction. For an uncharged ideal dilute solute at uniform temperature, with equal standard chemical potentials on the two sides, the molar free energy change for inward transfer is
Here is the molar gas constant. At , accumulating that solute to ten times its outside concentration costs approximately . Changing which side can reach a binding site does not supply that free energy. Sustained uphill transport requires coupling to another energetically favourable process; at equilibrium, detailed balance excludes a persistent directed pumping cycle.
Structural experiments help test how such access could change. The 2005 NhaA antiporter structure revealed a cytoplasmic funnel and an internal region implicated in ion binding in a pH-downregulated state. The authors proposed movements connecting access and regulation. A structure of one state constrains a transport mechanism, but is not a direct movie of its complete cycle.[ref] The neutral-solute calculation above illustrates the energetic distinction; the full NhaA cycle also involves coupled charged ions.
A positive balance function expresses each active route's aggregate service as this ratio. With independent Poisson arrivals and exponential document sizes, detailed balance yields stationary weights , provided their sum is finite.
Barker acceptance probability Created 2026-10-25 Updated 2026-11-05
The Barker acceptance probability accepts a proposal using the displayed ratio. If and , the accepted flux is , symmetric in the two states. This proves detailed balance; define acceptance as zero when . Rejected proposals contribute to the diagonal transition probability. Replacing by an unnormalized target leaves the ratio unchanged. For a common proposal, shows that its acceptance probability never exceeds the Metropolis–Hastings acceptance probability. The name refers to A. A. Barker's work on Monte Carlo methods for a plasma; the initials are retained without an unverified expansion.[ref]
Bernoulli invariant laws of finite symmetric exclusion Created 2026-10-14 Updated 2026-11-05
On a finite graph with symmetric edge-swap rates, the stirring representation of symmetric exclusion transports the occupations by a random permutation. An independent identically distributed Bernoulli distribution occupation field is invariant under every deterministic permutation, and hence under this random permutation when it is independent of the initial field. Therefore the displayed product measure is invariant, including densities zero and one. Equivalently, an edge swap preserves the number of particles and has the same reverse rate, giving detailed balance.
Bernoulli-Laplace diffusion model Created 2026-10-25 Updated 2026-11-05
In the Bernoulli-Laplace diffusion model, two urns each contain balls, with red and blue balls in total. Independently choose one ball uniformly from each urn and exchange them. The red count in the first urn is a Markov chain on , with
The upward event exchanges a blue ball from the first urn with a red ball from the second; the downward event reverses the colors. Hence
Starting from , the mean is , with the initial value understood separately if the geometric factor is zero. For , this mean tends to . For , however, the only two configurations alternate and the expected imbalance does not decay.
The Stationary distribution is the hypergeometric distribution
It counts uniformly allocated red/blue configurations. The ratio verifies Detailed balance with the displayed transitions. The chain is irreducible; for an interior holding Probability also makes it aperiodic, while the chain has period two. This model separates convergence of an average imbalance from the full probability law and its periodicity.
For nested regression models, append one coefficient drawn from density while retaining the variance and existing coefficients . The dimension-matching map has absolute Jacobian one. With joint model/parameter target , birth-selection probability , and reverse death-selection probability , the displayed acceptance probability and its reciprocal death rule enforce detailed balance. Include normalized parameter-prior densities and a model-order prior in : constants that depend on model order cannot be dropped from a cross-model ratio.
Birth-death recurrence classification Created 2026-09-24 Updated 2026-11-05
Consider a birth-death process on with constant birth rate , constant death rate at every positive state, and no deaths from zero. The reflecting boundary is essential: the result changes if zero is an absorbing state. Detailed balance would give
When , these weights normalize to a Geometric distribution, so the irreducible chain is positive recurrent. When , the embedded jump chain is the symmetric reflected random walk: it returns to zero almost surely, but its constant equilibrium weights have infinite sum, so the chain is null recurrent. When , its upward-biased embedded random walk has probability of hitting zero from state one, making the chain transient. The holding rates are bounded, so nonexplosion creates no additional qualification here.
Boltzmann machine 2026-10-18
A Boltzmann machine is a stochastic neural network that learns a probability distribution specified by pairwise energies. To compare it directly with a Hopfield network, use the bipolar energy . Here controls the preference for low energy, and the partition function normalizes all states. In a computational model, is an algorithmic inverse temperature; interpreting it as additionally requires physical energy units.
A random single-unit Gibbs sampling update has conditional probability
Indeed, the two possible energies differ by ; their normalized Boltzmann weights give this logistic function. Random selection of one unit at a time satisfies detailed balance. For finite weights and finite positive , all conditional probabilities lie strictly between zero and one, so the finite Markov chain can reach every state and can remain in place. Its unique stationary distribution is . A short run need not yet sample that distribution accurately.
As , a nonzero field selects its sign, approaching asynchronous Hopfield energy descent. At zero field the stochastic rule remains a fair coin, whereas the deterministic convention above retains the old value. At finite inverse temperature, uphill moves permit exploration beyond one local minimum. Recall and learning are different operations: sampling changes the units at fixed weights; learning changes the weights to fit the training data.
Burke's theorem Created 2026-10-14 Updated 2026-11-05
In a stationary M/M/1 queue with independent Poisson arrivals of rate and exponential service times of rate , the departure counting process is a Poisson process of rate . Moreover, the departures before a fixed time are independent of the queue population . This independence concerns the past departures: future departures depend on whether the queue is currently empty.
The proof uses time reversal. The stationary Geometric distribution satisfies Detailed balance, , so the stationary queue population is a Reversible Markov chain. Departures in forward time are arrivals in reversed time. In the reversed chain the upward rate is again the constant , so those arrivals are an independent Poisson process, including independence of their future increments from the present queue population. Reversing time gives both assertions. Consequently, feeding the output of a stationary M/M/1 queue into another queue supplies Poisson input to that second queue. The claim depends on equilibrium; a queue started empty has no immediate departures even though arrivals have positive rate.
A stable equilibrium M-M-s queue has a Poisson process of departures with the same rate as its input. Its present population is also independent of past departures, a component of quasireversibility. The birth-death process satisfies detailed balance; reversed upward jumps have a constant arrival rate, so they are generated by an independent Poisson process.
Carrier-sense multiple access lets a station attempt transmission only when interfering neighbors are inactive. An ideal continuous-time model gives inactive station an exponential attempt rate and unit-rate exponential transmission completions. Detailed balance then gives activation weights on the independent sets of the interference graph.
Collision strength Created 2026-10-24 Updated 2026-11-05
The dimensionless collision strength describes electron-impact transitions between two atomic levels before thermal averaging. It can vary rapidly with collision energy, especially near excitation thresholds. The quantity entering a thermal collision rate coefficient for an atomic transition is its effective collision strength, usually denoted , rather than one value of .[ref]
For levels , write and measure the scattering variable above the upper-level threshold. With a Maxwellian electron population,
Let be the statistical weights of atomic levels, and set . The excitation and de-excitation rate coefficients are
Their ratio obeys detailed balance. The numerical coefficient is when the rate coefficient is expressed in .[ref]
If is constant over the sampled energy range, the normalized integral gives . Otherwise low-energy resonances can strongly alter the thermal result. For a non-Maxwellian velocity distribution, compute the appropriate cross-section–speed average; a tabulated Maxwellian effective collision strength is not automatically transferable. Multiplying by electron number density gives the excitation rate per target chemical atom.
Complex balance Created 2026-10-24 Updated 2026-11-05
At a positive concentration vector , the total incoming deterministic reaction flux equals the total outgoing flux at every reaction complex. Here is the law of mass action monomial. This is stronger than balancing net production of each chemical species, but does not require pairwise detailed balance between reverse chemical reactions. A directed cycle can have nonzero circulation while satisfying complex balance.
Continuous-time Markov chain Created 2026-09-24 Updated 2026-11-05
A Continuous-time Markov chain on a finite or countable state space is specified by transition rates for , with finite total exit rate . At a state with , it waits an exponential time of rate and then moves to with probability . A state with is absorbing: it has infinite holding time rather than a zero-rate exponential waiting law.
Its transition-rate matrix is , with off-diagonal entries and diagonal entries , so each row sums to zero. The rates describe first-order transition probabilities: for . On a finite state space, the transition semigroup is and explosion is impossible. On a countably infinite state space, finite individual exit rates do not alone exclude infinitely many jumps in finite time; nonexplosion must be checked separately.
For two states with rates and , the mean holding times are and . Detailed balance gives Stationary distribution , and
This starts at one and relaxes to the stationary mass of state zero. Changing holding rates can preserve an embedded jump chain while changing the proportions of elapsed time spent in its states.
Destination-dependent reset chain Created 2026-10-14 Updated 2026-11-05
For jump rates when , assume and . The positive-rate states form the unique Closed communicating class; every zero-rate state is an open singleton. The stationary law is , with Detailed balance . When at least two rates are positive, the embedded jump-chain law is proportional to . With only one positive rate, that state is absorbing and the genuine sequence of jump times stops there; an extended discrete chain can use an absorbing self-loop.
Detailed balance Created 2026-09-24 Updated 2026-11-05
For a Markov chain with transition matrix , Detailed balance with a probability distribution means
The left side is the equilibrium Probability of the directed transition ; Detailed balance equates it to the reverse flow. Summing over gives , so Detailed balance implies stationarity. Under the stationary initial law, repeated application of the pairwise identity equates a finite path's Probability to that of its reversal, establishing reversibility.[ref]
For example, take
The off-diagonal flows are both , which verifies Detailed balance and the Stationary distribution directly. A directed three-state cycle has a uniform Stationary distribution but no reverse transitions, so it is not reversible. Stationarity alone therefore does not imply Detailed balance, and Detailed balance alone does not imply rapid convergence.
Detailed balance for a continuous-time Markov chain Created 2026-10-03 Updated 2026-11-05
For a continuous-time Markov chain with transition rates , Detailed balance is
for every pair of distinct states. A probability distribution satisfying these equations is an invariant distribution of a continuous-time Markov chain, because summing over incoming rates gives . Under the standard nonexplosion assumptions, the equilibrium chain is reversible.
A single-coordinate Gibbs sampler update preserves the remaining coordinates and independently redraws the selected coordinate from its full conditional distribution. The joint measure of old and new states factors into a marginal and two identical conditional factors, making it symmetric. A fixed-probability mixture of such kernels therefore satisfies detailed balance.
Detailed balance without rapid convergence Created 2026-10-25 Updated 2026-11-05
Detailed balance does not imply that a Markov chain is an irreducible Markov chain: the identity transition matrix is reversible for every probability distribution. Even for an irreducible Markov chain with aperiodicity, the two-state matrix with diagonal and off-diagonal , , has uniform stationary distribution and nontrivial eigenvalue . From either fixed state its total variation distance after steps is , so convergence can be arbitrarily slow. Invariance, reachability and mixing time are distinct questions.