关于「度量毒性:知情交易概率、VPIN 与闪崩之争」,《订单簿微观结构与毒流》给出的定量结论是什么?

结论:PIN 用每日买卖笔数的混合模型估计知情交易的概率;即使模型正确,60 天数据的估计也有约 ±0.04 的抽样误差,而教科书形式的似然在活跃股票上会溢出,林与柯估计近期约 44% 的估计可能因此向下偏倚。PIN 是否以信息不对称的身份被定价,有相反的证据。VPIN 在成交量时间中计算订单不平衡,计算简单,但批量分类可能把波动率的上升误读为订单流的一边倒,这与安德森与邦达连科的批评一致。闪崩前「逆向选择撤单」是一种有争议的机制解释,不是已确立的因果。价差分解显示,毒性上升时已实现价差转负,在价格弹性的噪声交易下,超过一个门槛后市场会关闭。

数据口径:做市商为什么要留出买卖价差?订单为什么成簇到来?能否从成交数据中度量「有毒」的订单流?本书是教学与研究用的数学模型,不是投资或交易建议。 第八章给出逆向选择、订单流、库存与执行四步核查表,以及一项预注册的模拟撮合实验方案:在独立第三方冻结的模拟器中,比较库存偏置的阿韦拉内达—斯托伊科夫报价与固定对称报价在毒性脉冲下的跨会话夏普比率(唯一主要结局为二者之差,最小关注效应 0.31,8,600 个配对会话,双盲运行,判定规则写成代码)。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 60

truth: alpha 0.4, delta 0.5, mu 40, eps_b = eps_s = 30: PIN 0.2105
100 samples of 60 days: PIN median 0.2084, 5-95 % range 0.1692 to 0.2523
   alpha median 0.400; estimates with alpha < 0.05 or > 0.95: 0
60 days with about 6,000 trades a day (mu 4,000, eps 3,000 each side):
   textbook likelihood: OverflowError (34, 'Numerical result out of range')
   log-sum-exp form: alpha 0.466, mu 4,011, PIN 0.2380 (truth 0.2105)
   event days actually drawn in this sample: 28 of 60 = 0.467; PIN at that alpha 0.2373

核心公式

\[\mathrm{PIN} = \frac{\alpha\mu}{\alpha\mu + \varepsilon_b + \varepsilon_s}.\]
查看完整验算程序
# PIN model of Easley, Kiefer, O'Hara & Paperman (1996). Each day an information event
# occurs with probability alpha; it is bad news with probability delta. Uninformed buys
# and sells are Poisson(eb), Poisson(es); informed traders add Poisson(mu) on one side.
# PIN = alpha mu / (alpha mu + eb + es). Daily buy and sell counts are simulated
# (60 days), the likelihood is maximised (Nelder-Mead on transformed parameters), and
# the sampling spread of the estimate is checked. Also: why the textbook form of the
# likelihood fails for heavily traded stocks (floating-point overflow; Lin & Ke 2011).
import math, random, statistics

def poisson(rng, m):
    if m > 50:                                         # normal approximation, large means
        return max(0, round(rng.gauss(m, math.sqrt(m))))
    k, p, L = 0, rng.random(), math.exp(-m)
    while p > L:
        k += 1; p *= rng.random()
    return k

def simulate(rng, a, d, mu, eb, es, days=60, flags=None):
    out = []
    for _ in range(days):
        ev = rng.random() < a
        bad = ev and rng.random() < d; good = ev and not bad
        out.append((poisson(rng, eb + mu * good), poisson(rng, es + mu * bad)))
        if flags is not None:
            flags.append(ev)
    return out

def naive_lik(th, data):                               # the textbook product of terms
    a, d, mu, eb, es = th; L = 1.0
    P = lambda k, m: math.exp(-m) * m ** k / math.factorial(k)
    for B, S in data:
        L *= ((1 - a) * P(B, eb) * P(S, es) + a * d * P(B, eb) * P(S, es + mu)
              + a * (1 - d) * P(B, eb + mu) * P(S, es))
    return L

def loglik(th, data, lg):
    a, d, mu, eb, es = th; ll = 0.0
    for (B, S), c in zip(data, lg):
        t = (math.log(1 - a) + B * math.log(eb) - eb + S * math.log(es) - es,
             math.log(a * d) + B * math.log(eb) - eb + S * math.log(es + mu) - es - mu,
             math.log(a * (1 - d)) + B * math.log(eb + mu) - eb - mu
             + S * math.log(es) - es)
        m = max(t); ll += m + math.log(sum(math.exp(x - m) for x in t)) - c
    return ll

def unpack(z):
    s = lambda x: 1 / (1 + math.exp(-max(-30, min(30, x))))
    return s(z[0]), s(z[1]), math.exp(z[2]), math.exp(z[3]), math.exp(z[4])

def nelder_mead(f, x0, it=300, step=0.5):
    n = len(x0)
    pts = [list(x0)] + [[x + (step if i == j else 0) for j, x in enumerate(x0)]
                        for i in range(n)]
    vals = [f(p) for p in pts]
    for _ in range(it):
        o = sorted(range(n + 1), key=lambda i: vals[i]); pts = [pts[i] for i in o]
        vals = [vals[i] for i in o]
        c = [sum(p[i] for p in pts[:-1]) / n for i in range(n)]
        r = [2 * c[i] - pts[-1][i] for i in range(n)]; fr = f(r)
        if fr < vals[0]:
            e = [3 * c[i] - 2 * pts[-1][i] for i in range(n)]; fe = f(e)
            pts[-1], vals[-1] = (e, fe) if fe < fr else (r, fr)
        elif fr < vals[-2]:
            pts[-1], vals[-1] = r, fr
        else:
            k = [(c[i] + pts[-1][i]) / 2 for i in range(n)]; fk = f(k)
            if fk < vals[-1]:
                pts[-1], vals[-1] = k, fk
            else:
                pts = [pts[0]] + [[(pts[0][i] + p[i]) / 2 for i in range(n)]
                                  for p in pts[1:]]
                vals = [vals[0]] + [f(p) for p in pts[1:]]
    return pts[vals.index(min(vals))]

def fit(data):
    lg = [math.lgamma(B + 1) + math.lgamma(S + 1) for B, S in data]
    mb = statistics.fmean(B for B, _ in data); ms = statistics.fmean(S for _, S in data)
    best = None
    for a0 in (0.2, 0.6):                                   # two starting points
        z0 = [math.log(a0 / (1 - a0)), 0.0, math.log(0.5 * (mb + ms) / 2 + 1),
              math.log(0.8 * mb + 1), math.log(0.8 * ms + 1)]
        z = nelder_mead(lambda z: -loglik(unpack(z), data, lg), z0)
        v = loglik(unpack(z), data, lg)
        if best is None or v > best[0]:
            best = (v, unpack(z))
    return best[1]

pin = lambda a, d, mu, eb, es: a * mu / (a * mu + eb + es)

if __name__ == "__main__":
    rng = random.Random(1996)
    true = (0.4, 0.5, 40.0, 30.0, 30.0)
    print(f"truth: alpha 0.4, delta 0.5, mu 40, eps_b = eps_s = 30: PIN {pin(*true):.4f}")
    est = [fit(simulate(rng, *true)) for _ in range(100)]
    p = sorted(pin(*e) for e in est)
    print(f"100 samples of 60 days: PIN median {p[50]:.4f}, 5-95 % range"
          f" {p[5]:.4f} to {p[94]:.4f}")
    a = [e[0] for e in est]
    print(f"   alpha median {statistics.median(a):.3f}; estimates with alpha < 0.05 or"
          f" > 0.95: {sum(x < 0.05 or x > 0.95 for x in a)}")
    busy = (0.4, 0.5, 4000.0, 3000.0, 3000.0)
    fl = []; data = simulate(rng, *busy, flags=fl)
    print("60 days with about 6,000 trades a day (mu 4,000, eps 3,000 each side):")
    try:
        print("   textbook likelihood:", naive_lik(busy, data))
    except OverflowError as e:
        print(f"   textbook likelihood: OverflowError {e}")
    e = fit(data)
    print(f"   log-sum-exp form: alpha {e[0]:.3f}, mu {e[2]:,.0f}, PIN {pin(*e):.4f}"
          f" (truth {pin(*busy):.4f})")
    k = sum(fl)
    print(f"   event days actually drawn in this sample: {k} of 60 = {k / 60:.3f};"
          f" PIN at that alpha {pin(k / 60, *busy[1:]):.4f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《高频限价订单簿微观结构、霍克斯自激点过程与逆向选择毒流》第 4 章「度量毒性:知情交易概率、VPIN 与闪崩之争」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23828065

DOI: 10.5281/zenodo.23828065 · 阅读本章所在专著 · 5DL-B-045 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026045,
  author    = {Fan, Yafu},
  title     = {High-Frequency Limit Order Book Microstructure, Hawkes Self-Exciting Point Processes and Adverse-Selection Flow Toxicity},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23828065},
  url       = {https://doi.org/10.5281/zenodo.23828065}
}

本书其他章节结论