Characterising regime behaviour in the stably stratified nocturnal boundary layer on the basis of stationary Markov chains
Bibliographic record
Abstract
Abstract. Recent research has demonstrated that hidden Markov model (HMM) analysis is an effective tool to classify regimes of the stratified nocturnal boundary layer (SBL) at different tower sites. Here we analyse if SBL regime statistics (the occurrence of regime transitions, subsequent transitions after the first, and very persistent nights) in observations match theoretical calculations obtained from a stationary Markov chain with the goal of developing the foundations of novel Markov-chain-based boundary layer schemes which capture the effects of SBL regime dynamics. The regime statistics of a stationary Markov chain using the best estimate transition probabilities from the HMM analyses generally overestimate occurrence probabilities of regime transitions, resulting in an underestimation of persistent nights. Across the locations considered, sensitivity analyses of transition probability matrices in the HMM and the stationary Markov chain reveal that regimes are generally required to be more persistent in the stationary Markov chain in order to simulate observations accurately. A range of transition probability matrices allowing for a relatively accurate description of the occurrence of at least one transition within a night, multiple transitions, and the mean event durations is identified. The occurrence of very persistent nights (nights without regime transitions) is found to depend highly on the season. Therefore, for better representations of very persistent nights a nonstationary Markov chain linked to external drivers is likely appropriate. The observed transition probability maximum between one and two hours after a previous transition cannot be accounted for by two-state Markov processes (stationary or not). The use of these results in the development of SBL turbulence parameterisations is discussed.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".