Abstract
Enumerating combinatorial objects is an important research topic in combinatorics. Algorithms for random generating combinatorial objects are called sampling. Sampling has many applications in computer science, for example program testing. Mathematicians can use sampling to verify combinatorial property. We developed a simple algorithm to sample k-connected graphs based on Markov Chain Monte Carlo method. This algorithm generates graphs at approximately uniform distribution, and we prove it is rapidly mixing