相关论文: Sampling Colourings of the Triangular Lattice

This work establishes novel optimum mixing bounds for the Glauber dynamics on the Hard-core and Ising models. These bounds are expressed in terms of the local connective constant of the underlying graph $G$. This is a notion of effective…

For distributions over discrete product spaces $\prod_{i=1}^n \Omega_i'$, Glauber dynamics is a Markov chain that at each step, resamples a random coordinate conditioned on the other coordinates. We show that $k$-Glauber dynamics, which…

We study the problem of folding of the regular triangular lattice in the presence of a quenched random bending rigidity + or - K and a magnetic field h (conjugate to the local normal vectors to the triangles). The randomness in the bending…

In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…

The associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces…

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…

We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with…

The dynamics of spins on a random graph with ferromagnetic three-spin interactions is used to model the compaction of granular matter under a series of taps. Taps are modelled as the random flipping of a small fraction of the spins followed…

The dynamical structure factor is an important observable of quantum magnets but due to numerical and theoretical limitations, it remains a challenge to make predictions for Hubbard-like models beyond one dimension. In this work, we study…

We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…

In 1995 Stanley conjectured that the chromatic symmetric functions of the graphs $P_{d,2}$, which we call triangular ladders, were $e$-positive. In this paper we confirm this conjecture, which is also an unsolved case of the celebrated…

Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is the algorithm of Weitz (2006) for the hard-core model on…

We study the chaotic behavior of the Gibbs state of spin-glasses under the application of an external magnetic field, in the crossover region where the field intensity scales proportional to $1/\sqrt{N}$, being $N$ the system size. We show…

We present the first results on scalar glueballs in cold, dense matter using lattice simulations of two color QCD. The simulations are carried out on a $6^3 \times 12$ lattice and use a standard hybrid molecular dynamics algorithm for…

We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…

We have introduced a variational method to improve the computation of integrated correlation times in the Parallel Tempering Dynamics, obtaining a better estimate (a lower bound, at least) of the exponential correlation time. Using this…

We discuss the efficiency of the so-called parallel tempering method to equilibrate glassy systems also at low temperatures. The main focus is on two structural glass models, SiO_2 and a Lennard-Jones system, but we also investigate a fully…

We show that every planar graph $G$ has a 2-fold 9-coloring. In particular, this implies that $G$ has fractional chromatic number at most $\frac92$. This is the first proof (independent of the 4 Color Theorem) that there exists a constant…

We characterize numerically the properties of the phase transition of the three dimensional Ising spin glass with Gaussian couplings and of the low temperature phase. We compute critical exponents on large lattices. We study in detail the…

We present the exact solution of the Baxter's three-color problem on a random planar graph, using the random-matrix formulation of the problem, given by B. Eynard and C. Kristjansen. We find that the number of three-coloring of an infinite…