pub fn chao_wang_jost(profile: &CountProfile) -> Option<f64>Expand description
Chao–Wang–Jost (2013) entropy estimate in bits; None when N < 2.
Ĥ = Σ_{1≤c<N} f_c (c/N)(ψ(N) − ψ(c)) + (f₁/N)(1−A)^{1−N}(−ln A − Σ_{r=1}^{N−1}(1−A)^r/r).
Because −ln A = Σ_{r≥1}(1−A)^r/r, the second term equals (f₁/N)(1−A)·Φ(1−A, 1, N), where
Φ(1−A, 1, N) = Σ_{j≥0}(1−A)^j/(N+j) is the Lerch transcendent, evaluated exactly (up to
rounding) in a time independent of N (numeric::lerch_phi1), so (1−A)^{1−N} is never formed.