↖ CPA Weather Lab

Rainfall is rough

How a self-exciting point-process model from stock-market microstructure, and a roughness idea from financial volatility, quietly bridge two rainfall traditions that never talked to each other — the minute-scale clustering of rain cells, and the multi-century scaling laws hydrologists have chased since Hurst.

Thomas Deschatre (EDF Lab) · Marc Hoffmann (Paris Dauphine–PSL, IUF) · Mathieu Rosenbaum (Paris Dauphine–PSL) — arXiv:2607.27099, submitted 29 Jul 2026
Two live-generated paths, same randomness engine, two roughness settings — the entire paper in one picture. Reload to redraw.
01 — The setup

The two rainfalls

Zoom into five-minute rain-gauge data and rainfall looks like a scatter of discrete, clustering events — a point process. Zoom out to centuries of tree rings and lake sediments and it looks like a continuous, self-similar, fractal curve. Hydrology has treated these as two separate research traditions for forty years. This paper connects them with an actual formula.

Same underlying data, two magnifications

fine scale: discrete rain-cell arrivals coarse scale: continuous aggregated total
02 — Foundations

Random processes and events

A stochastic process is just a randomly-drawn path over time. A point process tracks discrete arrivals instead — and the entire richness of the model lives in one rule: the intensity, the instantaneous chance of the next arrival, given everything that happened so far. A plain Poisson process has a flat, memoryless intensity — no clustering at all.

Poisson (no memory) vs. clustered arrivals

Poisson: constant intensity, independent arrivals clustered: events bunch together
03 — The incumbents

The classic storm models

Bartlett–Lewis and Neyman–Scott (1987) are the textbook rainfall models: parent storm cells arrive plainly, and each parent spawns a batch of children nearby in time. Exactly two generations, by construction — no grandchildren, no children of children.

Two fixed generations

Every child traces back to a parent, but children never trigger further children. The cascade is capped at depth one.

04 — The new ingredient

Hawkes: when rain begets rain

A Hawkes process (Hawkes, 1971 — originally for earthquake aftershocks) removes the generation cap. Every event, parent or child, can trigger its own children, who can trigger theirs, in an open-ended branching cascade. The same idea now runs finance order-book models, epidemiology, neuroscience, and criminology.

Self-exciting cascade — click to reseed

Top: arrival times, colored by generation. Bottom: the resulting intensity — each dot rings an echo (the kernel) that stacks on the baseline rate and briefly raises the chance of the next arrival.

05 — The kernel shape

Kernels: short memory vs. long memory

The kernel is the "echo function" — how strong the triggering boost is right after an event, and how fast it fades. An exponential kernel fades fast, like a plucked string. A heavy-tailed power-law kernel fades slowly, leaving a long faint influence. Real rain-gauge data prefers the heavy tail, with a tail parameter α landing close to one-half.

Drag α — watch the tail lengthen

tail parameter α0.55
exponential kernel (classical) power-law kernel, current α

Small α → fat, slow-decaying tail. As α → 1 the power-law tail thins toward exponential-like behavior. Fitted rain-gauge data clusters around α ≈ 0.5–0.6 — read the crossover for yourself.

06 — Living dangerously

Criticality: on the edge

The total accumulated echo from one event — call it the branching ratio — measures how many "children" one event produces on average. Near 0: clustering fizzles fast. Near 1: the process is teetering right at the edge between dying out and exploding, a regime called near-critical. High-frequency financial markets were shown to sit exactly here. This paper finds rain-cell clustering sits there too.

Where real stations land

Fitted branching ratio across five European stations (Bochum, Lille, Marseille, Strasbourg, Toulouse), median across months: 0.90–0.93. All five sit inside the near-critical band.

07 — A tidy surprise

A hidden unity

Proposition 2.2 in the paper: a Hawkes process with a plain exponential kernel produces exactly the same means, variances, and correlations as the classical Bartlett–Lewis and Neyman–Scott models, under a matching parameter translation. The old models were never a rival framework — they were a narrow corner of this one, hiding in plain sight for forty years.

Nested, not competing

Bartlett–Lewis and Neyman–Scott sit inside the exponential-kernel Hawkes family. The heavy-tailed kernel is what actually extends the reach of the model.

08 — First test

Testing at the minute scale

Fitted month-by-month to a 69-year Bochum, Germany record and four 20-year French Météo-France stations, the heavy-tailed Hawkes model beats the classical models and the plain-exponential Hawkes model almost everywhere, by information-criterion scoring that penalizes extra parameters.

Median fitted parameters, five stations

branching ratio (‖φ‖₁) — near-critical band ≥ 0.85 tail parameter (α) — theory's sweet spot ≈ 0.5
09 — The second big idea

Roughness and the Hurst exponent

The Hurst exponent H, between 0 and 1, measures how jagged a random path is at every scale at once. H = 0.5 is ordinary Brownian motion (a jittering pollen grain). H above 0.5 is smoother, more "persistent." H below 0.5 is rougher than Brownian motion — jagged at every zoom level — and since a 2018 finance paper gave it the name, that's simply called rough.

Drag H — generate your own path

Hurst exponent H0.50
H < 0.5 — rough (this paper's finding, H≈0.01–0.1) H = 0.5 — ordinary Brownian motion H > 0.5 — smooth / persistent (classical "long memory")

Illustrative fractal path generator (random midpoint displacement), not the paper's exact estimator — built to give an honest feel for what "H≈0.05" actually looks like versus H≈0.5 or H≈0.85.

10 — The bridge

From clustering cells to a rough curve

Borrowing a 2015–2016 theorem built for financial order flow (Jaisson & Rosenbaum), the paper shows: a near-critical, heavy-tailed Hawkes process, rescaled over a long time horizon, converges to the running total of a rough fractional process — with H = α − 1/2. Real gauge data gives α ≈ 0.5–0.6, so the predicted H lands near 0 to 0.1 — before ever touching the multi-century data.

Zoom out: cascade → rough curve

Left: five minutes of rain-cell arrivals. Right: what that same generative mechanism looks like rescaled to years — a continuous, rough wandering curve, not a smooth one.

11 — Second test

Testing across centuries and millennia

16 weather-station records (200+ years, mostly European) plus 5 paleoclimatic proxy archives — tree rings, lake sediment, pollen, spanning 372 to 3,512 years — independently estimate H. Despite wildly different measurement methods, continents, and eras, nearly all of them land in the predicted 0.01–0.1 band.

Every independent estimate of H

x-axis: record length (years, log scale). Shaded band: the 0.01–0.1 range predicted in advance from minute-scale clustering. The pollen point runs high — plausibly an artifact of its much coarser 100-year sampling, as the authors note.

12 — The payoff

The Hurst–Mandelbrot paradox, resolved

Hurst (1951) found long rainfall/river records show strong "long memory," HHurst ≈ 0.7–0.9. Mandelbrot & Wallis (1968) modeled the cumulative total as a smooth, persistent fractional Brownian motion to explain it. This paper models the underlying rate directly and finds the opposite: H ≈ 0.05, rough. Same data family — two different objects, not a contradiction.

Same generator, two views

Toggling doesn't change the randomness — it's the exact same generated path, once shown raw, once shown as its own running sum. Roughness examined the wrong way can disguise itself as long memory.

13 — Reconciling a third camp

Rainfall's other language: multifractals

Schertzer & Lovejoy's multifractal cascades (since the 1980s) are the dominant scaling framework in operational hydrology. They look different from a single Hurst number — but the authors show the multifractal "conservation parameter," long found near zero for rainfall, is measuring nearly the same thing as this paper's H ≈ 0 once you compare the right statistics. In the small-H limit, rough processes and multifractal cascades converge mathematically.

Two lenses, one small-H limit

14 — Zooming out

Why this matters

Four things worth holding onto: this is a genuine transplant of finance-only mathematics into meteorology; it unifies two forty-year-old, previously disconnected rainfall literatures under one explicit formula; it's mechanistic — the large-scale exponent is derived from small-scale clustering physics, not just fitted; and it sits in the same "rough analysis" intellectual family as path signatures, related but distinct — one is about local statistical smoothness of a scalar path, the other about faithfully encoding a path's full geometric shape.

H = α − ½the entire bridge, in one line
10⁻² – 10⁻¹predicted and observed H, five independent proxy types
15 — Appraisal

My own take

The most impressive fact here isn't the accuracy — it's the direction: two numbers estimated from minute-scale clustering, fed into a theorem borrowed from finance, generated a falsifiable prediction about millennia-old tree rings before checking. That's rare in a field where scaling exponents are usually fit after the fact, separately, at whatever scale the data happens to exist. Where I'd want more: the bridge relies on an asymptotic limit theorem, and real gauge records are only approximately near-critical (0.78–0.99, not exactly 1) — how fast the convergence to the rough limit actually kicks in isn't fully pinned down. And everything here is single-point, single-gauge; the natural next step — the one that would connect most directly to gridded PRISM-style work — is whether this same roughness signature holds up spatially, not just at one station through time.

← CPA Weather Lab · Learn