Related papers: Rapid Mixing via Coupling Independence for Spin Sy…
We study heat-bath Glauber dynamics for the ferromagnetic Ising model on a finite cycle (a graph where every vertex has degree two). We prove that the relaxation time $\tau_2$ is an increasing function of any of the couplings $J_{xy}$. We…
We study convergence to stationarity for random walks on dynamic random digraphs with given degree sequences. The digraphs undergo full regeneration at independent geometrically distributed random time intervals with parameter $\alpha$.…
We consider a Schelling model of self-organized segregation in an open system that is equivalent to a zero-temperature Ising model with Glauber dynamics, or an Asynchronous Cellular Automaton (ACA) with extended Moore neighborhoods.…
We study the convergence properties of Glauber dynamics for the random field Ising model (RFIM) with ferromagnetic interactions on finite domains of $\mathbb{Z}^d$, $d \ge 2$. Of particular interest is the Griffiths phase where correlations…
We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature $\beta$ and random boundary conditions $\tau$ whose distribution P either stochastically dominates the extremal plus phase (hence the…
This paper considers the optimal control for hybrid systems whose trajectories transition between distinct subsystems when state-dependent constraints are satisfied. Though this class of systems is useful while modeling a variety of…
We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…
We consider paths of a one-dimensional simple random walk conditioned to come back to the origin after L steps (L an even integer). In the 'pinning model' each path \eta has a weight \lambda^{N(\eta)}, where \lambda>0 and N(\eta) is the…
We consider a Glauber dynamics associated with the Ising model on a large two-dimensional box with with minus boundary conditions and in the limit of a vanishing positive external magnetic field. The volume of this box increases…
We prove that the well-studied triangulation flip walk on a convex point set mixes in time O(n^3 log^3 n), the first progress since McShine and Tetali's O(n^5 log n) bound in 1997. In the process we give lower and upper bounds of…
We show how mapping techniques inherent to $N^{2}$-dimensional discrete phase spaces can be used to treat a wide family of spin systems which exhibits squeezing and entanglement effects. This algebraic framework is then applied to the…
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 present an $O^*(1.0919^n)$-time algorithm for finding a maximum independent set in an $n$-vertex graph with degree bounded by 3, which improves the previously known algorithm of running time $O^*(1.0977^n)$ by Bourgeois, Escoffier and…
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…
We study metastability for Glauber spin-flip dynamics on the $N$-dimensional hierarchical lattice with $n$ hierarchical levels. Each vertex carries an Ising spin that can take the values $-1$ or $+1$. Spins interact with an external…
In zero-temperature Glauber dynamics, vertices of a graph are given i.i.d.~initial spins $\sigma_x(0)$ from $\{-1,+1\}$ with $\mathbb{P}_p(\sigma_x(0) = +1)=p$, and they update their spins at the arrival times of i.i.d. Poisson processes to…
The previously fastest algorithm for deciding the existence of an independent cut had a runtime of $\mathcal{O}^*(1.4423^n)$, where $n$ is the order of the input graph. We improve this to $\mathcal{O}^*(1.4143^n)$. In fact, we prove a…
We study the spin-relaxation time in materials where a large spin-orbit coupling (SOC) is present which breaks the spatial inversion symmetry. Such a spin-orbit coupling is realized in zincblende structures and heterostructures with a…
We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.
We show polylogarithmic mixing time bounds for the alternating-scan sampler for positively weighted restricted Boltzmann machines. This is done via analysing the same chain and the Glauber dynamics for ferromagnetic two-spin systems, where…