MétaCan
Menu
Back to cohort
Record W2963814981 · doi:10.1017/s0143385711000824

Approximating entropy for a class of ℤ<sup>2</sup>Markov random fields and pressure for a class of functions on ℤ<sup>2</sup>shifts of finite type

2012· article· en· W2963814981 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

VenueErgodic Theory and Dynamical Systems · 2012
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMathematicsMarkov chainIsing modelEntropy (arrow of time)CombinatoricsType (biology)k-nearest neighbors algorithmSubshift of finite typeStatistical physicsDiscrete mathematicsPhysicsQuantum mechanicsStatistics

Abstract

fetched live from OpenAlex

Abstract For a class of ℤ 2 Markov Random Fields (MRFs) μ , we show that the sequence of successive differences of entropies of induced MRFs on strips of height n converges exponentially fast (in n ) to the entropy of μ . These strip entropies can be computed explicitly when μ is a Gibbs state given by a nearest-neighbor interaction on a strongly irreducible nearest-neighbor ℤ 2 shift of finite type X . We state this result in terms of approximations to the (topological) pressures of certain functions on such an X , and we show that these pressures are computable if the values taken on by the functions are computable. Finally, we show that our results apply to the hard core model and Ising model for certain parameter values of the corresponding interactions, as well as to the topological entropy of certain nearest-neighbor ℤ 2 shifts of finite type, generalizing a result in [R. Pavlov. Approximating the hard square entropy constant with probabilistic methods. Ann. Probab. to appear].

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.003
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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.850
Threshold uncertainty score0.862

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.003
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.019
GPT teacher head0.268
Teacher spread0.249 · 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