Related papers: Sampling Colourings of the Triangular Lattice
We present a randomized algorithm which takes as input an undirected graph $G$ on $n$ vertices with maximum degree $\Delta$, and a number of colors $k \geq (8/3 + o_{\Delta}(1))\Delta$, and returns -- in expected time…
Motivated by the rapid experimental progress on the spin-orbit-coupled Mott insulators, we propose and study a generic spin model that describes the interaction between the non-Kramers doublets on a triangular lattice and is relevant for…
Notwithstanding great strides that statistical mechanics has made in recent decades, an analytic solution of arguably the simplest model of relaxation dynamics, the Ising model in an applied external field remains elusive even in $1d$.…
We show that multiple filamentation patterns in high-power laser beams, can be described by means of two statistical physics concepts, namely self-similarity of the patterns over two nested scales, and nearest-neighbor interactions of…
We consider the problem of algorithmically sampling from the Gibbs measure of a mixed $p$-spin spherical spin glass. We give a polynomial-time algorithm that samples from the Gibbs measure up to vanishing total variation error, for any…
We present a randomized algorithm that takes as input an undirected $n$-vertex graph $G$ with maximum degree $\Delta$ and an integer $k > 3\Delta$, and returns a random proper $k$-coloring of $G$. The distribution of the coloring is…
Consider $k$-colorings of the complete tree of depth $\ell$ and branching factor $\Delta$. If we fix the coloring of the leaves, as $\ell$ tends to $\infty$, for what range of $k$ is the root uniformly distributed over all $k$ colors? This…
We present a massive equilibrium simulation of the three-dimensional Ising spin glass at low temperatures. The Janus special-purpose computer has allowed us to equilibrate, using parallel tempering, L=32 lattices down to T=0.64 Tc. We…
Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…
In this work, we study and evaluate the impact of a periodic spin-lattice coupling in an Ising-like system on a 2D triangular lattice. Our proposed simple Hamiltonian considers this additional interaction as an effect of preferential phonon…
We consider the "thermodynamic limit"of a d-dimensional lattice of hyperbolic dynamical systems on the 2-torus, interacting via weak and nearest neighbor coupling. We prove that the SRB measure is analytic in the strength of the coupling.…
We show that mixing for local, reversible dynamics of mean field spin glasses is exponentially slow in the low temperature regime. We introduce a notion of free energy barriers for the overlap, and prove that their existence imply that the…
We prove that a uniformly chosen proper $3$-coloring of the $d$-dimensional discrete torus has a very rigid structure when the dimension $d$ is sufficiently high. We show that with high probability the coloring takes just one color on…
A three-polar, cf. T. Gregor, J. Halu\v{s}ka, Lexicographical ordering and field operations in the complex plane. Stud. Mat. 41(2014), 123--133., $HSV-RGB$ Colour space $\triangle$ was introduced and studied. It was equipped with operations…
We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…
With the discovery of strong coupling physics and superconductivity in Moir\'e superlattices, it's essential to have an understanding of strong coupling driven superconductivity in systems with trigonal symmetry. The simplest lattice model…
Approximate random $k$-colouring of a graph $G$ is a well studied problem in computer science and statistical physics. It amounts to constructing a $k$-colouring of $G$ which is distributed close to {\em Gibbs distribution} in polynomial…
Grotzsch proved that every triangle-free planar graph is 3-colorable. Thomassen proved that every planar graph of girth at least five is 3-choosable. As for other surfaces, Thomassen proved that there are only finitely many 4-critical…
We prove two results on the mixing times of Markov chains for two-spin systems. First, we show that the Glauber dynamics mixes in polynomial time for the Gibbs distributions of antiferromagnetic two-spin systems at the critical threshold of…
We study the fragility of spin glasses to small temperature perturbations numerically using population annealing Monte Carlo. We apply thermal boundary conditions to a three-dimensional Edwards-Anderson Ising spin glass. In thermal boundary…