Memory kernel and closure for systems driven by intermittent forcing with power-law waiting times
Many systems are controlled by intermittent control variables that take on a random value for a random time interval. In the presence of such noise at update steps, the main equation for the controlled variables has a memory kernel whose coefficients are the cumulants, also known as $G$-cumulants, of the noise, which are fully ordered in time. In the case of Poisson switching, these correspond to the Boolean cumulants of the jump distribution, and the kernel can be summed exactly. We derive an exact decomposition of these coefficients for any waiting-time distribution with independent amplitudes and durations, which separates the jump statistics from the renewal statistics. In the case of waiting times that follow a power-law distribution with a finite mean, it is highly probable that a long time interval will be covered by a single period, and we have shown that, as a result, the coefficients for long delays intersect in all orders, from Boolean cumulants to the usual moments of the jump law. The long-lag kernel thus becomes a superposition of frozen deterministic flux kernels, weighted by the expression $ξ^2p(ξ)$, and from this the corresponding main equation in closed form follows. For $2<μ<3$, where the noise correlation time is infinite, the second-order closure retains a finite error even in the presence of slow dynamics, whereas the main equation of the frozen flows in this limit yields an exact stationary mean value. The telegraphic process is the only case of noise with renewal steps for which second-order conclusions are exact. An exactly solvable model with additive and correlated multiplicative noise confirms these predictions.