Construct · 1 fields · 1 citations

rapid mixing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Randomized algorithms

the property of a Markov chain reaching near its stationary distribution in time polynomial in the problem size, enabling approximate counting and sampling.

In randomized algorithms, rapid mixing refers to the property of a Markov chain reaching near its stationary distribution in time polynomial in the problem size, enabling approximate counting and sampling. This meaning comes from Sinclair (1989) in Information and Computation.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how rapid mixing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

approximate counting1 fields · 1 citationsanchor · a standalone construct chain3 fields · 3 citationsjingle · one word, three constructs distribution2 fields · 2 citationsjingle · one word, two constructs

References

Sinclair, A., & Jerrum, M. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82(1), 93-133. https://doi.org/10.1016/0890-5401(89)90067-9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct