Related papers: Phase Transition for Glauber Dynamics for Independ…
Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. Applications include Markov Chain Monte Carlo (MCMC) simulation and distributed scheduling for wireless networks. In…
The Glauber dynamics for the classical $2$-spin Curie-Weiss model on $N$ nodes with inverse temperature $\beta$ and zero external field is known to mix in time $\Theta(N\log N)$ for $\beta < \frac{1}{2}$, in time $\Theta(N^{3/2})$ at $\beta…
We consider a branching random walk with binary state space and index set $T^k$, the infinite rooted tree in which each node has k children (also known as the model of "broadcasting on a tree"). The root of the tree takes a random value 0…
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 algebraic properties of partition functions, particularly the location of zeros, through the lens of rapidly mixing Markov chains. The classical Lee-Yang program initiated the study of phase transitions via locating complex zeros…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…
Let $\gS=(V,E)$ be a finite, $d$-regular bipartite graph. For any $\lambda>0$ let $\pi_\lambda$ be the probability measure on the independent sets of $\gS$ in which the set $I$ is chosen with probability proportional to $\lambda^{|I|}$…
The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…
We investigate relaxation dynamics along the entire first-order phase transition line by analyzing the time evolution of the free energy landscape in the three-dimensional kinetic Ising model. Near the critical temperature $T_{\rm c}$, the…
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…
We study the phase transition in a class of fiber bundle models in which the fiber strengths are distributed randomly within a finite interval and global load sharing is assumed. The dynamics is expressed as recursion relations for the…
The random-cluster model with parameters $(p,q)$ is a random graph model that generalizes bond percolation ($q=1$) and the Ising and Potts models ($q\geq 2$). We study its Glauber dynamics on $n\times n$ boxes $\Lambda_{n}$ of the integer…
A stochastic process, when subject to resetting to its initial condition at a constant rate, generically reaches a non-equilibrium steady state. We study analytically how the steady state is approached in time and find an unusual relaxation…
Under an applied external load the global load-sharing fiber bundle model, with individual fiber strength thresholds sampled randomly from a probability distribution, will relax to an equilibrium state, or to complete bundle breakdown. The…
Masked language models (MLMs) define local conditional distributions over tokens but do not, in general, correspond to any consistent joint distribution over sequences. This raises a fundamental question: what global distributional behavior…
Consider a low temperature stochastic Ising model in the phase coexistence regime with Markov semigroup $P_t$. A fundamental and still largely open problem is the understanding of the long time behavior of $\d_\h P_t$ when the initial…
In the hard-core model on a finite graph we are given a parameter lambda>0, and an independent set I arises with probability proportional to lambda^|I|. On infinite graphs a Gibbs distribution is defined as a suitable limit with the correct…
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when lambda < (ln 2-o(1))ln^2(k)/(2 lnln(k))…
We study the mixing time of systematic scan Glauber dynamics Ising model on the complete graph. On the complete graph $K_n$, at each time, $k \leq n$ vertices are chosen uniformly random and are updated one by one according to the uniformly…
We study how to establish $\textit{spectral independence}$, a key concept in sampling, without relying on total influence bounds, by applying an $\textit{approximate inverse}$ of the influence matrix. Our method gives constant upper bounds…