MétaCan
Menu
Back to cohort
Record W2170795202 · doi:10.1214/ejp.v13-571

A special set of exceptional times for dynamical random walk on $Z^2$

2008· article· en· W2170795202 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueElectronic Journal of Probability · 2008
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsUniversity of Toronto
FundersUniversity of Washington
KeywordsRandom walkMathematicsDimension (graph theory)Heterogeneous random walk in one dimensionCombinatoricsDiscrete mathematicsLattice (music)Loop-erased random walkStatistical physicsStatisticsPhysics

Abstract

fetched live from OpenAlex

In [2] Benjamini, Haggstrom, Peres and Steif introduced the model of dynamical random walk on the $d$-dimensional lattice $Z^d$. This is a continuum of random walks indexed by a time parameter $t$. They proved that for dimensions $d=3,4$ there almost surely exist times $t$ such that the random walk at time $t$ visits the origin infinitely often, but for dimension 5 and up there almost surely do not exist such $t$. Hoffman showed that for dimension 2 there almost surely exists $t$ such that the random walk at time $t$ visits the origin only finitely many times [5]. We refine the results of [5] for dynamical random walk on $Z^2$, showing that with probability one the are times when the origin is visited only a finite number of times while other points are visited infinitely often.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.066
Threshold uncertainty score0.516

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.042
GPT teacher head0.307
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it