Related papers: Rapid Mixing at the Uniqueness Threshold
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 investigate the effect of disorder on the Curie-Weiss model with Glauber dynamics. In particular, we study metastability for spin-flip dynamics on the Erd\H{o}s-R\'enyi random graph $ER_n(p)$ with $n$ vertices and with edge retention…
In this paper, we prove a general result concerning finite-range, attractive interacting particle systems on $\{-1, 1\}^{\mathbb{Z}^d}$. If the particle system has a unique stationary measure and, in a precise sense, relaxes to this…
Symmetry breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this paper we work in the LOCAL model (where the input graph and…
Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks ("layers"). Here, the Ising model on multiplex networks with two layers is considered,…
A family of nonequilibrium kinetic Ising models, introduced earlier, evolving under the competing effect of spin flips at {\it zero temperature} and nearest neighbour random spin exchanges is further investigated here. By increasing the…
For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…
We present novel results for fast mixing of Glauber dynamics using the newly introduced and powerful Spectral Independence method from [Anari, Liu, Oveis-Gharan: FOCS 2020]. In our results, the parameters of the Gibbs distribution are…
We show that the natural Glauber dynamics mixes rapidly and generates a random proper edge-coloring of a graph with maximum degree $\Delta$ whenever the number of colors is at least $q\geq (\frac{10}{3} + \epsilon)\Delta$, where…
We consider polynomial long-range Ising models in one dimension, with ferromagnetic pair interactions decaying with power $2-\alpha$ (for $0 \leq \alpha < 1$), and prepared with randomly chosen boundary conditions. We show that at low…
This paper studies the problem of clustering in the two-component Gaussian mixture model where the centers are separated by $2\Delta$ for some $\Delta>0$. We characterize the exact phase transition threshold, given by $$ \bar{\Delta}_n^{2}…
We investigate the convergence properties of popular data-augmentation samplers for Bayesian probit regression. Leveraging recent results on Gibbs samplers for log-concave targets, we provide simple and explicit non-asymptotic bounds on the…
We study metric versions of transitivity, mixing, and hypercyclicity for continuous maps, based on intersections of the form \( f^{n}(U)\cap B_{\delta}(V)\neq\varnothing. \) We introduce $\delta$-topological transitivity,…
We show that the Jerrum-Sinclair Markov chain on matchings mixes in time $\widetilde{O}(\Delta^2 m)$ on any graph with $n$ vertices, $m$ edges, and maximum degree $\Delta$, for any constant edge weight $\lambda>0$. For general graphs with…
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion…
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs $G = (V, E)$. The best known algorithm for this problem till date runs in $O(m \sqrt{n})$ time due to Micali and Vazirani \cite{MV80}.…
Both the antiferromagnetic Ising model and the hard-core model could be said to be tractable on line graphs of bounded degree. For example, Glauber dynamics is rapidly mixing in both cases. In the case of the hard-core model, we know that…
The goal of this paper is to understand the complexity of symmetry breaking problems, specifically maximal independent set (MIS) and the closely related $\beta$-ruling set problem, in two computational models suited for large-scale graph…
A popular method for sampling from high-dimensional distributions is the \emph{Gibbs sampler}, which iteratively resamples sites from the conditional distribution of the desired measure given the values of the other coordinates. 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…