Accidental coincidence 2026-10-18
Suppose two independent background streams follow Poisson processes with rates and . Define a coincidence by : is the full accepted time-difference width. Around each first-counter signal, the expected number of second-counter signals is . The expected pair rate is therefore . A circuit producing at most one output per first signal instead gives
The distinction matters when multiple detections occur in one window. If a different convention accepts , its full width is and the dilute expression is .
For a chosen numerical model, take background rates , and . The dilute pair rate is . These are stipulated teaching inputs, not measurements of the historical chamber.
Making smaller also rejects some genuine events. Suppose true pairs arrive at rate before the timing cut, and their time difference has a centered normal distribution with standard deviation . Its accepted fraction, using the error function, is
For chosen and , the window retains about of true pairs. In the dilute background model the fraction of accepted events that are true is . A narrow window trades detection efficiency against background; it does not make either quantity equal to one. Delaying one counter's signal far beyond genuine event correlations gives a proposed background check under stationarity, without assuming that the zero-delay excess itself is accidental.
An atomic displacement probability level is the fraction of modeled positional probability enclosed by an atomic displacement ellipsoid. It specifies the size of the drawn surface for a given anisotropic atomic displacement parameter; changing the level does not change the fitted displacement matrix.[ref]
For a centered three-dimensional normal distribution with positive-definite Cartesian covariance matrix , define
The variable has a chi-squared distribution with3 degrees of freedom. To enclose probability , choose satisfying and draw . If are the eigenvalues of , its semiaxis lengths are .
An explicit calculation uses the cumulative distribution function
where is the error function. Solving gives ; for , .
For an original comparison, keep . The50% semiaxes are approximately0.154,0.308 and0.461angstroms. The90% semiaxes are approximately0.250,0.500 and0.750angstroms. Every semiaxis grows by the same factor, about1.625, although the underlying directional spread is unchanged.
This also explains why a surface drawn at one root-mean-square displacement in each principal direction, , encloses only about19.9% in three dimensions. The probability inside a three-dimensional ellipsoid differs from the probability inside a one-dimensional standard-deviation interval. Comparisons of displayed atomic sizes therefore need the stated probability levels as well as the displacement parameters.
Brownian motion Created 2026-09-24 Updated 2026-10-14
Standard one-dimensional Brownian motion is a real-valued stochastic process on a probability space with three defining properties: almost surely; its sample paths are continuous almost surely; and its Brownian increments over any finite collection of disjoint time intervals are independent, with
Here denotes the normal distribution with expectation and variance . The alternative symbol denotes the same kind of stochastic process. Continuity is a simultaneous statement about an entire sample path, rather than a separate assertion at each fixed time. Relative to its natural Brownian filtration, a future Brownian increment is independent of all observations up to its starting time.
The normalization gives , so the standard deviation of a Brownian increment over duration is . For , , and , the corresponding standard deviations are , , and . Time becoming one hundred times shorter makes typical displacement ten times smaller. Brownian scaling expresses this rule for the whole stochastic process, while the Brownian covariance kernel describes how positions at different times remain related despite independent increments.
For a concrete probability calculation, let be the cumulative distribution function of . At time four, has that normal distribution, hence
These numbers can be reproduced using the error function: . In particular, zero expectation does not mean small displacement: , but the same fixed interval contains only about of the probability at time four.
The probability density function of , for , is
Its partial derivatives satisfy
Thus the normal distribution spreads according to the heat equation. Starting at a fixed position replaces by . This is a useful bridge between individual random trajectories and the deterministic evolution of their probability density function: the same Brownian motion provides both descriptions.
Physical diffusion uses its own scale. For constant diffusion coefficient , the position model has variance , and its probability density function satisfies . For example, gives displacement variance after four seconds, hence standard deviation . Standard Brownian motion corresponds numerically to in chosen units; omitting the factor two changes the physical convention. Einstein's 1905 paper relates diffusion to the mean squared displacement in precisely this convention. [ref]
Continuity does not supply a smooth physical velocity. The difference quotient has normal distribution , so its standard deviation grows as : for the three durations above it is , , and . This calculation motivates the nowhere differentiability of Brownian motion, but it alone is not a proof of the simultaneous assertion at every time. The theorem says that, with probability one, no finite derivative exists anywhere along the sample path. A drawn polygon only displays a finite grid; its straight segments cannot establish this theorem. See Theorem 7.1.6 in Probability: Theory and Examples (fifth edition) by Rick Durrett.
For physical particles, Brownian motion is a model of position on suitable observation scales. It does not claim that microscopic velocity is a derivative of this idealized path. Einstein explicitly restricts his assumption of independent increments to intervals that are not too short. [ref]
Another way to measure the roughness is quadratic variation. On , divide time into equal intervals and form
Writing each Brownian increment as with independent standard normal random variables gives . Since and , the variance of is , and
This proves mean-square convergence to along uniform partitions. For and , the expectation is , the variance is , and the root mean square of the error is . For a general deterministic partition of an interval with lengths , the same calculation gives error variance , so shrinking the largest interval also suffices.
The resulting quadratic variation is , whereas the smooth function gives . This difference explains why the ordinary rules of calculus need the second-order correction in the Itô formula. In the figure, coarser sums reuse the same finest-grid Brownian increments; their individual values can oscillate with refinement even though the error tends to zero in mean-square convergence. Refining a fixed interpolating polygon forever would instead give zero quadratic variation, so the finite-grid illustration must not be confused with the limiting Brownian motion.
Historically, Brown's 1828 report describes microscopic observations made in 1827, starting with particles released from pollen and extending to inorganic materials; this challenged an explanation based solely on living matter. His observations and the later mathematical model are distinct contributions. [ref] Einstein's 1905 paper derived a quantitative connection between kinetic theory, diffusion, and displacement. [ref] Wiener's 1923 Differential-Space developed integration on spaces of paths, a foundation for Wiener measure; it also acknowledges earlier work and his own previous papers. These dates mark documented contributions rather than an assertion that each subject had a single discoverer. [ref]
Complementary error function Created 2026-10-05 Updated 2026-10-14
The complementary error function describes the Gaussian integral area remaining beyond the endpoint. For a real ,
It is an entire function for complex arguments when defined by . On the real line it decreases from two to zero, with and .[ref]
For example, is a sizeable tail, whereas is extremely small. In the tested floating-point arithmetic, a direct evaluation of gives zero because the computed error function has already rounded to one. Evaluating the complementary error function directly preserves this tail. It is the useful quantity in an upper-tail normal distribution probability and in the decaying side of an error-function diffusion front.
For large positive real , the leading asymptotic expansion is
The first corrections are multiplying the leading term. This is an asymptotic expansion, not an assertion that summing arbitrarily many terms converges at a fixed .[ref] The complementary error function tail bound provides finite- inequalities instead.
For a diffusion-controlled mushy layer of constant solid fraction , a sharp moving edge reduces the thermal heat equation to and the exterior solute diffusion equation to , where is the Lewis number. Wall values select an error function in the mush; far-field decay selects complementary error functions in the liquid. Continuity fixes their amplitudes in terms of the interfacial temperature and . The Stefan condition, solute conservation and marginal equilibrium at a mush-liquid boundary give three algebraic/transcendental equations for these two constants and . Derivation follows by and , followed by one integration . Dividing interface equations can discard degenerate branches, so the undivided equations must be retained when a denominator vanishes. Physical admissibility additionally requires and .
Error function Created 2026-09-24 Updated 2026-10-14
The error function records the signed area under a Gaussian function between zero and a variable endpoint:
For a negative real number , reversing the integration limits makes this integral negative. The normalization uses the Gaussian integral: the full area of is , so its positive half contributes one after multiplication by . The same definition extends to a complex number along any path from zero to , giving an entire function.[ref]
For example, , , and . A finite positive endpoint captures only part of the positive Gaussian integral; approaches one as but never reaches it at a finite real .
Figure 1.
The error function turns signed Gaussian area into a bounded increasing curve
. Original computed real-axis curves. Blue shading represents integration from zero to ; orange shading represents the reversed integral from zero to . The right panel displays their signed values after normalization, not a probability density. Details.
The useful idea is to name a recurring integral once instead of carrying it through every calculation. The error function and the normal distribution express probabilities and quantiles through this area, while an error-function diffusion front describes how diffusion smooths a sharp jump. The complementary error function retains the small area left in the tail.
The fundamental theorem of calculus gives
Thus the real-axis error function is strictly increasing, with values in . Its integrand is an even function, so the error function is an odd function, . The derivative also gives : the curve is concave for and convex for . These real-axis properties do not imply boundedness throughout the complex plane; the existing quadrant asymptotics of the error function describe a different behavior in other directions.
For a standard normal random variable , its standard normal distribution function is
The change of variables and the symmetric distribution of the standard normal random variable give the second expression. For with , standardization of a normal random variable then gives
In particular, the intervals within one, two, and three standard deviations have calculated probabilities about , , and . These values depend on a normal distribution; they are not universal coverage guarantees for an arbitrary random variable. This is the direct connection between a Gaussian function area and the familiar central intervals.
For a small upper-tail probability, use the complementary error function directly:
Computing this as instead can lose the tail to catastrophic cancellation. The Gaussian tail bound gives another useful estimate without requiring an exact error function value.
Consider the one-dimensional diffusion equation on the whole real line,
with initial value one for and zero for . This is an idealized Heaviside step function profile, not a measured material or an apparatus specification. The heat kernel gives a convolution with the initial profile:
The change of variables turns the convolution into a Gaussian integral tail. The resulting similarity variable shows that the transition width grows like : multiplying elapsed time by four doubles every fixed-profile distance from the original interface.
Figure 1.
Diffusion smooths a step while preserving its similarity profile
. Exact model curves for a unit jump with stipulated in consistent length and time units. Left: the transition broadens at , , and . Right: plotting each against collapses all three onto the same curve. No experimental measurements are plotted. Details.
At every positive time, , while as and as . For every fixed , the limit as returns the specified initial value. The value assigned at the single initial discontinuity does not change this convolution. The error function therefore explains smoothing without pretending that a discontinuous initial profile remains sharp.
Direct differentiation checks the partial differential equation. Writing gives
The model assumes constant diffusion coefficient, no advection, and no finite-domain boundary effects. For an interpretation as heat conduction, the heat equation applies to a normalized temperature difference under its own material assumptions.
Error-function isobaric cooling front Created 2026-10-14 Updated 2026-11-05
For conductivity , no cooling in the hot phase and a zero-temperature boundary at , the mass-coordinate equation is linear diffusion. Its similarity profile solves , , , giving the displayed error function. The thermal layer broadens as the square root of time. Conducted energy enters the cold radiating reservoir at rate per area , hence .
Faddeeva function Created 2026-10-05 Updated 2026-10-14
The Faddeeva function is an entire function built from the complementary error function. Its integral representation for is , as normalized in NIST's integral representation. Its reflection identity is , directly from the odd function property of the error function.
Gaussian integral Created 2026-09-24 Updated 2026-10-20
The Gaussian integral gives the exact area under a Gaussian function. For a positive real number ,
This is a finite improper integral over the whole real line. For example, and . Increasing from one to four narrows the curve and halves its area, while its height at zero stays one. The change of variables explains the factor .
Figure 1.
Narrower Gaussian curves have less area unless their height is adjusted
. Left: the full-line areas of and are and . Right: multiplication by makes both areas one. Shading shows the plotted finite interval; the stated areas refer to the whole real line. Details.
The useful consequence is an exact normalization. For and any real center ,
This is a probability density function for a normal distribution with expected value and variance . A narrower probability density function must be taller to keep total probability one. In the usual notation , the prefactor is , where is the standard deviation.
The same area calculation makes the one-dimensional heat kernel
integrate to one in , with the diffusion coefficient. A spreading Gaussian function can therefore preserve total mass while its height falls. This links the Gaussian integral with both the normal distribution and the diffusion equation.
Finite intervals lead to the error function, rather than this single constant:
The complementary tail is described by the complementary error function. These definitions and their real-axis limits are given in the NIST reference. [ref]
The polar-coordinate proof of the Gaussian integral explains why appears in an integral of a function defined on a line: squaring its area creates a rotationally symmetric integral on a plane. Substitution also gives , connecting the result with the gamma function.
Gaussian interval mass Created 2026-10-06 Updated 2026-10-07
The normalized Gaussian mass of an interval is
It is the convolution of an interval indicator with the heat kernel, and has an error function representation. As the variance tends to zero it converges to the interval indicator away from its endpoints, with value one half at an endpoint. This is a concrete approximate identity.
For the upper-pole integral , let and . Scaling gives at leading order. At its indentation is . Differentiation with respect to gives , so integration gives the displayed error function. This is an optimal truncation transition; the underlying analytic integral has no literal discontinuity. The general mechanism is discussed in the DLMF account of Stokes smoothing.
The Gaussian pulse time-gate energy fraction is the share of an isolated pulse's laser pulse energy admitted by a finite time window. The result below acts on incident optical radiant power. Let be the power full width at half maximum, and first place the pulse centre and the detection time gate centre at zero.
A detection time gate need not collect the whole pulse. Integrating the same profile only over gives the Gaussian pulse time-gate energy fraction
where is the error function. A gate as wide as the power full width at half maximum collects only , or 76.10% of the pulse energy. The pulse has nonzero Gaussian tails outside that interval. A real readout's impulse response can extend the required integration window further.
Alignment adds a parameter. Let the pulse centre be , the gate centre be , and write the Gaussian gate centring error as . Put . Integrating the normalized Gaussian pulse profile over the gate gives
At the two error function terms reduce to the centred formula above. With and , the captured fraction drops to . The pulse centre then lies on a gate edge. Merely keeping the gate width fixed does not keep its collected energy fixed.
The gate works best when centred. With the centred energy-normalized pulse profile and , differentiation of gives
A Gaussian function is an even function about its centre and decreases with distance from that centre. Thus for , and symmetry gives the opposite sign for . The same argument proves that a centred interval maximizes mass for an even unimodal density; unimodality supplies the required monotonicity.
A centred gate of width captures of the energy. Solving gives for 99% capture in this ideal model. The requirement changes if the centring error is nonzero.
Figure 1.
Original Gaussian pulse gate model: width and timing offset jointly determine captured energy.
Details.
Pulse timing jitter can therefore create variation in gated energy even when every full pulse has the same . A wider gate reduces this loss but also changes admitted background and the chance of including neighbouring pulses. Measure the timing and detector response associated with the chosen gate.
For a detector modeled as a linear time-invariant system, its recorded waveform is a convolution of the optical input with its impulse response. NIST tested avalanche photodiode radiometers with roughly optical pulses, recorded their responses with an oscilloscope, and convolved measured responses with longer Gaussian inputs to estimate corrections. The detector and amplifier were characterized together.[ref] A gate applied to that electrical waveform must use the readout model rather than assuming the optical fraction is unchanged.
Gaussian saddle coalescing with a simple pole Created 2026-10-06 Updated 2026-10-14
For , the factor has saddle scale and becomes . If the amplitude has a simple pole there, its leading local integral contains . Differentiating its Cauchy principal value with respect to reduces it to a Gaussian integral, producing an error function. The nonsingular amplitude gives .
Heat-kernel solution Created 2026-09-24 Updated 2026-10-14
For initial data on the real line, Fourier transformation or convolution with the fundamental solution gives
For a bounded function , the convolution is well defined at every positive time because the heat kernel has integral one. The error-function diffusion front uses a Heaviside step function initial condition and gives one smoothed interface. The heat equation with interval-indicator initial data instead has two interfaces; subtracting their two error functions produces the finite-interval profile.
Interior layer at a simple zero of advection Created 2026-10-05 Updated 2026-11-05
A simple zero of an advection coefficient can support an interior layer. For the specific homogeneous equation
set . The two derivative terms then have the same order, giving . Hence and
connects and . Its physical width is . More generally, , in gives the same width, while the sign of determines whether the nonconstant Gaussian derivative decays.
An order-one reaction term cannot be hidden in this balance: adding gives the leading inner equation . An arbitrary pair of constants need not match that equation. The error function connection above requires the extra terms to vanish or be negligible at leading order; reversing diffusion also changes the bounded matching structure.
Inverse error function 2026-10-14
Because the real error function is strictly increasing from to , its real inverse function maps onto the real line. For , the standard normal quantile is therefore
More generally, the -quantile of a normal distribution with expected value and positive standard deviation is . This reverses the area calculation: instead of asking how much probability lies below an endpoint, a quantile asks which endpoint encloses a specified probability. The domain restriction matters; and correspond to infinite endpoints, rather than finite real values of the inverse error function.
Neumann solution of the Stefan problem Created 2026-09-24 Updated 2026-09-24
The Neumann solution places a planar phase boundary at . Similarity reduction of the heat equation gives temperature profiles in terms of the error function, while the Stefan condition determines implicitly.
Nico M. Temme Created 2026-10-13 Updated 2026-11-05
Nico M. Temme studies the asymptotic analysis and numerical methods for evaluating of special functions. His work includes asymptotic expansions for integrals and computational methods for functions such as the error function. The NIST Digital Library of Mathematical Functions credits him with chapters on numerical methods and several special function families.[ref]
Figure 1.
Portrait of Nico M. Temme
. Photograph identified on the NIST DLMF profile.