Related papers: On sampling symmetric Gibbs distributions on spars…
We consider sequences of large sparse random graphs whose degree distribution approaches a limit with finite mean. This model includes both the random regular graphs and the Erd\"os-Renyi graphs of constant average degree. We prove that the…
We discuss the utility of analytical and numerical investigation of spin models, in particular spin glasses, on ordinary ``thin'' random graphs (in effect Feynman diagrams) using methods borrowed from the ``fat'' graphs of two dimensional…
We establish a strict asymptotic inequality between a class of graph partition problems on the sparse End\H{o]s-R\'enyi and random regular graph ensembles with the same average degree. Along the way, we establish a variational…
We consider the statistical properties over disordered samples of the overlap distribution $P_{\cal J}(q)$ which plays the role of an order parameter in spin-glasses. We show that near zero temperature (i) the {\it typical} overlap…
We examined energy spectrums of some particular systems of binary spins. It is shown that the configuration space can be divided into classes, and in the limit the energy distributions in these classes can be approximated by the normal…
The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this paper, we introduce a herding variant of this algorithm, called herded Gibbs, that is entirely deterministic. We prove that herded Gibbs…
This paper investigates group distributionally robust optimization (GDRO) with the goal of learning a model that performs well over $m$ different distributions. First, we formulate GDRO as a stochastic convex-concave saddle-point problem,…
We present a Gibbs sampler for the Dempster-Shafer (DS) approach to statistical inference for Categorical distributions. The DS framework extends the Bayesian approach, allows in particular the use of partial prior information, and yields…
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two extremal cases are considered: (1) the +/- J spin glass, and…
Bayesian estimation of Gaussian graphical models has proven to be challenging because the conjugate prior distribution on the Gaussian precision matrix, the G-Wishart distribution, has a doubly intractable partition function. Recent…
The aim of this review paper is to give a panoramic of the impact of spin glass theory and statistical physics in the study of the K-sat problem. The introduction of spin glass theory in the study of the random K-sat problem has indeed left…
Random geometric graphs defined on Euclidean subspaces, also called Gilbert graphs, are widely used to model spatially embedded networks across various domains. In such graphs, nodes are located at random in Euclidean space, and any two…
Sampling a target probability distribution with an unknown normalization constant is a fundamental challenge in computational science and engineering. Recent work shows that algorithms derived by considering gradient flows in the space of…
We study statistical properties of 3D classical spin glass layer of certain width and infinite length. The 3D spin glass is represented as an ensemble of disordered 1D spatial spin-chains (SSC) where interactions are random between…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
Drawing from the theory of stochastic differential equations, we introduce a novel sampling method for known distributions and a new algorithm for diffusion generative models with unknown distributions. Our approach is inspired by the…
Obtaining the low-energy configurations of spin glasses that have rugged energy landscapes is of direct relevance to combinatorial optimization and fundamental science. Search-based heuristics have difficulty with this task due to the…
We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…
We introduce a new paradigm, $\textit{measure synchronization}$, for synchronizing graphs with measure-valued edges. We formulate this problem as maximization of the cycle-consistency in the space of probability measures over relative…
The Gibbs sampler, also known as the coordinate hit-and-run algorithm, is a Markov chain that is widely used to draw samples from probability distributions in arbitrary dimensions. At each iteration of the algorithm, a randomly selected…