What does Drift and Noise on Long Pages conclude, in numbers, about “The Fokker-Planck Equation by Finite Differences: a Crowd of Visitors as a Cloud of Probability”?
Answer: The Fokker-Planck equation describes how a crowd of undecided visitors flows, and the flux through each barrier is the moment-by-moment rate of payment and of exit. Program p31 reproduces the closed forms with a mass-conserving finite-volume scheme whose error converges at second order; p32 computes the right-skewed distribution of payment times by a series and by the scheme, showing that most eventual payers decide within the first few screens; p33 shows that the step of an explicit scheme must satisfy the stability condition or its numbers mean nothing. The next chapter applies these tools to real page structure, where every section has its own drift and noise, and where which section is cut and which comes first both change the outcome.
Scope of the numbers: Chapter 4 pushes a page forward section by section: deleting the feature table of an illustrative page gains 0.0081, and the best and worst orders of sections differ by 0.1764. 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 only
| drift | cells | P(pay) FP | error | E[T] FP | error | steps |
|---|---|---|---|---|---|---|
| 0.2 | 21 | 0.5985 | -0.00021 | 0.9893 | +0.00244 | 1800 |
| 0.2 | 41 | 0.5986 | -0.00005 | 0.9875 | +0.00064 | 7000 |
| 0.2 | 81 | 0.5987 | -0.00001 | 0.9870 | +0.00016 | 26800 |
| 0.2 | exact | 0.5987 | 0.9869 | |||
| 0.5 | 21 | 0.7307 | -0.00033 | 0.9274 | +0.00320 | 1800 |
| 0.5 | 41 | 0.7310 | -0.00009 | 0.9251 | +0.00084 | 6400 |
| 0.5 | 81 | 0.7310 | -0.00002 | 0.9244 | +0.00021 | 24800 |
| 0.5 | exact | 0.7311 | 0.9242 |
Key formula
Show the full program
# Chapter 3. p31: the Fokker-Planck equation solved forward in time by a
# conservative finite-volume scheme, against the closed forms of p11.
# 方程:dp/dt = -v dp/dx + D d2p/dx2,D = s^2/2,两端吸收 p = 0。
# 网格:M 个格,格心在 (j + 0.5) dx;内部通量 F = v (p_j + p_j+1)/2
# - D (p_j+1 - p_j)/dx;壁在半格外,壁上通量为 D p / (dx/2)。
# 每步从两壁流出的质量分别记入「付款」与「离开」,质量严格守恒。
# 显式时间步 dt = 0.4 dx^2 / D。v = 0.2,s = 1,A = 2,Z = 1,均为示意。
import math
A, Z, S = 2.0, 1.0, 1.0
def exact(v):
k = 2.0 * v / (S * S)
p = (1.0 - math.exp(-k * Z)) / (1.0 - math.exp(-k * A))
return p, (A * p - Z) / v
def solve(v, m):
dx = A / m
d = S * S / 2.0
dt = 0.4 * dx * dx / d
p = [0.0] * m
p[int(Z / dx)] = 1.0 / dx
up, down, tw, t, k = [], [], [], 0.0, 0
while True:
f = [0.0] * (m + 1)
f[0] = -d * p[0] / (dx / 2.0)
f[m] = d * p[m - 1] / (dx / 2.0)
for j in range(m - 1):
f[j + 1] = (v * (p[j] + p[j + 1]) / 2.0
- d * (p[j + 1] - p[j]) / dx)
for j in range(m):
p[j] = p[j] - dt / dx * (f[j + 1] - f[j])
k += 1
t = k * dt
up.append(f[m] * dt)
down.append(-f[0] * dt)
tw.append(t * (f[m] - f[0]) * dt)
if k % 200 == 0 and math.fsum(p) * dx < 1e-7:
break
return math.fsum(up), math.fsum(down), math.fsum(tw), k
print("drift cells P(pay) FP error E[T] FP error steps")
for v in (0.2, 0.5):
pe, te = exact(v)
for m in (21, 41, 81):
pu, pd, tm, k = solve(v, m)
print("%.1f %-3d %.4f %+.5f %.4f %+.5f %d"
% (v, m, pu, pu - pe, tm, tm - te, k))
print("%.1f exact %.4f %.4f" % (v, pe, te))Single source and citation
Fan, Y. (2026). Fokker-Planck Drift-Diffusion on Long Sales Pages: Belief-Drift Rates and First-Passage Times to the Payment Barrier (Version 1.0.0), Chapter 3: The Fokker-Planck Equation by Finite Differences: a Crowd of Visitors as a Cloud of Probability. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-240 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026240,
author = {Fan, Yafu},
title = {Fokker-Planck Drift-Diffusion on Long Sales Pages: Belief-Drift Rates and First-Passage Times to the Payment Barrier},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Two Absorbing Barriers and First Passage: a Visitor's Path between "Pay" and "Leave"
- Chapter 2 · Noise and Mistaken Exits: Why a Longer Page Does Not Mean More Persuasion
- Chapter 4 · A Page Pushed Forward Section by Section: Deletion, Order and the Best Length
- Chapter 5 · Estimating Drift and Noise from Dwell and Payment: EZ-Diffusion and Identifiability
- Chapter 6 · Speed, Accuracy and the Opposing Evidence: Compressed Barriers, Mixed Audiences and the Cue of Argument Quantity
- Chapter 7 · Eastern and Western Sources: Xunzi on the Divided, Tilted and Doubled Mind, and Einstein's 1905 Brownian Motion
- Chapter 8 · Closing the Loop: Scroll Depth, Controlled Deletions and a Pre-Registered Test