What does Supermodular Chaining of Stock Assets conclude, in numbers, about “A Graph of the Adjacent Possible: One-Step Combinations and the Trade-off of Unfamiliarity”?

Answer: Section B arranges ten trials into a quarter. With only familiar combinations (\(u = 0.1\)), the mean total is 11.77, the chance of at least one breakthrough is only 0.0057 and the worst tenth of quarters totals 9.49. With 1 unfamiliar trial (\(u = 0.8\)) the breakthrough chance rises to 0.0390 and the worst tenth falls to 9.16. With 2, the breakthrough chance is 0.0712 and the worst tenth 8.97. With 3, the figures are 0.1023 and 8.72. With all ten unfamiliar, the breakthrough chance reaches 0.2927 and the worst tenth sinks to 7.22.

Scope of the numbers: In the illustrative model, twelve of the fifteen pairs of six assets are complements and three are substitutes, and with all six switched on the monthly value is 23,104 against a stand-alone sum of 13,668. Parameters are illustrative and correspond to no real business, customer, creator or sale; all calculations are generated by the book's programs.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.0057, 0.0390, 0.0712, 0.1023, 0.2927, 0.8

A. one trial by unfamiliarity u
u mu(u) sigma mean value median P(value > 5)
0.000.000 0.40 1.083 1.000 0.0000
0.100.048 0.48 1.177 1.049 0.0006
0.250.075 0.60 1.290 1.078 0.0053
0.400.048 0.72 1.360 1.049 0.0151
0.60 -0.0720.88 1.371 0.931 0.0280
0.80 -0.2881.04 1.288 0.750 0.0340
1.00 -0.6001.20 1.127 0.549 0.0328
B. ten trials a quarter, k unusual (u0.8)
k mean total P(>1 hit) P10 of total
011.77 0.0057 9.49
111.88 0.0390 9.16
211.99 0.0712 8.97
312.10 0.1023 8.72
512.32 0.1614 8.24
1012.88 0.2927 7.22
Show the full program
# Chapter 3. p33: unfamiliarity, mean and spread of a recombination.
# Illustrative shape, not a fitted curve: the log value of one chaining
# trial with unfamiliarity u in [0, 1] is normal with
#   mu(u) = 0.6 u - 1.2 u^2   and   sigma(u) = 0.4 + 0.8 u,
# so the mean of the log rises then falls while the spread keeps rising
# (Fleming 2001 reports lower average usefulness and higher variability
# for new combinations). Value 1 = a typical familiar trial; a
# "breakthrough" is value > 5.
# B. A quarter of ten trials: k unusual trials (u = 0.8) and 10 - k
#    conventional ones (u = 0.1). Mean total, chance of at least one
#    breakthrough, and the 10th percentile of the total (Monte Carlo).
import math
import random

HIT = 5.0


def mu(u):
    return 0.6 * u - 1.2 * u * u


def sd(u):
    return 0.4 + 0.8 * u


def mean_value(u):
    return math.exp(mu(u) + sd(u) ** 2 / 2.0)


def p_hit(u):
    z = (math.log(HIT) - mu(u)) / sd(u)
    return 0.5 * math.erfc(z / math.sqrt(2.0))


if __name__ == "__main__":
    print("A. one trial by unfamiliarity u")
    print("    u   mu(u)  sigma   mean value   median   P(value > 5)")
    for u in (0.0, 0.1, 0.25, 0.4, 0.6, 0.8, 1.0):
        print("  {:.2f} {:>6.3f} {:>6.2f} {:>11.3f} {:>8.3f} {:>13.4f}"
              .format(u, mu(u), sd(u), mean_value(u), math.exp(mu(u)),
                      p_hit(u)))
    print("B. ten trials a quarter, k unusual (u = 0.8)")
    print("   k   mean total   P(>= 1 hit)   P10 of total")
    rng = random.Random(37503)
    for k in (0, 1, 2, 3, 5, 10):
        mean_t = math.fsum([mean_value(0.8)] * k +
                           [mean_value(0.1)] * (10 - k))
        p_none = (1 - p_hit(0.8)) ** k * (1 - p_hit(0.1)) ** (10 - k)
        tot = []
        for _ in range(20000):
            vals = [math.exp(rng.gauss(mu(0.8), sd(0.8))) for _ in range(k)]
            vals += [math.exp(rng.gauss(mu(0.1), sd(0.1)))
                     for _ in range(10 - k)]
            tot.append(math.fsum(vals))
        tot.sort()
        print("  {:>2} {:>11.2f} {:>13.4f} {:>14.2f}".format(
            k, mean_t, 1 - p_none, tot[len(tot) // 10]))

Single source and citation

Fan, Y. (2026). Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining (Version 1.0.0), Chapter 3: A Graph of the Adjacent Possible: One-Step Combinations and the Trade-off of Unfamiliarity. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-375 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026375,
  author    = {Fan, Yafu},
  title     = {Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book