What does Computing the Live-Selling Script conclude, in numbers, about “Herding in the Comment Section: Asch, Information Cascades and Cumulative Advantage”?

Answer: Chapter 4 solves information cascades exactly as a Markov chain; a single fake recommendation makes a wrong cascade 2.63 times as likely.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual legal, advertising-compliance or marketing advice. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

中文版

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: 2.63

true quality low; P(right cascade) / P(wrong cascade)
qno seed1 fake seed2 fake seeds
0.550.599 / 0.4010.329 / 0.6710.000 / 1.000
0.600.692 / 0.3080.415 / 0.5850.000 / 1.000
0.700.845 / 0.1550.591 / 0.4090.000 / 1.000
0.800.941 / 0.0590.753 / 0.2470.000 / 1.000
0.900.988 / 0.0120.889 / 0.1110.000 / 1.000
q 0.70: one fake seed multiplies the wrong-cascade risk by 2.63
Show the full program
# Chapter 4. p41: Information cascades in a comment section, exactly.
# Model of Bikhchandani, Hirshleifer and Welch: viewers decide in turn
# whether to endorse a product whose true quality is low. Each has a
# private signal that is right with probability q, and sees all earlier
# public actions. With the tie rule "follow your own signal", the
# difference d = endorsements - rejections moves by one step until
# |d| = 2; from then on everyone copies (a cascade). The chain is solved
# exactly with fractions. "Seeds" are fake endorsements placed before
# the first real viewer: d starts at 1 or 2. The q values are
# illustrative; the model is the published one.
from fractions import Fraction as F


def absorb(q, start, n=60):
    # probability mass on d in {-1, 0, 1}; absorbing at -2 (right), +2
    dist = {start: F(1)} if abs(start) < 2 else {}
    right = F(0)
    wrong = F(1) if start >= 2 else F(0)
    for _ in range(n):
        new = {}
        for d, p in dist.items():
            for step, w in ((-1, q), (1, 1 - q)):
                e = d + step
                if e <= -2:
                    right += p * w
                elif e >= 2:
                    wrong += p * w
                else:
                    new[e] = new.get(e, F(0)) + p * w
        dist = new
    return float(right), float(wrong)


print("true quality low; P(right cascade) / P(wrong cascade)")
print("  q     no seed          1 fake seed      2 fake seeds")
for q in (F(11, 20), F(3, 5), F(7, 10), F(4, 5), F(9, 10)):
    cells = []
    for s in (0, 1, 2):
        r, w = absorb(q, s)
        cells.append("{:.3f} / {:.3f}".format(r, w))
    print("  {:.2f}  {}".format(float(q), "   ".join(cells)))
r0, w0 = absorb(F(7, 10), 0)
r1, w1 = absorb(F(7, 10), 1)
print("q 0.70: one fake seed multiplies the wrong-cascade risk by {:.2f}"
      .format(w1 / w0))

Single source and citation

Fan, Y. (2026). Seven-Syllable Auditory Hooks in Short Video and Livestreams, Comment-Section Herding Ignition and Pulse-Closing Scripts (Version 1.0.0), Chapter 4: Herding in the Comment Section: Asch, Information Cascades and Cumulative Advantage. 5D Library. DOI pending

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

BibTeX
@book{fan2026147,
  author    = {Fan, Yafu},
  title     = {Seven-Syllable Auditory Hooks in Short Video and Livestreams, Comment-Section Herding Ignition and Pulse-Closing Scripts},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book