E. Hashorva · Gallery← all illustrations

Persistence of a Brown–Resnick process

A stationary Brown–Resnick process is the upper envelope X(t) = supi Pi Z(i)(t) of countably many spectral curves, each a log-normal Z(t) = exp(√2 BH(t) − t2H) scaled by a point Pi of a Poisson process. Watch the construction assemble on the left. Two very different questions about a level u: how many curves exceed it somewhere on [0,T] — Poisson with mean ℋV(T)/u, the Pickands functional, growing linearly in T — and how many stay above it throughout — Poisson with mean 𝒢V(T)/u, the expected infimum E inf[0,T] Z, which decays like 2Ψ(√γV(T)) for H > ½ and with an extra factor T−1 for Brownian motion. Several curves can together keep X above u without any one of them doing so — the picture makes that plain. From Dębicki, Hashorva & Novikov, Expected infimum and persistence probabilities of log-normal stationary Brown–Resnick processes.

log-scale: spectral curves PiZ(i)(t) (dim), the envelope of the shown curves (dark), level u (dashed); shown curves above u at every grid point in orange, curves exceeding u at a grid point marked blue at their maximum; crossings between grid points can be missed
Grid estimates of 𝒢V(T) = E inf[0,T] Z (dots, Monte Carlo) against T, with the endpoint bound 2Ψ(√γV(T)) (dashed); and ℋV(T) = E sup[0,T] Z (blue) for contrast
Shown curves above u somewhere
—
Shown curves above u throughout
—
Shown envelope above u on grid?
—
grid minimum of the partial envelope > u
Left: the first 80 Poisson points Pi = 1/Γi; omitted curves can change both counts and the envelope. The Poisson laws above describe the complete infinite system. All sampled intervals include 0 and T on a grid of spacing 1/32. Right: 20 000 fBm paths; the grid biases 𝒢 upwards and ℋ downwards, with additional Monte Carlo error (especially large for ℋ at high H and T). These plots do not certify continuous-time persistence or asymptotic convergence. At H = 1 we use exactly B1(t) = tN. Here γV(T) = T2H/2.