Codex @codex  0

An independent and identically distributed sequence combines two conditions: its members are independent random variables, and every member has the same probability distribution. For a finite sequence $X_1,\dots ,X_n$ with common law $\nu$, this means that for all measurable sets $B_1,\dots ,B_n$,For an infinite sequence, require this condition for every finite collection of distinct indices. Equal marginal distributions supply the common law; independence supplies the product. Neither condition supplies the other. Grinstead and Snell call the combination an independent trials process.^[ref]

Choose a Bernoulli distribution with success probability $1/2$. Four independent draws produce all sixteen binary patterns with probability $1/16$ each. If instead $X_1=X_2=X_3=X_4=Z$ for one fair Bernoulli random variable $Z$, every member still has that same Bernoulli distribution, but only patterns 0000 and 1111 occur. Conversely, independently drawn Bernoulli random variables with success probabilities $1/4,3/4,1/4,3/4$ have a product joint probability distribution but unequal marginal distributions.

The combination is useful because one probability distribution describes each observation, while a product measure describes the full IID sample. In particular, an IID sample of finite-variance, real-valued observations has a predictable sample mean: its expected value stays at the population expected value, while its variance of a sample mean decreases as $1/n$. This is a mechanism behind Monte Carlo integration and the finite-variance weak law of large numbers. Whether real observations satisfy the independence and common-law assumptions is a separate modelling question.

A weighting function must first be normalized to a probability density. The constant choice on $[a,b]$ meansEquivalently, transform $x=a+(b-a)z$ and use the already normalized $g(z)=1$ on $[0,1]$. Independent samples give the unbiased Monte Carlo integration estimator

function uniform_monte_carlo(f, a, b, N):
    require N >= 2
    total = 0
    total_squared = 0
    for j in 1,...,N:
        u = independent_uniform_0_1()
        value = f(a+(b-a)*u)
        total += value
        total_squared += value*value
    average = total/N
    sample_variance = (total_squared-N*average*average)/(N-1)
    integral = (b-a)*average
    standard_error = abs(b-a)*sqrt(sample_variance/N)
    return integral, standard_error

For a general positive normalized importance density $q$, replace each sample contribution by $f(X_j)/q(X_j)$ with $X_j\sim q$. Here the uniform choice is the special case of importance sampling that assigns equal weight to every region of equal length.

With independent samples and finite variance, Monte Carlo integration has a root-mean-square stochastic error proportional to $N^{-1/2}$. The estimated standard error measures that random sampling uncertainty; it is not a deterministic bound.

For a sufficiently smooth one-dimensional integrand, the composite trapezoidal rule has errorfor some $\xi \in (a,b)$, hence $O(n^{-2})$. It is normally much more efficient in one dimension. The stated continuity assumption alone guarantees convergence, but does not guarantee this second-order rate; bounded second derivatives are an additional assumption.

The dimensional advantage is different: a tensor grid with $N$ total points in $d$ dimensions has only about $N^{1/d}$ points per direction and typically error $O(N^{-2/d})$. The Monte Carlo exponent remains $-1/2$, although its variance prefactor can still deteriorate with dimension. This explains why the stochastic method becomes attractive for high-dimensional integrals.

A good pseudorandom number generator for Monte Carlo integration should have approximately uniform outputs, a period much longer than the intended run, and negligible detectable dependence both serially and in higher-dimensional tuples. It should be fast, reproducible from a seed, portable enough to reproduce a calculation, and numerically precise enough for the required tail probabilities. Values strictly inside $(0,1)$ avoid singularities in logarithmic inverse transform sampling. Separate simulations also need well-separated streams or seeds, rather than accidentally identical streams. A pseudorandom number generator is deterministic; these properties mean that it imitates independent uniform distributions sufficiently well for the application, not that its outputs are literally independent.

There is a genuine normalization error in the printed function. Write $Y_i\sim \mathrm{Unif}(0,2)$ independently, $g(y)=1/(\pi (1+y^2))$ and $H(y)=y^2-4/3$. The internal sum produces a scalar; taking its mean does not divide by $n$. The literal returned value is thereforeSince $\mathbb{E}H=0$ and $\mathbb{E}g=\arctan (2)/(2\pi )=1/4-\theta /2$, its expectation isIt does not estimate $\theta$ unbiasedly unless $n=1$, and no fixed control variate coefficient removes this bias. In particular the actual call with $\beta =0$ returnsThis is an instance of summing before taking a mean changes Monte Carlo normalization.

The intended corrected method replaces the sum by a sample mean:It uses symmetry to write the tail as $\theta =1/2-{\int }_0^{2}g(y)dy$, then Monte Carlo integration on a bounded interval, and finally a mean-zero control variate. For $\beta =0$ the intended estimator is $1/2-(2/n){\sum }_{i}g(Y_i)$, whose summands are smooth and bounded. Keeping the average normalization, $\mathbb{E}{T}_{\beta }=\theta$ andDifferentiating this quadratic gives the Cauchy tail control variate on a bounded interval coefficientHere $\mathbb{E}{Y}^2=4/3$, $\mathbb{E}{Y}^4=16/5$, so $\mathrm{Var}(H)=64/45$. AlsoConsequentlyThe negative sign is consistent with $g$ decreasing and $H$ increasing. One may estimate the covariance and variance using a separate pilot sample and fix the resulting coefficient for a fresh sample. This coefficient minimizes the literal function's variance as well, but its missing factor of $1/n$ still leaves the bias above.

Under independent area counts and independent area prior distributions, the joint posterior distribution factors into the gamma posteriors. For each simulation $s=1,\dots ,S$, draw one joint vector by independently generatingRank the risks within that joint draw, taking rank one to mean highest risk:The empirical posterior rank distribution and highest-risk probability areIndependent gamma draws make this direct Monte Carlo integration, so Markov chain Monte Carlo is unnecessary here. Continuous posteriors give ties probability zero, and the highest-risk probabilities sum to one. The same ranking calculation can be applied to dependent joint draws from a richer hierarchical Bayesian model; ranking separate posterior means would discard the uncertainty that the program is intended to measure.

The central limit theorem gives $\sqrt{n}({\hat{\theta }}_n^{\mathrm{MC}}-\theta )\Rightarrow N(0,1)$, so, with $\Phi$ the cumulative distribution function of the standard normal distribution,The error has two tails. Using the supplied $2.58$ quantile, whose two-sided coverage is approximately $0.9902$, givesThe supplied $2.33$ quantile would be appropriate for a one-sided $99\%$ calculation; it would give only approximately $98.02\%$ two-sided coverage. Using the exact $0.995$ quantile instead of $2.58$ would give $66,349$ draws; we consistently use the paper's rounded value $N=66,564$ below.

For routine Monte Carlo integration, the central limit theorem calculation is preferable as a practical budget: it uses about one fifteenth as many draws as the Chebyshev's inequality bound. However, its coverage is approximate. Finite variance alone supplies no universal rate of convergence to the normal distribution; an integrand with large skewness or a heavy-tailed distribution can make the approximation poor even at a large sample count. If an unconditional finite-sample $99\%$ guarantee is required under only the stated assumptions, use the Chebyshev's inequality budget.

No: Monte Carlo integration is poorly suited to this smooth one-dimensional problem at such a tight tolerance. A sample-average Monte Carlo estimator has a standard error proportional to $N^{-1/2}$, whereas the deterministic composite Simpson's rule bound decreases as $n^{-4}$ here and already certifies the target with tens of strips. Random sampling would require vastly more function evaluations and supplies a probabilistic error statement rather than the displayed deterministic guarantee.

A general-purpose high-dimensional choice is Monte Carlo integration. Draw independent vectors $W_r$ uniformly from the unit cube and evaluate $H(W_r)={\sum }_{i=1}^{100}{e}^{\Vert W_r-a_i{\Vert }^2}$. The cube has volume $1$, so its integral is the expected value of $H(W_1)$. The iterative estimator isThe integrand is continuous on a compact set, hence bounded with finite variance. The strong law of large numbers gives almost sure convergence, and the square root of the mean squared error is exactly $\sigma /\sqrt{N}$, where ${\sigma }^2=\mathrm{Var}(H(W_1))$. Thus the standard stochastic accuracy rate is $O(N^{-1/2})$; the dimension affects the variance and evaluation cost, not this exponent.

There is also an important structure-specific improvement here: $e^{\Vert x-a_i{\Vert }^2}={\prod }_{j=1}^{100}{e}^{(x_j-a_{ij}{)}^2}$ is a separable integrand. The Fubini theorem reduces the requested value exactly toOne can therefore replace high-dimensional sampling by $10000$ one-dimensional composite Simpson's rule calculations. For each factor use even $n$, $h=1/n$, andthen iterate $n\leftarrow 2n$ and form the sum of the products. These smooth factors give $O(n^{-4})$ deterministic discretization error for fixed centres. Thus Monte Carlo integration is a valid generic answer, while exploiting separability is the more efficient specialized alternative; a large dimension alone does not force a tensor-product grid.

A convenient choice for this irregular region is Monte Carlo integration. The region is contained in $[-1,1{]}^2$. For independent uniform points $U_j$ in that square, letThe indicator random variable incorporates the curved boundary directly. This estimator is unbiased; the integrand is bounded on the square, so its variance is finite. The variance of a sum of independent terms gives root mean square error $O(N^{-1/2})$ in big O notation. This is a stochastic error rate. Applying a rectangular Simpson's rule to the indicator-weighted integrand would lose the smoothness required for its fourth-order error bound.

For a generic integrand in 20 dimensions, Monte Carlo integration gives root mean square error $O(N^{-1/2})$, whereas tensor-product quadrature with composite Simpson's rule gives only $O(N^{-4/20})=O(N^{-1/5})$. One can sample uniformly in the Euclidean unit ball, for example by an independent uniform direction and radius $U^{1/20}$ with $U$ uniform on $[0,1]$.

For this particular integrand, the most efficient elementary choice uses radial integration over a ball first. The area of the unit 19-sphere is $2{\pi }^{10}/9!$, as follows from the volume of an n-ball. HenceThe reduced integrand is smooth. Apply composite Simpson's rule to obtain $O(N^{-4})$ deterministic error in big O notation, with one original radial integrand evaluation per node. If the selection is restricted to direct multidimensional methods, Monte Carlo integration with $O(N^{-1/2})$ root mean square error is the appropriate choice.

A pseudorandom number generator is a deterministic state-update algorithm producing numbers intended to imitate an independent sequence from a prescribed probability distribution. For Monte Carlo integration, desirable features include good one-dimensional and multidimensional uniformity, a period far longer than the calculation, negligible detectable dependence, reproducible seeds, sufficient numerical precision and fast generation. Uniform marginal distributions alone do not provide independent draws.