Related papers: Mixing time for the Ising model: a uniform lower b…
We show that if $G$ is a connected graph of maximum degree at most $4$, which is not $C_{2,5}$, then the strong matching number of $G$ is at least $\frac{1}{9}n(G)$. This bound is tight and the proof implies a polynomial time algorithm to…
The Glauber model on a one-dimensional lattice with boundaries (for the ferromagnetic- and anti-ferromagnetic case) is considered. The large-time behaviour of the one-point function is studied. It is shown that, for any positive…
We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some…
We study the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation…
The phase behavior of Ising spin fluids is studied in the presence of an external magnetic field with the integral equation method. The calculations are performed on the basis of a soft mean spherical approximation using an efficient…
We considerably improve upon the recent result of Martinelli and Toninelli on the mixing time of Glauber dynamics for the 2D Ising model in a box of side $L$ at low temperature and with random boundary conditions whose distribution $P$…
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the…
We analyse the metastable behaviour of the dilute Curie-Weiss model subject to a Glauber dynamics. The model is a random version of a mean-field Ising model, where the coupling coefficients are Bernoulli random variables with mean $p\in…
In this work, we employed the Ising model to identify phase transitions in a magnetic system where the degree distribution of the network follows a power-law and the connections are assortatively mixed. In the Ising model, the spins assume…
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…
We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…
We study the mixing time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models on the integer lattice ${\mathbb Z}^d$. This dynamics is a widely used Markov chain that has largely resisted sharp analysis because it is…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
This paper provides an overview of the research on the metastable behavior of the Ising model. We analyze the transition times from the set of metastable states to the set of the stable states by identifying the critical configurations that…
Vizing's theorem states that every graph $G$ of maximum degree $\Delta$ can be properly edge-colored using $\Delta + 1$ colors. The fastest currently known $(\Delta+1)$-edge-coloring algorithm for general graphs is due to Sinnamon and runs…
The dynamical magnetic properties of an Ising spin glass Fe$_{0.55}$Mn$_{0.45}$TiO$_3$ are studied under various magnetic fields. Having determined the temperature and static field dependent relaxation time $\tau(T;H)$ from ac magnetization…
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that…
We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…
The dynamics of the spins in the Ising model are analyzed using a virtual walk scenario. The system is quenched from a very high temperature to a lower one using the Glauber scheme in one and two dimensions. A walk is associated with each…
The finite size scaling behaviour for the Ising model in five dimensions, with either free or cyclic boundary, has been the subject for a long running debate. The older papers have been based on ideas from e.g. field theory or…