Probability density
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Sampling where the answer lives
Monte Carlo error cannot be made to fall faster than the square root, so the only thing left to attack is the constant in front of it. Drawing points where the integrand is large, and dividing by how often they were drawn, leaves the answer alone and can shrink the noise many times over.
A walk that samples a distribution
When a distribution can be evaluated but not drawn from, a wandering point can be arranged to visit each state as often as its weight says. The rule needs no normalising constant, compares two weights and steps or stays.
Named alongside it
The objects these essays reach for when they reach for this one.
Monte CarloSamplingConvergence rateDetailed balanceEigenvectorEstimator biasExpectationImportance samplingIndependenceIntegralMarkov chainMetropolis algorithm