Mathematics – Combinatorics
Scientific paper
2011-05-02
Mathematics
Combinatorics
48 pages, 18 figures. Version 4: new bound on smallest eigenvalue of chain given instead (Lemma 1.5), transition procedure adj
Scientific paper
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly mixing for regular directed graphs of degree d, where d is any positive integer-valued function of the number of vertices. We bound the mixing time by bounding the eigenvalues of the chain. A new result is presented and applied to bound the smallest (most negative) eigenvalue. This result is a modification of a lemma by Diaconis and Stroock, and by using it we avoid working with a lazy chain. A multicommodity flow argument is used to bound the second-largest eigenvalue of the chain. This argument is based on the analysis of a related Markov chain for undirected regular graphs by Cooper, Dyer and Greenhill, but with significant extension required.
No associations
LandOfFree
A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-692158