A simplified Python-based kinematic model of particle transport in rivers
Bibliographic record
Abstract
We present results from a particle-scale numerical model inspired by the idea that a majority of the time during transport capable floods, bedload transport in rivers is rarefied, and a stochastic process. Physical experiments conducted by others to explore this idea suggest that the time varying particle activity N measured within a control area A above the bed surface is described by a Poisson probability mass function (pmf), assuming an absence of collective entrainment. This implies that particles are sporadically entrained from the bed surface at rate λ with no “memory” of prior entrainment events, when and where local flow conditions favor particle lift or dislodgement. In this context we developed a new open source kinematic particle-scale model written in Python (Zwiep and Chartrand, 2022). Notably, the model includes no information related to the bed surface shear stress or Shields conditions, and no sediment transport functions are used to drive the model.The model domain measures a use specified length nD of the particle diameter D, with a width of 1D. At present we have tested the model with 30 simulations using a uniform particle diameter. Each simulation was run for 1 million iterations to explore the governing model parameters: SRe is the number of subregions within the domain length nD; En is the particle entrainment rate per iteration, which we randomly sample from a Poisson pmf for a specified value of λ; lt is the particle travel distance which we randomly sample from either a lognormal distribution or a truncated normal distribution for specified values of the distribution expected value and standard deviation; and Sh is the vertical particle stacking height ranging from 1-3D. The model produces a time varying signal of particle flux counted at downstream points of internal subregion domains, and at the downstream end of the model domain. The simplified particle bed changes “relative” elevation distributions through particle stacking and downstream motions of travel distance. An implication of particle stacking within the context of a stochastic model framework is a time varying signal of the average “particle age” defined as the number of iterations since last entrainment, as well as the average “particle age range” defined as the difference of the maximum and minimum particle ages, both metrics calculated at each iteration and across all subregions. The age dynamics correlate with the magnitude of N following an initial period of particle bed organization. Our initial tests suggest that the relatively simple model logic captures the essence of rarefied particle transport. We believe the model can be used to ask basic science questions, and as a classroom tool to introduce students to bedload transport in a straightforward and illustrative manner.References:Zwiep, S., & Chartrand, S. M. (2022). pySBeLT: A Python software package for stochastic sediment transport under rarefied conditions. Journal of Open Source Software, 7(74), 4282. https://doi.org/10.21105/joss.04282.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".