MétaCan
Menu
Back to cohort
Record W2896218014 · doi:10.1007/s11856-023-2555-z

Mixing times and hitting times for general Markov processes

2023· article· en· W2896218014 on OpenAlex
Robert M. Anderson, Haosui Duanmu, Aaron Smith

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

VenueIsrael Journal of Mathematics · 2023
Typearticle
Languageen
FieldMathematics
TopicMarkov Chains and Monte Carlo Methods
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsMarkov chainMathematicsMixing (physics)Hitting timeMarkov propertyMultiplicative functionMarkov chain mixing timeEquivalence (formal languages)Markov processMarkov renewal processExamples of Markov chainsPure mathematicsStatistical physicsDiscrete mathematicsApplied mathematicsMarkov modelMathematical analysisStatistics

Abstract

fetched live from OpenAlex

Abstract The hitting and mixing times are two fundamental quantities associated with Markov chains. In Peres and Sousi [PS15] and Oliveira [Oli12], the authors show that the mixing times and “worst-case” hitting times of reversible Markov chains on finite state spaces are equal up to some universal multiplicative constant. We use tools from nonstandard analysis to extend this result to reversible Markov chains on general state spaces that satisfy the strong Feller property. Finally, we show that this asymptotic equivalence can be used to find bounds on the mixing times of a large class of Markov chains used in MCMC, such as typical Gibbs samplers and Metropolis–Hastings chains, even though they usually do not satisfy the strong Feller property.

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.003
metaresearch head score (Gemma)0.005
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: none
Teacher disagreement score0.865
Threshold uncertainty score0.671

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.005
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.071
GPT teacher head0.367
Teacher spread0.296 · 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