Comparison of single-branch theoretical predictions and statistics of mature branches resulting from numerical simulations, with p = ½ and t = 2000 time steps.

The first 9 terms resulting from Table 4 are listed in the second row, illustrating the feature of this probability distribution (p·qj−1). The largest probability here, equal to 0.5, is for a branch of length 1. Each increase in length reduces the probability of the next possible outcome by q = ½. As shown in Table 7, for tree that evolve more than three timesteps, statistics of the neural tree consistently underestimate the average branching length; this corresponds to a larger effective branching probability. The probability distribution of mature branches of different length indeed seem to match a similar probability distribution of (p·qj−1), but with a larger effective branch probability of p≈0.66. In other words, largest probability of the last row, corresponding to a branch of length 1, is 0.66. Each increase in length reduces the probability of observing this outcome by q = 1/3.