Related papers: Glauber Dynamics on Trees and Hyperbolic Graphs
We study the Glauber dynamics for heavy-tailed spin glasses, in which the couplings are in the domain of attraction of an $\alpha$-stable law for $\alpha\in (0,1)$. We show a sharp description of metastability on exponential timescales, in…
Diffusion on a diluted hypercube has been proposed as a model for glassy relaxation and is an example of the more general class of stochastic processes on graphs. In this article we determine numerically through large scale simulations the…
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…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $\Delta$; our results hold without any further assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum…
In this paper we study metastable behaviour at low temperature of Glauber spin-flip dynamics on random graphs. We fix a large number of vertices and randomly allocate edges according to the Configuration Model with a prescribed degree…
We prove an optimal $O(n \log n)$ mixing time of the Glauber dynamics for the Ising models with edge activity $\beta \in \left(\frac{\Delta-2}{\Delta}, \frac{\Delta}{\Delta-2}\right)$. This mixing time bound holds even if the maximum degree…
The zero-temperature Glauber dynamics of the ferromagnetic Ising model on small-world networks, rewired from a two-dimensional square lattice, has been studied by numerical simulations. For increasing disorder in finite networks, the…
We discuss the eigenvalue spacing statistics of the Glauber matrix for various models of statistical mechanics (a one dimensional Ising model, a two dimensional Ising model, a one dimensional model with a disordered ground state, and a SK…
We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…
We develop a renormalisation group approach to deriving the asymptotics of the spectral gap of the generator of Glauber type dynamics of spin systems with strong correlations (at and near a critical point). In our approach, we derive a…
We consider the Glauber dynamics of a ferromagnetic Ising-Kac model on a three-dimensional periodic lattice of size $(2N + 1)3$, in which the flipping rate of each spin depends on an average field in a large neighborhood of radius…
A key insight from statistical physics about spin systems on random graphs is the central role played by Gibbs measures on trees. We determine the local weak limit of the hardcore model on random regular graphs asymptotically until just…
We have investigated the nature of the dynamical behaviour in low autocorrelation binary sequences. These models do have a glass transition $T_G$ of a purely dynamical nature. Above the glass transition the dynamics is not fully ergodic and…
We consider the ferromagnetic q-state Potts model on a finite grid graph with non-zero external field and periodic boundary conditions. The system evolves according to Glauber-type dynamics described by the Metropolis algorithm, and we…
The slow relaxation and aging of glassy systems can be modelled as a Markov process on a simplified rough energy landscape: energy minima where the system tends to get trapped are taken as nodes of a random network, and the dynamics are…
We study a ferromagnetic Ising model on random graphs with a power-law degree distribution and compute the thermodynamic limit of the pressure when the mean degree is finite (degree exponent $\tau>2$), for which the random graph has a…
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
We study the hard-core model defined on independent sets of an input graph where the independent sets are weighted by a parameter $\lambda>0$. For constant $\Delta$, previous work of Weitz (2006) established an FPTAS for the partition…
The dynamics of structural relaxation in a model polymer glass subject to spatially-homogeneous, time-periodic shear deformation is investigated using molecular dynamics simulations. We study a coarse-grained bead-spring model of short…