Stochastic simulations of the Schnakenberg model with spatial inhomogeneities using reactive multiparticle collision dynamics
Bibliographic record
Abstract
A numerically efficient globally averaged number density approach is used to simulate a reaction-diffusion system using a particle-based stochastic simulation algorithm called reactive multiparticle collision (RMPC) dynamics. Constant diffusivity of the particles is achieved through a time-varying rotation angle (also called collision angle). Variation in the diffusion coefficient between two different chemical species is achieved in one of two ways: (ⅰ) using a different kBT/m value for one species compared to the other, or (ⅱ) using the same kBT/m value for both species, but using a different probability to free-stream for one species compared to another. For smaller diffusivities and larger spatial inhomogeneities, bath particles were necessary for the model to agree with the PDE solution. The latter approach was further used without a bath, and shown to be capable of producing Turing patterns after long simulation times. The significance of our work is that RMPC can serve as a feasible simulation tool for both short and long-term simulations, can handle spatial inhomogeneities, can model a fairly large range of diffusivities in a reaction-diffusion scenario, and is capable of producing Turing patterns. An advantage of this method includes more detailed system information in feasible simulation times.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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".