MétaCan
Menu
Back to cohort
Record W2520903082 · doi:10.1002/cpa.21813

Scaling Limit for the Ant in High‐Dimensional Labyrinths

2019· preprint· en· W2520903082 on OpenAlexaff
Gérard Ben Arous, Manuel Cabezas, Alexander Fribergh

Bibliographic record

VenueCommunications on Pure and Applied Mathematics · 2019
Typepreprint
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsScaling limitBernoulli's principleRandom walkMathematicsConjecturePercolation (cognitive psychology)ScalingContinuum percolation theoryBranching random walkBrownian motionStatistical physicsLimit (mathematics)Percolation critical exponentsRandom walker algorithmRandom graphCentral limit theoremBrownian excursionDiscrete mathematicsGraphCritical exponentMathematical analysisComputer sciencePhysicsDiffusion processGeometryStatisticsGeometric Brownian motion

Abstract

fetched live from OpenAlex

Abstract We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e., the behavior of the “ant in the labyrinth.” It is natural to conjecture that the scaling limit for random walks on large critical random graphs exists in high dimensions and is universal. This scaling limit is simply the natural Brownian motion on the integrated super‐Brownian excursion. We give here a set of four natural, sufficient conditions on the critical graphs and prove that this set of assumptions ensures the validity of this conjecture. The remaining future task is to prove that these sufficient conditions hold for the various classical cases of critical random structures, like the usual Bernoulli bond percolation, oriented percolation, and spread‐out percolation in high enough dimension. In a companion paper, we do precisely that in a first case, the random walk on the trace of a large critical branching random walk. We verify the validity of these sufficient conditions and thus obtain the scaling limit mentioned above in dimensions larger than 14. © 2019 Wiley Periodicals, Inc.

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 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.001
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.450
Threshold uncertainty score0.980

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
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.0010.001
Research integrity0.0000.001
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.095
GPT teacher head0.344
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Quick stats

Citations6
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueCommunications on Pure and Applied MathematicsSame topicStochastic processes and statistical mechanicsFrench-language works237,207