Invariant densities of random maps have lower bounds on their supports
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A random map is a discrete‐time dynamical system in which one of a number of transformations is randomly selected and applied at each iteration of the process. The asymptotic properties of a random map are described by its invariant densities. If Pelikan′s average expanding condition is satisfied, then the random map has invariant densities. For individual maps, piecewise expanding is sufficient to establish many important properties of the invariant densities, in particular, the fact that the densities are bounded away from 0 on their supports. It is of interest to see if this property is transferred to random maps satisfying Pelikan′s condition. We show that if all the maps constituting the random map are piecewise expanding, then the same result is true. However, if one or more of the maps are not expanding, this may not be true: we present an example where Pelikan′s condition is satisfied, but not all the maps are piecewise expanding, and show that the invariant density is not separated from 0.
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.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 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 it