Fast and Accurate Numerical Integration of the Langevin Equation with Multiplicative Gaussian White Noise
Bibliographic record
Abstract
A univariate stochastic system driven by multiplicative Gaussian white noise is considered. The standard method for simulating its Langevin equation of motion involves incrementing the system's state variable by a biased Gaussian random number at each time step. It is shown that the efficiency of such simulations can be significantly enhanced by incorporating the skewness of the distribution of the updated state variable. A new algorithm based on this principle is introduced, and its superior performance is demonstrated using a model of free diffusion of a Brownian particle with a friction coefficient that decreases exponentially with the kinetic energy. The proposed simulation technique proves to be accurate over time steps that are an order of magnitude longer than those required by standard algorithms. The model used to test the new numerical technique is known to exhibit a transition from normal diffusion to superdiffusion as the environmental temperature rises above a certain critical value. A simple empirical formula for the time-dependent diffusion coefficient, which covers both diffusion regimes, is introduced, and its accuracy is confirmed through comparison with the simulation results.
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.000 | 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".