Metastable Markov chains

C. Landim

Metastable Markov chains

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.04144 v1 pith:KNQF7HPW submitted 2018-07-11 math.PR cond-mat.stat-mech

C. Landim This is my paper · ORCID

classification math.PRcond-mat.stat-mech

keywords chainsmarkovmetastablebehaviorcharacterizationcontinuous-timederivedmartingale

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We review recent results on the metastable behavior of continuous-time Markov chains derived through the characterization of Markov chains as unique solutions of martingale problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Metastable Dynamics of Chain-of-Thought Reasoning: Provable Benefits of Search, RL and Distillation
cs.AI 2025-02 conditional novelty 7.0 of 10

In a metastable Markov model of reasoning, search and RL improve hitting times by boosting rare hard edges, and distilling clusters into a meta-chain preserves escape dynamics.

Pith tools