The arithmetic mean of memory access latencies. Suppose each read completes before the next begins, every cache hit costs , and every cache miss costs , with the same additional cache miss penalty . If is cache hit rate and is cache miss rate, the weighted arithmetic mean is
The common lookup cost is paid on both outcomes. This additive assumption matches the simple model in Beyond Physical Memory: Policies (§22.1, equation 22.1, pp. 1–2), where main computer memory acts as a memory cache for memory pages backed by disk; here the same accounting is applied to a toy data memory cache.
Assign synthetic values and . The twelve-read, two-slot fully associative cache example has five cache hits and seven cache misses, giving
With four cache slots, its four compulsory misses instead give . This comparison holds the timing costs fixed as capacity changes, which is a model assumption rather than a hardware promise.
If a problem supplies a total miss time , use ; adding to again would count lookup twice. Variable cache miss penalties, multiple consulted levels, or overlapping requests require a richer timing model. Real CPU work can overlap a pending read, so this arithmetic mean cannot by itself predict program speed or stall time. [ref]
Expected value Created 2026-09-24 Updated 2026-10-18
An expected value is the probability-weighted arithmetic mean of a real-valued random variable. On a probability space , its general definition is the Lebesgue integral
where is the probability distribution of . For an integrable random variable, this is a finite real number. With a probability mass function , use ; with a probability density function , use . These are two ways of computing the same weighted average, rather than different definitions for different experiments.
For example, suppose takes the values with probabilities . Then
The most likely outcome is , and is not a possible outcome at all. The expected value summarizes all outcomes and their weights; it need not predict the result of one trial. Geometrically, placing masses equal to the probability masses at the outcome positions gives a center of mass at , since . This balance-point interpretation also explains the connection to a weighted arithmetic mean. [ref].
For the dimensionless random variable with probability density function on , the expected value is . Integrating the probability density function itself gives one; to compute the expected value, multiply by the outcome first. [ref].
Figure 1. . The left panel's dashed line marks , even though the only possible outcomes are . In the right panel, the shaded area under is ; the area under the dashed probability density function is one. Both examples use dimensionless outcomes. Details.
Why is this useful? Linearity of expectation lets us compute an average total by adding average contributions, even for dependent random variables. And for independent and identically distributed integrable random variables, the strong law of large numbers says their sample mean approaches their common expected value almost surely. The theorem supplies the link to repeated observations; the weighted-average definition itself does not promise that any particular finite run will be close to the expected value.
There is a useful historical connection to valuing uncertain rewards. In his 1657 De ratiociniis in ludo aleae, Christiaan Huygens assigns the value to equally likely rewards , and when they have equally likely chances. These are the finite weighted-average formulas for expected value. His opening discussion asks how to divide the stakes when a game stops before completion, connecting probability to a concrete question about an unfinished contest. [ref].
Isotopic abundance 2026-10-14
An isotopic abundance is an atom fraction within a specified population of one chemical element.[ref] If counts its chemical atoms of isotope , use
The denominator includes every isotope of that chemical element included in the stated population, not every chemical atom of every chemical element in the sample. Thus an oxygen atom fraction among all chemical elements is a different quantity.
For an illustrative neutral neon population, take the displayed central isotopic abundances , , and from the reference table, so . Its mean atomic mass is the weighted arithmetic mean
These are rounded reference inputs with uncertainties, not exact universal isotopic abundances; the long decimal shows their arithmetic result, not measurement precision.[ref]
The population convention matters. If instead is the fraction of total neutral-atom mass supplied by isotope , then and
This is a weighted harmonic mean in the mass fractions. Using with those mass fractions would answer a different question. The conversion follows directly by counting chemical atoms and adding their masses.
Mixing calorimetry Created 2026-10-14 Updated 2026-10-20
Mixing calorimetry determines heat capacities by bringing bodies at different temperatures into thermal contact. The striking feature is that the final temperature is a weighted arithmetic mean with heat capacities as weights, rather than weights given by mass. The vessel participates in the exchange even though it is not the sample being studied.
For a hot nonreacting sample of mass , initial temperature and unknown specific heat capacity at constant pressure , let receiving water have mass , initial temperature and known specific heat capacity at constant pressure . Let the vessel and immersed parts start at and have combined heat capacity , excluding that water. Assume a common final temperature , approximately constant pressure and heat capacities, no phase transition, no chemical reaction and negligible external nonexpansion work. For signed outward heat loss , the combined enthalpy balance is
Hence
The loss is positive if the room receives net heat, negative if the room supplies it. If the vessel starts at a different temperature , replace its warming term by ; do not assume the vessel shared the water's initial temperature. For variable material properties, replace each by the corresponding integral and each vessel term by . The inferred constant then represents an average over the sample's cooling interval.[ref]
For a synthetic no-loss example, mix of hot water at with of cold water at in a vessel initially at . Stipulate and . The enthalpy balance gives
The hot water releases : the cold water receives and the vessel . Omitting the vessel predicts , despite perfect insulation. These are computed numbers from stipulated properties, not laboratory observations.
Figure 1.
The vessel changes the mixing temperature by sharing the heat transfer
. Original computed no-loss water example. Left: transfers sum to the hot portion's released heat. Right: increasing the initially cold vessel's heat capacity lowers the common final temperature; the marked point uses . Each vessel setting is a separate modeled experiment. Details.
For an unknown-sample example using the same cold water and vessel, stipulate , and . With no loss, . Inverting the full balance returns ; ignoring vessel storage returns about . With a positive outward loss, ignoring that loss also biases the inferred downward under these hot-sample conditions. A small water temperature rise makes sensor offsets and loss estimates relatively influential; propagation of uncertainty must include the measured temperatures, masses and calibrated vessel term.
Dividing two extensive quantities with the same replication factor produces an intensive quantity:
Division by volume gives a density, such as mass density or energy density . Division by mass gives a specific quantity, such as specific internal energy or specific volume . Division by amount of substance gives a molar quantity, such as molar volume . Their units are respectively , , , and . The denominator must be stated: “per particle”, “per mole” and “per unit mass” are different normalizations.
For a hypothetical uniform parcel with mass , volume and internal energy relative to a specified reference, and . Three independent copies have , and ; both ratios remain unchanged. This permits comparison of materials without confusing the amount tested with the state tested.
If and are additive but the parcels have different , their composite ratio is a weighted arithmetic mean:
The denominator supplies the weights: specific internal energy uses mass weights, while mass density uses volume weights. This identity is accounting for the specified subsystems; predicting a new state after mixing also needs the relevant equation of state.
Figure 1.
Size changes extensive inventory; composite density weights each parcel by its volume
. Details.
This deliberately synthetic differential equation model illustrates response direction and lag. Every plotted number is chosen for teaching; none is a biological measurement or a fitted human parameter. Let externally prescribed, dimensionless represent a glucose stimulus relative to a reference. Let and be normalized insulin and glucagon response variables, with independently chosen time constants and in arbitrary time units:
Here rises and falls with . Their targets add to one by construction; the evolving need not equal one because their time constants differ. Start with and . Set from to , from to , and otherwise. Within a constant-input interval beginning at , the exponential decay solution is
Each response is a continuous function of time even when the imposed stimulus jumps. The chosen starting values stay between zero and one, since each solution is a weighted arithmetic mean of its interval's starting value and target.
Figure 1.
Synthetic insulin and glucagon responses to imposed glucose steps
. Original illustration of the synthetic insulin-glucagon response model. All curves are constructed examples in arbitrary units. Top: imposed dimensionless stimulus. Middle: responses with unequal time constants. Bottom: illustrative liver release and tissue uptake tendencies, which do not determine the imposed stimulus. No experimental data or clinical ranges are represented. Details.
For an illustrative downstream comparison, define release tendency and uptake tendency , in the same arbitrary flux units. At the reference target, . At the high-stimulus targets, and ; at the low-stimulus targets, and . These chosen functions encode greater uptake with insulin and greater release with glucagon, moderated by insulin; they are not established enzyme kinetics. The trace is imposed externally, so the figure does not demonstrate self-correction of blood glucose. A closed model would also need a conservation of mass equation, nutrient input, finite glycogen stores, and additional tissue interactions. The qualitative restoring loops are shown separately in the insulin circuit.
Tail probability Created 2026-10-03 Updated 2026-10-14
For a real random variable , an upper-tail probability has the form and a lower-tail probability has the form . Each is the probability of an event lying beyond a chosen threshold in one direction. A tail probability need not be small: the threshold determines how much of the probability distribution it includes. A concentration inequality bounds such probabilities, often for deviations from an expected value.
Endpoint conventions matter. Write for the cumulative distribution function and . The complement rule of probability gives four distinct formulas:
The strict upper-tail convention is the survival function . Its value differs from the inclusive upper tail probability by exactly the probability mass at the threshold:
A singleton with positive probability mass is an atom of a measure. Thus excludes an atom of a measure at , whereas includes it. These endpoint identities follow directly from the cumulative distribution function properties in Kyle Siegrist, Distribution and Quantile Functions: endpoint probabilities and right tails.
As the threshold increases, both upper tail probabilities are nonincreasing functions. The strict survival function is a right-continuous function; the inclusive upper tail probability takes the upper endpoint value at a downward jump, equal to the left limit of the survival function. Both tend to zero as for a real random variable, but the speed of that decay differs across probability distributions. The cumulative distribution function properties and their proof from continuity of probability measures are given in MIT 6.436J, Lecture 4: random variables and cumulative distribution function properties.
For a fair six-sided die , the discrete uniform distribution assigns probability mass to each of . At threshold four,
Between four and five, both upper tail probabilities equal . At the largest possible outcome the distinction is especially visible: , but . The diagram shows exact probabilities for this mathematical model; its dots specify which endpoints belong to each step function.
Figure 1.
Exact fair-die probabilities: including or excluding a threshold changes the tail by one atom
. Details.
If a probability distribution has a probability density function , then every singleton has zero probability mass and
For an exponential distribution of rate two, for and zero otherwise, so for and for . Hence . This tail probability is an integral of the probability density function, not its height . A mixed probability distribution retains endpoint jumps even with a smooth component: give zero probability mass and choose this exponential distribution with probability . Then , , and for .
A two-sided tail probability can measure the absolute value of displacement from a specified center . For , the two extreme events are disjoint events, so
For strict displacement , replace the last expression by . The condition prevents overlap; at adding inclusive tails double-counts any probability mass at . For a uniform distribution on , take and : the two tail probabilities are each and their sum is . Equal tails follow from this symmetric probability distribution, not from the phrase two-sided alone; for a uniform distribution on with , the two tail probabilities are zero and .
The tail-sum formula for expectation turns a whole curve of tail probabilities into an expected value. For any nonnegative random variable , without assuming a probability density function or a finite expected value,
For a proof outline, write pointwise and exchange the expected value and Lebesgue integral using Tonelli theorem; is an indicator function. The inclusive version has the same Lebesgue integral: positive probability masses occur at only a countable set of thresholds, which has Lebesgue measure zero. For a nonnegative integer-valued random variable , the tail-sum formula instead gives . The integer hypothesis is essential for these sums. The integral identity, its indicator function proof, and the integer version appear in Kyle Siegrist, Additional Properties of Expected Value: integration and summation of right tails.
For the fair die, this tail-sum formula yields , equal to the direct weighted arithmetic mean . For the rate-two exponential distribution, the area under the survival function is , its expected value. The first panel below shades an integral of the probability density function for a single threshold; the second shades an integral of the survival function across all nonnegative thresholds. These are analytical illustrations, with the displayed curves truncated at three; their exact total areas use an infinite integration range.
Figure 2.
Exponential model: one tail probability is density area, while expectation is total survival area
. Details.
Nonnegativity is essential to interpreting the upper tail probability area as : for a general real random variable that area equals the expected value of its positive part. An integrable random variable satisfies , subtracting the expected value of its negative part; infinite terms cannot be canceled. Even when is finite almost surely, its expected value can be infinite. For the shape-one Pareto distribution on , on and for , so the area is . The finite versus infinite expected value distinction is illustrated in Kyle Siegrist, Definitions and Basic Properties: exponential and Pareto expected values.
Why are tail probabilities useful? They answer threshold questions directly, and a concentration inequality can bound them without knowing the full probability distribution. For nonnegative with finite expected value, Markov inequality gives for : a large threshold relative to the expected value forces rarity. The quantile function reverses the question by choosing a threshold for a prescribed cumulative level. If with , then ; an atom of a measure may prevent equality. For the die, , with strict upper tail probability zero and inclusive upper tail probability .
A tail probability describes rarity under a specified probability distribution; it is not automatically a conditional probability after extra information. For with ,
because the threshold events are nested. Thus the die has but . Conditioning changes the sample space and renormalizes its probability measure; the same extreme outcomes can become common in that restricted population.
Weighted arithmetic mean Created 2026-10-03 Updated 2026-10-14
The weighted arithmetic mean combines values according to how much each contributes to the quantity being summarized. For a finite list of real numbers and nonnegative weights with , define
Zero weights ignore an entry; at least one weight must be positive. Multiplying every weight by the same positive number leaves the result unchanged. Writing makes the weighted mean a convex combination, since and . It therefore lies between the smallest and largest input values. [ref]
For example, give the values and weights and :
The larger weight pulls the result closer to . The balancing identity
explains a geometric interpretation: if the weights were masses placed at positions , the weighted mean would be their center of mass. Here , so the two sides balance even though their distances from the mean differ.
Weights need an interpretation. They can represent numbers of observations, masses, or probabilities in a finite probability distribution. These meanings lead to the same formula, while answering different questions. For instance, combining means of groups uses group sizes as weights to recover the mean over individual observations. For a function and nonnegative weight function , the analogous integral is , provided is integrable and the total weight is positive and finite.
Weighted geometric mean 2026-10-14
For positive real numbers and nonnegative weights with , the weighted geometric mean is
It takes a weighted mean of logarithms. A zero weight excludes that input; equal weights give the ordinary geometric mean. If occurs times in a list of total length , its correct weight is . For the list ,
and replacing all four entries by preserves the product .
There is also an optimization interpretation. A logarithmic transformation turns multiplicative discrepancies into additive ones. For a positive representative , the weighted mean minimizes squared deviations identity gives
Thus uniquely minimizes weighted quadratic loss in logarithmic coordinates. The weighted arithmetic mean minimizes squared discrepancies in the original coordinates. These two objectives explain why different choices of what constitutes an error select different summaries.
The strictly concave function and the reversed Jensen's inequality give , where is the weighted arithmetic mean. Apply the same reasoning to the multiplicative inverses to get for the weighted harmonic mean. Thus ; equality holds exactly when all positive-weight inputs agree. For this list, , , and . The weights specify which inputs are represented and must stay the same across the comparison.
Weighted harmonic mean 2026-10-14
For positive real numbers and nonnegative weights with , the weighted harmonic mean is
Equal weights give the harmonic mean, while a zero weight excludes that input. For travel at positive constant speeds over positive leg lengths , the weights are fractions of total distance:
For at and at , the weights are , elapsed time is hours, and the average speed is . Weighting the speeds by their time fractions instead gives the same result as a weighted arithmetic mean: . The two weight systems describe the same journey in different coordinates and must not be interchanged. [ref].