## Random sampling using Markov chains This article is a stub.This means that it cannot be considered to contain or lead to any mathematically interesting information.

### Quick description

Suppose that you want to generate, uniformly at random, some combinatorial structure or substructure. If the structure is simple enough, then there may be an easy way of converting random bits into the structure you want, with the correct distribution. For example, to choose a random graph one can just pick each edge independently at random with probability 1/2. However, a trivial direct approach like this is often not possible: how, for example, would you choose a (labelled) tree uniformly at random? A commonly used technique in more difficult situations is to take a random walk through the "space" of all objects of interest and to prove that the walk is rapidly mixing, which means that after not too long the distribution of where the walk has reached is approximately uniform.

This article describes a few examples of the technique. Crucial to any application of the method is the proof that the Markov chain one constructs really is rapidly mixing. There are many ways of showing this, which are discussed in articles linked to from a rapid mixing front page.

### Prerequisites

Basics of probability theory, definitions of combinatorial concepts such as graphs, trees, the Boolean cube, etc. Incomplete This article is incomplete. This article needs to be written. One example should be of a nice combinatorial structure that cannot be generated uniformly in a trivial way, but can be generated approximately uniformly with the help of Markov chains. Another should be a description of the Jerrum-Sinclair algorithm for generating a random perfect matching in a dense bipartite graph.