Related papers: Sampling Colourings of the Triangular Lattice
The Pair Approximation method is modified in order to describe the systems with geometrical frustration. The Ising antiferromagnet on triangular lattice with selective dilution (Kaya-Berker model) is considered and a self-consistent…
A density-functional approach on the hexagonal graphene lattice is developed using an exact numerical solution to the Hubbard model as the reference system. Both nearest-neighbour and up to third nearest-neighbour hoppings are considered…
We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as strong correlation decay), under the assumption that, for…
The magnetization dynamics of the triangular lattice of Ising spin chains is investigated in the framework of a two-dimensional model. The rigid chains are assumed to interact with the nearest neighboring chains, an external magnetic field,…
Lov\'asz and Plummer conjectured, in the mid 1970's, that every cubic graph G with no cutedge has an exponential in |V(G)| number of perfect matchings. In this work we show that every cubic planar graph G whose geometric dual graph is a…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
It is well known that Glauber dynamics on spin systems typically suffer exponential slowdowns at low temperatures. This is due to the emergence of multiple metastable phases in the state space, separated by narrow bottlenecks that are hard…
Is Fully Polynomial-time Randomized Approximation Scheme (FPRAS) for a problem via an MCMC algorithm possible when it is known that rapid mixing provably fails? We introduce several weight-preserving maps for the eight-vertex model on…
Gibbs samplers are preeminent Markov chain Monte Carlo algorithms used in computational physics and statistical computing. Yet, their most fundamental properties, such as relations between convergence characteristics of their various…
The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from this model on the class of bipartite, regular graphs with good…
The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square $G^2$ of a planar graph $G$, depending on the maximum degree $\Delta(G)$ of $G$. The only case that the conjecture is resolved is…
We present here two novel algorithms for simulated tempering simulations, which break detailed balance condition (DBC) but satisfy the skewed detailed balance to ensure invariance of the target distribution. The irreversible methods we…
We consider a variant of Glauber dynamics of Ising spins on a one-dimensional lattice, where each spin flips according to the relative state of the spin to its left. Moreover, each bond allows for two rates; flips which equalize nearest…
We propose a lattice Boltzmann color-gradient model for immiscible ternary fluid flows, which is applicable to the fluids with a full range of interfacial tensions, especially in near-critical and critical states. An interfacial force for…
We study the mixing time of Glauber dynamics on monotone systems. For monotone systems satisfying the entropic independence condition, we prove a new mixing time comparison result for Glauber dynamics. For concrete applications, we obtain…
We introduce a general class of mean-field-like spin systems with random couplings that comprises both the Ising model on inhomogeneous dense random graphs and the randomly diluted Hopfield model. We are interested in quantitative estimates…
Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it takes this chain to mix in $L^1$ on a system…
We address the convergence rate of Markov chains for randomly generating an edge coloring of a given tree. Our focus is on the Glauber dynamics which updates the color at a randomly chosen edge in each step. For a tree $T$ with $n$ vertices…
We give an exact characterization of 3-colorability of triangle-free graphs drawn in the torus, in the form of 186 "templates" (graphs with certain faces filled by arbitrary quadrangulations) such that a graph from this class is not…
In recent times, the theoretical study of the three-dimensional Edwards-Anderson model has produced several rigorous results on the nature of the spin-glass phase. In particular, it has been shown that, as soon as the overlap distribution…