Stochastic averaging of dynamical systems with multiple time scales forced with {\alpha}-stable noise
Bibliographic record
Abstract
Stochastic averaging allows for the reduction of the dimension and complexity of stochastic dynamical systems with multiple time scales, replacing fast variables with statistically equivalent stochastic processes in order to analyze variables evolving on the slow time scale. These procedures have been studied extensively for systems driven by Gaussian noise, but very little attention has been given to the case of \alpha-stable noise forcing which arises naturally from heavy-tailed stochastic perturbations. In this paper, we study nonlinear fast-slow stochastic dynamical systems in which the fast variables are driven by additive \alpha-stable noise perturbations, and the slow variables depend linearly on the fast variables. Using a combination of perturbation methods and Fourier analysis, we derive stochastic averaging approximations for the statistical contributions of the fast variables to the slow variables. In the case that the diffusion term of the reduced model depends on the state of the slow variable, we show that this term is interpreted in terms of the Marcus calculus. For the case \alpha = 2, which corresponds to Gaussian noise, the results are consistent with previous results for stochastic averaging in the Gaussian case. Although the main results are derived analytically for 1 < \alpha < 2, we provide evidence of their validity for \alpha < 1 with numerical examples. We numerically simulate both linear and nonlinear systems and the corresponding reduced models demonstrating good agreement for their stationary distributions and temporal dependence properties.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".