Bibliographic record
Abstract
The purpose of this short report is to introduce a branching random walk in random environment on Z d where particles perform independent simple random walks and branch, according to a given law, which is obtained by xing branching numbers at each point in the space. These numbers represent a realization of an integer-valued random eld on Z d with the value at each point being independent of all other points. With just one particle starting at the origin, we identify the conditions which separate transience and recurrence, i.e., the progeny hits the origin with probability < 1 and resp. 1, in the same manner as it is done by F. den Hollander, M.V. Menshikov and S.Yu. Popov in [1], and previously by M.V. Menshikov and S.V. Volkov in [3]. 1 Fully quenched problem The results obtained in this paper are based on the facts from [1]. The Fields Institute for Research in Mathematical Sciences, 222 College Street, Toronto, Ontario, Canada, M5T 3J1. E-mail: svolkov@elds.ut...
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".