Exponent error — the series
-
The exponent an error moves
Every real measurement of a branch radius carries error and no synthetic tree does, so the question is what a symmetric error does to a fitted exponent. It does two things — a bias and a spread — and the bias runs downward at every error level and in every band, by an amount derivable from the daughter ratios alone.
-
The fragile junctions are the informative ones
That is the obvious worry once the radii are uncertain, and it is false. Across the whole range of asymmetry a junction's contribution to the bias moves by a factor of 1.36 while its leverage moves by a factor of 308,352, so the junction that says nothing damages the answer as badly as the one that says everything — and a sample is spoiled by counting rather than by weight.
-
The window that closes
The spread of a fitted branching exponent falls as the reciprocal root of the sample and its displacement does not fall at all, so there is a count past which every further junction buys confidence and no accuracy. Between three and five per cent of radius error the count arrives before the answer does, and no sample size both states a claim and contains the truth.
-
Where three and two become one
Two trees, one built to obey Murray's law and one to obey Da Vinci's, are measured through the same fifty junctions with the same instrument. At twelve per cent of error on each radius the two answers overlap, and above twenty and a half the tree built at three measures lower than the tree built at two.
-
A swelling at the fork
A branch thickens where it forks, so a parent measured just below a junction and daughters measured just above it carry three different amounts of the same swelling. A swelling that fattens all three alike moves a fitted exponent by exactly nothing. A parent read one per cent fat moves it by as much as 3.6 per cent of random error on every radius, in a sign known in advance, and a tenth of a radius turns a tree built at Murray's three into one that reads Da Vinci's two with no noise at all. Added to the noise, it does not bring the two rules together any sooner: the two errors do not add.
-
A correction that keeps the overlap
The duel between a tree built at Murray's exponent and one built at Da Vinci's ended by saying the displacement is the geometry, and that no better estimator removes it. Correcting every replicate by simulation-extrapolation removes 92 per cent of the tree at three's displacement at five per cent of error and 68 per cent at twelve, and the error at which the two means cross leaves the measured range altogether. It pays in spread — the corrected readings are twice as wide at twelve per cent — so the error at which the two trees' intervals overlap does not move. Of the duel's two numbers, the inversion was the estimator's and the overlap is the question's.
-
A count carries no error
Fitting r₀ᵏ = Σrᵢᵏ junction by junction puts a measured radius on both sides of every equation, and at twelve per cent of error a tree built at Murray's three and one built at Da Vinci's two stop being told apart, however the fit is corrected. Fit the same measured radii against the number of tips each branch carries instead — a count, which nobody measures with error — and the two trees read 2.996 and 1.997 at twelve per cent and 3.015 and 2.001 at thirty, never overlapping. The twelve per cent belonged to the junction fit, not to the tree. The count fails in its own way, and the way is stated.
-
A count that has lost tips
Radii read against the tips each branch carries keep Murray's three apart from Da Vinci's two where junction fits cannot, because a count has no measurement error in it. A count of the tips a tree has is not a count of the tips it grew. Losing them lowers both trees' readings by one factor that belongs to the losses and not to the rule, so the count stops being right long before it stops telling the trees apart: on fifty junctions at twelve per cent of error, to seventy per cent of the tips lost one at a time, and only to about a quarter lost in whole limbs. Counting scars repairs single losses exactly. Nothing countable repairs a shed limb.
-
A loss that picks its tips can read high
A tree that has lost tips at random reads its branching exponent low, by one factor shared by every rule. Let the loss choose which tips go and the factor is still shared — the ratio of three to two survives any choice — but it is no longer below one. On fifty junctions with half the tips gone, the choice of which half moves Murray's tree from 2.23 to 3.52, and past about half the tips a single tree's reading can no longer say which rule built it. The ways a crown plausibly chooses stay within a few hundredths of a fair loss, all of them low, and counting scars repairs every one.