Related papers: Convergence and coupling for spin glasses and hard…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
We use a random pinning procedure to study amorphous order in two glassy spin models. On increasing the concentration of pinned spins at constant temperature, we find a sharp crossover (but no thermodynamic phase transition) from bulk…
The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…
We introduce efficient algorithms for approximate sampling from symmetric Gibbs distributions on the sparse random (hyper)graph. The examples we consider include (but are not restricted to) important distributions on spin systems and…
We consider spin systems on the integer lattice graph $\mathbb{Z}^d$ with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the…
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…
Computing marginal distributions of discrete or semidiscrete Markov random fields (MRFs) is a fundamental, generally intractable problem with a vast number of applications in virtually all fields of science. We present a new family of…
We consider spin systems with nearest-neighbor interactions on an $n$-vertex $d$-dimensional cube of the integer lattice graph $\mathbb{Z}^d$. We study the effects that exponential decay with distance of spin correlations, specifically the…
Motivated by applications of distributed linear estimation, distributed control and distributed optimization, we consider the question of designing linear iterative algorithms for computing the average of numbers in a network. Specifically,…
This Letter proposes a rescaled adaptive coupling scheme for the synchronization of spatially extended systems. Coupling and synchronization are analyzed from the point view of image filter construction. A length rescaling technique is…
We study the 2-dimensional Ising model at critical temperature on a simply connected subset $\Omega_{\delta}$ of the square grid $\delta\mathbb{Z}^{2}$. The scaling limit of the critical Ising model is conjectured to be described by…
I describe the classic circle-packing problem on a sphere, and the analytic and numerical approaches that have been used to study it. I then present a very simple Markov-chain Monte Carlo algorithm, which succeeds in finding the best…
Parallel tempering is a meta-algorithm for Markov Chain Monte Carlo that uses multiple chains to sample from tempered versions of the target distribution, enhancing mixing in multi-modal distributions that are challenging for traditional…
For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…
We discuss the general link between mode-coupling like equations (which serve as the basis of some recent theories of supercooled liquids) and the dynamical equations governing mean-field spin-glass models, or the dynamics of a particle in…
If we have a system of binary variables and we measure the pairwise correlations among these variables, then the least structured or maximum entropy model for their joint distribution is an Ising model with pairwise interactions among the…
We uncover a new kind of entropic long range order in finite dimensional spin glasses. We study the link-diluted version of the Edwards-Anderson spin glass model with bimodal couplings (J=+/-1) on a 3D lattice. By using exact reduction…
The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…
Apparent critical phenomena, typically indicated by growing correlation lengths and dynamical slowing-down, are ubiquitous in non-equilibrium systems such as supercooled liquids, amorphous solids, active matter and spin glasses. It is often…
We introduce a framework to approximate a Markov Decision Process that stands on two pillars: state aggregation -- as the algorithmic infrastructure; and central-limit-theorem-type approximations -- as the mathematical underpinning of…