论文信息 - Random Sampling of Euler Tours

Random Sampling of Euler Tours

Abstract. We define a Markov chain on the set of Euler tours of a given Eulerian graph based on transformations first defined by Kotzig in 1966. We prove that the chain is rapidly mixing if the maximum degree in the given graph is 6, thus obtaining an efficient algorithm for sampling and counting the set of Euler tours for such an Eulerian graph.

Santosh S. Vempala | Prasad Tetali

[1] L. Lovász. Combinatorial problems and exercises , 1979 .

[2] Anton Kotzig,et al. Transformations of Euler Tours , 1980 .

[3] A. Bouchet,et al. κ -Transformations, Local Complementations and Switching , 1990 .

[4] Prasad Tetali,et al. Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) , 1999, SODA.

[5] Brendan D. McKay,et al. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs , 1990, Comb..

[6] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[7] Béla Bollobás,et al. The interlace polynomial: a new graph polynomial , 2000, SODA '00.