Advertisement

Random sampling of Euler tours

  • Prasad Tetali
  • Santosh Vempala
Randomness
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1269)

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.

Keywords

Markov Chain Transition System Markov Chain Monte Carlo Method Euler Tour Markov Chain Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Abrham and A. Kotzig, Transformations of Euler tours, Annals of Discrete Mathematics 8 (1980), 65–69.Google Scholar
  2. 2.
    A. Bouchet, k-transformations, local complementations, and Switchings, in Hahn, G., Sabidussi, G., Woodrow, R. (eds.), “Cycles and Rays,” NATO ASI Ser. C, Kluwer Academic Publ. Dordrecht (1990), 41–50.Google Scholar
  3. 3.
    D. Fon der Flaass, Distance between locally equivalent graphs, Metody Diskretnogo Analiza, Novosibirsk 48(1989), 85–94. [In Russian].Google Scholar
  4. 4.
    A. Kotzig, Eulerian lines in finite 4-valent graphs and their transformations, in: P. Erdós and G. Katona, Eds., “Theory of Graphs,” Proc. of the Colloq. held at Tihany, Hungary (1966) (Akademiai Kiado, Publishing House of the Hungarian Academy of Sciences, Budapest (1968), 219–230).Google Scholar
  5. 5.
    B.D. McKay, The asymptotic number of regular tournaments, eulerian digraphs and eulerian oriented graphs, Combinatorica, 10 (1990), 367–377.Google Scholar
  6. 6.
    B.D. McKay and R. Robinson, Asymptotic enumeration of Eulerian circuits in the complete graph, preprint (1995).Google Scholar
  7. 7.
    M. Mihail and P. Winkler, On the number of Eulerian orientations of a graph, Proc. of the 3rd ACM-SIAM Symp. on Discrete Algorithms (1992), 138–145.Google Scholar
  8. 8.
    M.R. Jerrum and A.J. Sinclair, The Markov chain Monte Carlo method, in “Approximation algorithms for NP-hard problems,” D.S. Hochbaum (ed.), PWS Publishing, Boston, 1997.Google Scholar
  9. 9.
    A.J. Sinclair, “Algorithms for random generation & counting: a Markov chain approach,” Progress in Theoretical Computer Science, Birkhäuser (1992).Google Scholar
  10. 10.
    L. Lovász, “Combinatorial Problems and Exercises,” 1993 (second edition), North-Holland, Elsevier Science Publishers (Amsterdam) and Akade'miai Kiado' (Budapest).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Prasad Tetali
    • 1
  • Santosh Vempala
    • 2
  1. 1.School of MathematicsGeorgia Institute of TechnologyAtlanta
  2. 2.School of Computer ScienceCarnegie Mellon UniversityPittsburgh

Personalised recommendations