Search arXivSearch

arXiv · 2603.22432

On sampling diluted Spin-Glasses with unbounded interactions

Abstract

Spin-glasses are natural Gibbs distributions that have been studied in Theoretical CS for many decades. Recently, they have been gaining attention from the community as they emerge naturally in neural computation and learning, network inference, optimisation and other areas. We study the problem of efficiently sampling from spin-glass distributions when the underlying graph is a typical instance of $G(n,d/n)$, i.e., the random graph on $n$ vertices such that each edge appears independently with probability $d/n$, and $d=Θ(1)$. Our focus is on the 2-spin model at inverse temperature $β$. We consider this distribution to be one of the most interesting case of spin-glasses, and one of the most challenging to analyse, since its Gaussian couplings give rise to unbounded interaction. We employ the well-known Glauber dynamics to sample from the aforementioned distribution. We show that for the typical instances of the 2-spin model on $G(n,d/n)$, the mixing time of Glauber dynamics is $O\left(n^{1+Θ(\frac{1}{\sqrt{d}})}\right)$, for any $β\leq \frac{1}{4\sqrt{d}}$. Our results can also be adapted for the case of spin-glass distributions with bounded interactions. In that respect, we obtain rapid mixing of Glauber dynamics for the Viana-Bray model on $G(n,d/n)$ when $β\leq \frac{1}{4\sqrt{d}}$. This improves on the current best bound which is $β<\frac{0.18}{\sqrt{d}}$. We utilise stochastic localisation, and in particular, we build and improve on the scheme introduced in [Liu, Mohanty, Rajaraman and Wu: FOCS 2024]. This is the first time that stochastic localisation is used for diluted spin-glasses, where both degrees and interactions can be unbounded.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charilaos Efthymiou, Kostas Zampetakis. 2026-07-03. On sampling diluted Spin-Glasses with unbounded interactions. https://arxiv.org/abs/2603.22432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM