MétaCan
Menu
Back to cohort
Record W2171265914 · doi:10.1017/s0963548306007498

Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms

2006· article· en· W2171265914 on OpenAlexafffund
Remco van der Hofstad, Gordon Slade

Bibliographic record

VenueCombinatorics Probability Computing · 2006
Typearticle
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversity of British Columbia
FundersEngineering and Physical Sciences Research CouncilNatural Sciences and Engineering Research Council of CanadaIsaac Newton Institute for Mathematical SciencesNewton Fund
KeywordsOmegaCombinatoricsCube (algebra)PhysicsMathematicsQuantum mechanics

Abstract

fetched live from OpenAlex

Let $p_c({\mathbb Q}_n)$ and $p_c({\mathbb Z}^n)$ denote the critical values for nearest-neighbour bond percolation on the $n$ -cube ${\mathbb Q}_n = \{0,1\}^n$ and on ${\mathbb Z}^n$ , respectively. Let $\Omega = n$ for ${\mathbb G} = {\mathbb Q}_n$ and $\Omega = 2n$ for ${\mathbb G} = {\mathbb Z}^n$ denote the degree of ${\mathbb G}$ . We use the lace expansion to prove that for both ${\mathbb G} = {\mathbb Q}_n$ and ${\mathbb G} = {\mathbb Z}^n$ , \[p_c({\mathbb G}) = \Omega^{-1} + \Omega^{-2} + \frac{7}{2} \Omega^{-3} + O(\Omega^{-4}).\] This extends by two terms the result $p_c({\mathbb Q}_n) = \Omega^{-1} + O(\Omega^{-2})$ of Borgs, Chayes, van der Hofstad, Slade and Spencer, and provides a simplified proof of a previous result of Hara and Slade for ${\mathbb Z}^n$ .

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.027
Threshold uncertainty score0.092

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.001
Science and technology studies0.0020.004
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0270.005

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.053
GPT teacher head0.310
Teacher spread0.257 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

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

Citations37
Published2006
Admission routes2
Has abstractyes

Explore more

Same venueCombinatorics Probability ComputingSame topicStochastic processes and statistical mechanicsFrench-language works237,207