Almost sure central limit theorem for the hyperbolic Anderson model with Lévy white noise
Bibliographic record
Abstract
In this paper, we present an almost sure central limit theorem (ASCLT) for the hyperbolic Anderson model (HAM) with a Lévy white noise in a finite-variance setting, complementing a recent work by Balan and Zheng [Trans. Amer. Math. Soc. 377 (2024), pp. 4171–4221] on the (quantitative) central limit theorems for the solution to the HAM. We provide two different proofs: one uses the Clark-Ocone formula and takes advantage of the martingale structure of the white-in-time noise, while the other is obtained by combining the second-order Gaussian Poincaré inequality with Ibragimov and Lifshits’ method of characteristic functions. Both approaches are different from the one developed in the PhD thesis of C. Zheng [ Multi-dimensional Malliavin-Stein method on the Poisson space and its applications to limit theorems (PhD dissertation), Université Pierre et Marie Curie, Paris VI, 2011], allowing us to establish the ASCLT without lengthy computations of star contractions. Moreover, the second approach is expected to be useful for similar studies on SPDEs with colored-in-time noises, when the former approach, based on Itô calculus, is not applicable.
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.007 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".