# Correlation dimension D2 with honest error bars for the Henon map and the Lorenz attractor.
# Each point is generated from its own random initial condition after a long transient, so the
# points are independent samples of the attractor (no temporal correlation, no Theiler window).
# Rob - Clint Sprott's AI assistant, November 7, 2026
import numpy as np
from scipy.spatial import cKDTree
rng = np.random.default_rng(1)

def henon(N):                                   # x' = 1 - 1.4 x^2 + y, y' = 0.3 x
    x, y = 0.1*rng.random(N), 0.1*rng.random(N)
    for i in range(200): x, y = 1 - 1.4*x*x + y, 0.3*x
    return np.column_stack((x, y))

def lorenz(N, T=50, dt=0.01):                   # sigma = 10, r = 28, b = 8/3, RK4
    f = lambda v: np.array([10*(v[1] - v[0]), v[0]*(28 - v[2]) - v[1], v[0]*v[1] - 8/3*v[2]])
    v = np.array([[1], [1], [20]]) + rng.standard_normal((3, N))
    for i in range(int(T/dt)):
        k1 = f(v); k2 = f(v + dt/2*k1); k3 = f(v + dt/2*k2); v = v + dt/6*(k1 + 2*k2 + 2*k3 + f(v + dt*k3))
    return v.T

lr = np.arange(-4, -0.99, 0.125)                # log10(r/size) grid

def corr(P, size):                              # number of pairs closer than r for each r on the grid
    t = cKDTree(P); return (t.count_neighbors(t, size*10**lr) - len(P))/2

def fit(C, lo, hi):                             # slope of log C vs log r for lo <= log10(r/size) <= hi
    i = (lr > lo - 1e-9) & (lr < hi + 1e-9); return np.polyfit(lr[i], np.log10(C[i]), 1)[0]

for name, gen, size, std in (("Henon", henon, 3.0, (-3, -1)), ("Lorenz", lorenz, 60.0, (-2.5, -1.25))):
    for N in (1000, 10000):
        C = np.array([corr(gen(N), size) for s in range(10)])          # 10 independent samples
        d = np.array([fit(c, *std) for c in C])
        win = [np.mean([fit(c, lo, lo + 1) for c in C]) for lo in lr[lr <= -2]
               if C[:, lr > lo - 1e-9][:, 0].mean() >= 100]            # 1-decade windows with >= 100 pairs
        print("%-6s N = %5d: D2 = %.3f +/- %.3f from 10 samples (log10 r/size = %g to %g);"
              " %d one-decade windows give %.3f to %.3f" % (name, N, d.mean(), d.std(ddof=1)/np.sqrt(10),
              std[0], std[1], len(win), min(win), max(win)))
