Abstract
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree Δ of a vertex and the minimum size m of an edge satisfy m ≥ 2Δ +1. We also state results that the Glauber dynamics for proper q-colourings of a hypergraph mixes rapidly if m ≥ 4 and q > Δ, and if m = 3 and q ≥1.65Δ. We give related results on the hardness of exact and approximate counting for both problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bordewich, M., Dyer, M., Karpinski, M.: Path coupling using stopping times and counting independent sets and colourings in hypergraphs (2005), http://arxiv.org/abs/math.PR/0501081
Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurrence optimization. Electronic Colloquium on Computational Complexity 10 (2003), Technical Report TR03-008
Bubley, R.: Randomized algorithms: approximation, generation and counting. Springer, London (2001)
Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 248–257. SIAM, Philadelphia (1997)
Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 595–601. ACM, New York (2003)
Dinur, I., Regev, O., Smyth, C.: The hardness of 3-uniform hypergraph coloring. In: Proc. 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 33–42. IEEE, Los Alamitos (2002)
Dyer, M., Frieze, A., Hayes, T., Vigoda, E.: Randomly coloring constant degree graphs. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 582–589. IEEE, Los Alamitos (2004)
Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. SIAM Journal on Computing 31, 1527–1541 (2002)
Dyer, M., Goldberg, L., Greenhill, C., Jerrum, M., Mitzenmacher, M.: An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM Journal on Computing 30, 1962–1975 (2001)
Dyer, M., Greenhill, C.: On Markov chains for independent sets. Journal of Algorithms 35, 17–49 (2000)
Garey, M., Johnson, D.: Computer and intractability. W. H. Freeman and Company, New York (1979)
Hayes, T., Vigoda, E.: Variable length path coupling. In: Proc. 15th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2004), pp. 103–110. SIAM, Philadelphia (2004)
Hofmeister, T., Lefmann, H.: Approximating maximum independent sets in uniform hypergraphs. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 562–570. Springer, Heidelberg (1998)
Janson, S., Łuczak, T., Ruciński, A.: Random graphs. Wiley-Interscience, New York (2000)
Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structure and Algorithms 7, 157–165 (1995)
Jerrum, M.: Counting, sampling and integrating: algorithms and complexity. ETH Zürich Lectures in Mathematics, Birkhäuser, Basel (2003)
Krivelevich, M., Nathaniel, R., Sudakov, B.: Approximating coloring and maximum independent sets in 3-uniform hypergraphs. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 327–328. SIAM, Philadelphia (2001)
Luby, M., Vigoda, E.: Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms 15, 229–241 (1999)
Mitzenmacher, M., Niklova, E.: Path coupling as a branching process, unpublished manuscript (2002)
Molloy, M.: Very rapidly mixing Markov chains for 2Δ-coloring and for independent sets in a graph with maximum degree 4. Random Structures and Algorithms 18, 101–115 (2001)
Salas, J., Sokal, A.: Absence of phase transition for anti-ferromagnetic Potts models via the Dobrushin uniqueness theorem. Journal of Statistical Physics 86, 551–579 (1997)
Vigoda, E.: A note on the Glauber dynamics for sampling independent sets.The Electronic Journal of Combinatorics 8, R8(1) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordewich, M., Dyer, M., Karpinski, M. (2005). Path Coupling Using Stopping Times. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_3
Download citation
DOI: https://doi.org/10.1007/11537311_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)