Financial data show approximate, scale-dependent regularities rather than an exact universal scaling law. Heavy return tails can resemble a power law over an intermediate range, but the fitted exponent, cutoff and range depend on instrument, period and sampling. A straight segment on a log-log plot alone is not enough to establish a power law.
For independent finite-variance increments, variance grows linearly with horizon and typical fluctuations scale as . Central-limit aggregation can make longer-horizon returns more Gaussian even when short-horizon returns are heavy-tailed. Real data can depart from a single self-similar distribution because of volatility clustering, changing regimes, asymmetric responses, intraday seasonality and market microstructure. Apparent different scaling of higher moments may reflect intermittent volatility, but moments estimated from rare tails can also be unstable or may not exist in an idealized model.
Useful tests compare rescaled distributions, structure functions and volatility correlations across several scales, with uncertainty estimates and checks for nonstationarity. Scaling is a valuable approximate modelling guide over a documented range, not proof that one exponent describes every asset and horizon or that historical tail behaviour fixes future extreme losses.
Write the displacement after independent isotropic zero-mean steps as . Cross terms vanish, giving when . Isotropy makes each Cartesian variance one third of this. Since and , . If “step size” were instead defined as a single-coordinate mean square, the corresponding expression would be ; the factor of three is purely the stated three-dimensional convention.
The probability density is even, so its first moment vanishes. Its second moment follows by integrating the polynomial:
Using the normalization from part a gives
The variance in position is consequently .
The moment-generating function of a standard normal distribution gives . Using independence of the coordinates,
The accepted draws are independent and identically distributed random variables, so their sample mean is an unbiased estimator and has variance
This counts accepted draws, requiring proposals in expectation.
An importance weight has expected value . From the ratio in (a),
The supplied normal distribution transform applies with quadratic coefficient , giving each factor . Thus
For , the base exceeds one because : importance weight variance increases exponentially with dimension. For , the importance weight is identically one and its variance is zero. This calculation concerns the importance weight, rather than the weighted integrand.
The integrand is positive, so the minimum-variance importance distribution is its target-weighted probability density function, normalized by :
By completing the square,
Thus is the multivariate normal distribution , where is the first standard basis vector. Its importance weight and weighted integrand are
A variance cannot be negative, and this proposal makes every summand constant, proving optimality directly. It is admissible under the arbitrary-proposal condition even though its mean vector is not zero. Although optimal proposals usually involve an unknown normalizing integral, here both that integral and the resulting normal distribution are explicit.
At equal sample count, rejection sampling eventually has smaller variance for fixed ; at equal expected proposal cost, importance sampling eventually wins. The distinction matters because a sample of the rejection sampling estimator means an accepted draw.
For the importance sampling estimator, all coordinates contribute to the importance weight although only one enters the integrand. The same normal distribution transform as in (c), now with linear coefficient for coordinate one, gives
Both estimators are unbiased estimators of , and
For fixed , the first variance grows exponentially while the second stays constant. This is the benefit of returning exact target draws in rejection sampling. However, obtaining those draws costs proposals each on average.
To compare computational work, multiply each variance by its expected proposal count. For importance sampling that count is ; for rejection sampling it is . The ratio of the resulting cost-normalized variances is
because . Thus importance sampling eventually gives better precision for the same expected number of proposals, assuming comparable work per proposal. This is an asymptotic cost comparison, not a guarantee that a fixed small computing budget produces any accepted draws. Both methods still deteriorate exponentially in this comparison. For they coincide and every proposal is accepted.
Figure 1.
Sample-count and expected-proposal-cost comparisons for the one-coordinate integrand at sigma squared equal to two
. Details.
A practical improvement is to exploit the integrand's one-coordinate structure directly: average for standard normal distribution draws , without generating unused coordinates. The optimal change of proposal distribution in (iii) improves further.
Let and , evaluated from the given polylogarithm formulas. Generate a large sample of independent and identically distributed random variables with r_sample_f, and compute its sample mean and sample variance using mean and var. The central limit theorem gives the first standardized check:
For the second check, the correct asymptotic variance of the sample variance involves the fourth central moment :
The denominator is not unless the probability distribution has the requisite fourth central moment, as does the normal distribution. Here the probability density function decays exponentially, so all required moments are finite.
To compute , expand the denominator of the probability density function as a geometric series and integrate each nonnegative term. The gamma function integral gives the raw moments
Thus and . The following R code implements both checks for chosen interior parameters and large n:
p <- 0.4
beta <- 1.3
n <- 100000
raw_m <- vapply(1:4, function(j) {
  -factorial(j) * polylog(j + 1, 1 - p) / (beta^j * log(p))
}, numeric(1))
m <- raw_m[1]
v <- raw_m[2] - m^2
mu4 <- raw_m[4] - 4 * m * raw_m[3] +
  6 * m^2 * raw_m[2] - 3 * m^4
x <- r_sample_f(n, p, beta)
c(mean_check = sqrt(n) * (mean(x) - m) / sqrt(v),
  variance_check = sqrt(n) * (var(x) - v) / sqrt(mu4 - v^2))
For each check separately, an absolute value below is consistent with its approximate confidence interval. Repeat with many independent samples: the two standardized statistics should each resemble a standard normal distribution, with about outside that range. Also vary , and n; a systematic discrepancy that grows with suggests a bias. The two checks from the same sample are generally dependent, so passing both is not itself a joint statement, nor can a finite test prove that a generator is correct.
The second central limit theorem follows from the central limit theorem for the sample variance: differs by a quantity tending to zero in probability from .
The central limit theorem gives , so, with the cumulative distribution function of the standard normal distribution,
The error has two tails. Using the supplied quantile, whose two-sided coverage is approximately , gives
The supplied quantile would be appropriate for a one-sided calculation; it would give only approximately two-sided coverage. Using the exact quantile instead of would give draws; we consistently use the paper's rounded value 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 guarantee is required under only the stated assumptions, use the Chebyshev's inequality budget.
Apply Chebyshev's inequality to the Monte Carlo estimator:
Thus suffices, giving
This is a finite-sample probability guarantee for every target satisfying the given variance assumption. It is a sufficient sample count supplied by the inequality, rather than a claim that every such target actually needs a million draws.
Generate independent and identically distributed random variables with probability density function , evaluate for each draw, and return the Monte Carlo estimator
Linearity of expectation makes this an unbiased estimator: . Independence and the specified variance give . Its Monte Carlo standard error is therefore , and the strong law of large numbers gives convergence to almost surely.
The definition of and (c)(i) give . Nonnegativity of the variance strengthens the lower bound to
In fact the variance of one weighted observation is exactly
It is finite by the envelope. For , the central limit theorem gives approximate two-sided coverage , so the paper's rounded quantile yields
If , the weighted observation equals almost surely, and one draw is sufficient. These are theoretical budgets: and may themselves be unknown and need preliminary estimation in an implementation.
Compare with the average rejection sampling cost . Ignoring integer rounding, importance sampling uses fewer proposal draws at the same approximate precision precisely when
For literal integer budgets, the comparison is . The simpler strict inequality is the intended leading-order condition. The bound alone does not ensure an improvement when ; this is a proposal-budget variance comparison of importance and rejection sampling.
There is a source error to resolve first. For a drag coefficient defined by , the velocity relaxation time is . The mass and drag coefficient in the PDF's exponential are interchanged: is dimensionless, whereas is not. The consistent mean relaxation law is therefore .
A mean relaxation law alone does not determine a variance. Use the usual thermal Langevin equation, with a bath at temperature and the fluctuation-dissipation relation for a Langevin particle:
Here the calculation is for one component in Cartesian coordinates. With fixed initial position and velocity, integration gives the mean displacement
Integrating the stochastic part of the velocity once more gives the centered displacement
The delta correlation reduces its variance to a single integral:
This is the integrated Ornstein-Uhlenbeck displacement for a prescribed initial velocity. Its short-time variance is ; at long times it is . Thus the diffusion coefficient is
If the requested mean-squared fluctuation instead refers to the conventional equilibrium mean squared displacement, the initial velocity is also averaged over its thermal distribution, with and . Its contribution adds , giving
This has the ballistic limit and the same diffusive limit . For fixed nonzero , the uncentered mean square instead equals the first boxed variance plus . In three independent spatial dimensions, the centered variances add, and the long-time result is . Stating the initial-velocity convention is necessary to distinguish these finite-time formulas.
TODO: biomolecular force assays are user-deferred. The following notes cover the generic physical apparatus, calibrated dielectric handles and synthetic attachments only.
In optical tweezers, a tightly focused laser produces a restoring gradient force on a suitable transparent bead. Scattering also transfers momentum along propagation, so a stable three-dimensional trap needs axial as well as lateral restoration. An objective with high numerical aperture, correctly filled entrance pupil, controlled beam polarization and low-aberration sample chamber are practical design elements. Collect transmitted/scattered light with a condenser and measure bead displacement with calibrated imaging or back-focal-plane photodetection. A steerable beam or translation stage sets relative positions; the force signal comes from bead displacement, not commanded stage displacement alone.
Near a stable operating point, use a harmonic optical trap with . For a slowly changing external force, in that coordinate; the optical restoring force is . Calibrate each axis and the range over which its response is linear. Detector sensitivity must also be known: write , with measured detector voltage , offset and position sensitivity in . A spring constant in arbitrary detector units is not a force calibration.
Three complementary physical calibrations are useful. At thermal equilibrium the equipartition theorem gives
This needs an independently calibrated position scale and a variance corrected for drift, detector noise and exposure averaging. In an overdamped Newtonian medium, the optical trap Langevin calibration obeys
Using a one-sided position power spectral density per hertz,
The corner frequency and spectral amplitude test both relaxation and fluctuation size. If drag is known, . The isolated-sphere value must be corrected near boundaries; otherwise measured height dependence can be mistaken for a changed trap stiffness. An independent steady optical trap drag calibration moves fluid past the trapped sphere: . Use small positive and negative speeds to verify slope, offset and force range.
One can also determine position sensitivity without assuming the bulk drag. In a low-frequency sinusoidal-stage optical trap calibration, let the known local fluid velocity amplitude be at drive angular frequency . The coherent bead displacement amplitude is
If the corresponding detector amplitude is , then
After removing the coherent drive line from the thermal record, combine this sensitivity with equipartition theorem to recover , and then infer from . A published calibration combines thermal spectra and stage-driven motion without taking bead drag as an input.[ref]
Controls determine whether these formulas measure the apparatus rather than its noise. Record blocked-light offsets and independent fixed-bead noise; calibrate length with known motion; keep sampling and electronics bandwidth adequate around ; and include exposure filtering and aliasing in a spectral fit. motion blur reduces measured variance and therefore makes naive equipartition theorem overestimate stiffness; additive position noise has the opposite bias. Changing exposure time provides a direct diagnostic.[ref] Check temperature and laser heating, wall separation, bead size and refractive index, alignment and power stability. Repeat after changing power or optical geometry and compare thermal, spectral and drag estimates. For a synthetic force handle, also measure the attachment's compliance and geometry so that bead motion is not automatically identified with its extension.
Figure 1.
Optical trap calibration
. Details.
Only the separable instrument and mechanical tasks are treated here; biological operation and stepping energetics remain deferred.
For generic optical tweezers, a tightly focused laser and objective with high numerical aperture create an intensity gradient that attracts a suitable dielectric bead toward the focus. Momentum transfer also creates a scattering force; stable three-dimensional trapping requires sufficient restoring gradient force. A condenser and photodetector or camera track displacement. Near a stable focus, defines the stiffness and requires both a position calibration and a force calibration.[ref]
At thermal equilibrium in a harmonic well, the equipartition trap calibration is . Alternatively, fitting the overdamped harmonic-trap power spectrum gives , hence . Detector noise, finite sampling and exposure time, wall corrections to drag, and drift must be controlled rather than attributed to stiffness.
For an isolated sphere in a Newtonian fluid, define using its diameter. The supplied viscosity converts to . The generic Stokes drag calculation gives
Here ; this retains the unspecified fluid density as a parameter rather than treating a density as supplied data. Stokes drag assumes an isolated no-slip sphere; nearby surfaces change the coefficient. TODO: the requested assessment of biological motor operation is deferred.
TODO: the biological stepping-energy and step-detection estimate is deferred in its entirety; no biological energy source or motor mechanism has been researched.
Ignoring biological coupling, the mechanical thermal model is the Langevin equation for a harmonic trap,
For independent repeats with the specified initial conditions, the ensemble mean obeys the homogeneous damped-oscillator equation. An average over independent zero-mean force samples reduces its variance by , with a finite detector bandwidth needed to define samples of white noise. High bandwidth alone does not remove random forces; averaging independent records or sufficiently separated samples is the additional operation. A single trajectory retains thermal fluctuations. For stationary overdamped position fluctuations, a long time average over duration has approximately .
The initial-value solution of a damped harmonic trap has characteristic roots . For distinct roots,
For critical damping, ,
For the underdamped case the same real solution can be written , with . These describe the deterministic response or conditional mean, not the entire noisy trajectory.
For overdamped trap relaxation after an inertial boundary layer, let . The slow and fast roots are
After , the fast exponential is negligible and the surviving amplitude is . If also , then to leading overdamped order
Small Reynolds number justifies the linear viscous force; it does not alone prove the separate small inertial-trap parameter . Neglecting requires both rapid momentum relaxation and a negligible slow-mode amplitude shift. If , a nonzero initial velocity can leave a small slow displacement even after its own fast transient decays. The result concerns generic bead mechanics only.
Figure 1.
Fast momentum relaxation leaves a slower trap mode, whose amplitude can still remember a sufficiently large initial velocity
. Source. Details.
Write for the Fisher information in one observation:
Under the stipulated regularity assumptions, the maximum-likelihood estimator is consistent and has asymptotic normality:
Equivalently, its large-sample normal approximation has mean and variance . The information for the whole random sample is ; keeping the one-observation convention explicit prevents an extra factor of .
Define and , with . The unrestricted maximum-likelihood estimates are and . Under the null hypothesis, maximizing the normal distribution's likelihood over the remaining variance gives
because the cross term vanishes when . At either fitted variance, the exponential factor in the likelihood function is , so it cancels in the ratio:
The standardized test statistic is
The sample variance uses divisor , whereas the maximum-likelihood estimate uses divisor ; this explains the in the final expression. Under a nondegenerate normal distribution, with probability one.
Prefer Student 2's paired analysis, because the observational units are matched pairs: two shoes exposed to the same child's activity. A paired t-test uses , so shared child-to-child variation is removed before estimating the standard error. The independent units are the ten pairs, giving statistical degrees of freedom under the model of independent normally distributed pair differences.
The role of covariance is explicit:
With common marginal variance and within-pair correlation coefficient , the true variance of the average difference is . The independent-groups calculation ignores the covariance term and uses . Positive within-pair association can therefore make the paired standard error much smaller, explaining how the reported p-values can differ without arithmetic mistakes. The preference follows from the paired design, not from selecting the smaller p-value. Marginal normality alone need not imply normally distributed differences; exact paired inference uses the normal-difference assumption, for example justified by a joint multivariate normal distribution.
The equal-variance two-sample Student's t-test pools the within-group sums of squares. If and are the two unbiased sample variances, the required positive square root is
For ten observations in each group, and the usual unpaired reference Student's t-distribution has statistical degrees of freedom, provided the assumed independence between groups is justified.
The sample mean has mean and variance . The central limit theorem gives a normal approximation for interior when both expected binomial counts are sufficiently large. Under the null hypothesis, a level- upper-tail cutoff is approximately
To obtain the power function, evaluate this same cutoff under the true statistical parameter , standardizing with :
Here is the standard normal distribution's cumulative distribution function. The formula treats the binomial threshold as continuous; exact integer cutoffs and boundary randomization are finite-sample refinements.