关于「订单为什么成簇到来:霍克斯过程、签名图与埃普斯效应」,《订单簿微观结构与毒流》给出的定量结论是什么?

结论:霍克斯过程用「过去的事件抬高当前强度」描述订单成簇;分支表示给出平均强度 \(\mu/(1-\eta)\)、簇大小 \(1/(1-\eta)\) 与长窗口法诺因子 \(1/(1-\eta)^2\),平稳性要求 \(\eta = \alpha/\beta < 1\),核对无误。时间重标度检验能清楚地区分泊松与霍克斯模型。真实市场的分支比是否接近 1 仍有争议(只回顾第 39 本)。互激过程能同时再现签名图与埃普斯效应;但埃普斯效应也可以完全来自非同步交易,此时林—吉田估计量可以消除它。作者框架中「霍克斯过程即埃普斯效应的解释」应限定为「霍克斯过程是解释之一」。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

mu 0.5, beta 1.0, T 40,000 rate cluster size Fano (W200)
eta simulated theory simulated theory simulated theory
0.30.713 0.714 1.43 1.43 1.90 2.04
0.61.270 1.250 2.51 2.50 5.88 6.25
0.82.529 2.500 5.04 5.00 22.24 25.00
0.95.102 5.000 10.19 10.00 97.05 100.00
MLE on T5,000 (12292 events; truth mu 0.5, alpha 0.8, beta 1.0):
mu 0.489, alpha 0.811, beta 1.013, branching ratio 0.801
time-rescaling check (KS distance to Exp(1); 5 % critical value 0.012):
Poisson fit 0.163 Hawkes fit 0.006

核心公式

\[\lambda(t) = \mu + \int_0^t \phi(t-s)\,dN_s, \qquad \phi(u) = \alpha e^{-\beta u}\quad(\text{指数核}),\]
查看完整验算程序
# Exponential Hawkes process lambda(t) = mu + sum_{t_i < t} alpha exp(-beta (t - t_i)),
# simulated through its cluster (branching) representation (Hawkes & Oakes 1974):
# immigrants arrive as Poisson(mu); every event has Poisson(eta) children
# (eta = alpha/beta), each after an Exp(beta) delay. Checks: mean rate mu/(1 - eta),
# cluster size 1/(1 - eta), Fano factor of counts in long windows -> 1/(1 - eta)^2;
# maximum likelihood; and a time-rescaling (residual) check of a Poisson fit against
# a Hawkes fit.
import math, random, statistics

def poisson(rng, m):
    k, p, L = 0, rng.random(), math.exp(-m)
    while p > L:
        k += 1; p *= rng.random()
    return k

def simulate(rng, mu, eta, beta, T):
    ev, sizes, t = [], [], rng.expovariate(mu)
    while t < T:
        cluster, gen = [t], [t]
        while gen:
            nxt = []
            for s in gen:
                for _ in range(poisson(rng, eta)):
                    c = s + rng.expovariate(beta)
                    if c < T:
                        nxt.append(c)
            cluster += nxt; gen = nxt
        ev += cluster; sizes.append(len(cluster)); t += rng.expovariate(mu)
    return sorted(ev), sizes

def loglik(th, ev, T):
    mu, alpha, beta = th
    if min(th) <= 0 or alpha >= beta:
        return -1e18
    ll, r, prev = 0.0, 0.0, None
    for t in ev:                            # r = sum of exp(-beta (t - t_j)), t_j < t
        if prev is not None:
            r = (r + 1) * math.exp(-beta * (t - prev))
        ll += math.log(mu + alpha * r); prev = t
    comp = mu * T + alpha / beta * sum(1 - math.exp(-beta * (T - t)) for t in ev)
    return ll - comp

def nelder_mead(f, x0, it=400):
    n = len(x0)
    pts = [list(x0)] + [[x * (1.3 if i == j else 1) for j, x in enumerate(x0)]
                        for i in range(n)]
    for _ in range(it):
        pts.sort(key=f); c = [sum(p[i] for p in pts[:-1]) / n for i in range(n)]
        w = pts[-1]; r = [c[i] + (c[i] - w[i]) for i in range(n)]
        if f(r) < f(pts[0]):
            e = [c[i] + 2 * (c[i] - w[i]) for i in range(n)]
            pts[-1] = e if f(e) < f(r) else r
        elif f(r) < f(pts[-2]):
            pts[-1] = r
        else:
            k = [c[i] + 0.5 * (w[i] - c[i]) for i in range(n)]
            if f(k) < f(w):
                pts[-1] = k
            else:
                pts = [pts[0]] + [[pts[0][i] + 0.5 * (p[i] - pts[0][i]) for i in range(n)]
                                  for p in pts[1:]]
    return min(pts, key=f)

def ks_exp(x):                                    # KS distance to Exp(1)
    x = sorted(x); n = len(x)
    return max(max((i + 1) / n - (1 - math.exp(-v)), (1 - math.exp(-v)) - i / n)
               for i, v in enumerate(x))

def rescaled(ev, mu, alpha, beta):
    out, r, prev, Lprev = [], 0.0, None, 0.0
    for t in ev:                                  # compensator increments between events
        if prev is None:
            L = mu * t
        else:
            dec = 1 - math.exp(-beta * (t - prev))
            L = Lprev + mu * (t - prev) + alpha / beta * (r + 1) * dec
            r = (r + 1) * math.exp(-beta * (t - prev))
        if prev is not None:
            out.append(L - Lprev)
        Lprev, prev = L, t
    return out

if __name__ == "__main__":
    rng = random.Random(1971); mu, beta, T, W = 0.5, 1.0, 40_000.0, 200.0
    print("mu 0.5, beta 1.0, T 40,000        rate        cluster size     Fano (W=200)")
    print("   eta            simulated  theory  simulated theory  simulated theory")
    for eta in (0.3, 0.6, 0.8, 0.9):
        ev, sz = simulate(rng, mu, eta, beta, T)
        cnt = [0] * int(T / W)
        for t in ev:
            cnt[int(t / W)] += 1
        fano = statistics.variance(cnt) / statistics.fmean(cnt)
        print(f"   {eta:.1f}              {len(ev) / T:7.3f}  {mu / (1 - eta):6.3f}"
              f"   {statistics.fmean(sz):7.2f}  {1 / (1 - eta):5.2f}"
              f"   {fano:8.2f}  {1 / (1 - eta) ** 2:6.2f}")
    ev, _ = simulate(rng, 0.5, 0.8, 1.0, 5000.0)
    th = nelder_mead(lambda p: -loglik(p, ev, 5000.0), [0.3, 0.3, 0.6])
    print(f"MLE on T = 5,000 ({len(ev)} events; truth mu 0.5, alpha 0.8, beta 1.0):")
    print(f"   mu {th[0]:.3f}, alpha {th[1]:.3f}, beta {th[2]:.3f},"
          f" branching ratio {th[1] / th[2]:.3f}")
    lam = len(ev) / 5000.0
    gaps = [lam * (b - a) for a, b in zip(ev, ev[1:])]
    print(f"time-rescaling check (KS distance to Exp(1); 5 % critical value"
          f" {1.358 / math.sqrt(len(gaps)):.3f}):")
    ks_h = ks_exp(rescaled(ev, *th))
    print(f"   Poisson fit {ks_exp(gaps):.3f}    Hawkes fit {ks_h:.3f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《高频限价订单簿微观结构、霍克斯自激点过程与逆向选择毒流》第 3 章「订单为什么成簇到来:霍克斯过程、签名图与埃普斯效应」(版本 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}
}

本书其他章节结论