相关论文: Sampling Colourings of the Triangular Lattice

We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\td(G)$ as…

Recently, Eldan, Koehler, and Zeitouni (2020) showed that Glauber dynamics mixes rapidly for general Ising models so long as the difference between the largest and smallest eigenvalues of the coupling matrix is at most $1 - \epsilon$ for…

We prove that the single-site Glauber dynamics for sampling proper $q$-colorings mixes in $O_\Delta(n\log n)$ time on line graphs with $n$ vertices and maximum degree $\Delta$ when $q>(1+o(1))\Delta$. The main tool in our proof is the…

We consider the problem of counting the number of 3-colourings of the edges (bonds) of the 4-8 lattice and the 3-12 lattice. These lattices are Archimedean with coordination number 3, and can be regarded as decorated versions of the square…

We examine the problem of almost-uniform sampling proper $q$-colorings of a graph whose maximum degree is $\Delta$. A famous result, discovered independently by Jerrum(1995) and Salas and Sokal(1997), is that, assuming $q > (2+\delta)…

We consider the Ising, and more generally, $q$-state Potts Glauber dynamics on random $d$-regular graphs on $n$ vertices at low temperatures $\beta \gtrsim \frac{\log d}{d}$. The mixing time is exponential in $n$ due to a bottleneck between…

We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as…

We perform large scale simulations of the frustrated Ising lattice gas, a three-dimensional lattice model of a structural glass, using the parallel tempering technique. We evaluate the spin and density overlap distributions, and the…

We study analytically the Ising model coupled to random lattices in dimension three and higher. The family of random lattices we use is generated by the large N limit of a colored tensor model generalizing the two-matrix model for Ising…

Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…

This paper deals with the stochastic Ising model with a temperature shrinking to zero as time goes to infinity. A generalization of the Glauber dynamics is considered, on the basis of the existence of simultaneous flips of some spins. Such…

In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \emph{FPRAS}es for the Potts model and the number of $k$-colorings of the graph.

Inspired by recent advances in the fabrication of surface superlattices, and in particular the triangular lattice made of tin (Sn) atoms on silicon, we study an extended Hubbard mode on a triangular lattice. The observations of magnetism in…

For general antiferromagnetic 2-spin systems, including the hardcore model and the antiferromagnetic Ising model, there is an $\mathsf{FPTAS}$ for the partition function on graphs of maximum degree $\Delta$ when the infinite regular tree…

We show that the anti-ferromagnetic Potts model on trees exhibits strong spatial mixing for a near-optimal range of parameters. Our work complements recent results of Chen, Liu, Mani, and Moitra [arXiv.2304.01954] who showed this to be true…

Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…

We introduce efficient algorithms for approximate sampling from symmetric Gibbs distributions on the sparse random (hyper)graph. The examples we consider include (but are not restricted to) important distributions on spin systems and…

We study Glauber dynamics for sampling from discrete distributions $\mu$ on the hypercube $\{\pm 1\}^n$. Recently, techniques based on spectral independence have successfully yielded optimal $O(n)$ relaxation times for a host of different…

Let $T$ be a tree on $n$ vertices and with maximum degree $\Delta$. We show that for $k\geq \Delta+1$ the Glauber dynamics for $k$-edge-colourings of $T$ mixes in polynomial time in $n$. The bound on the number of colours is best possible…

Interfacing unbiased quantum Monte Carlo simulations with state-of-art analytic continuation techniques, we obtain exact numerical results for dynamical density and spin correlations in the attractive Hubbard model, describing a…