Related papers: The computational hardness of counting in two-spin…
We address the problem of distributed computation of arbitrary functions of two correlated sources $X_1$ and $X_2$, residing in two distributed source nodes, respectively. We exploit the structure of a computation task by coding source…
We consider the problem of reconstructing the graph underlying an Ising model from i.i.d. samples. Over the last fifteen years this problem has been of significant interest in the statistics, machine learning, and statistical physics…
We characterize the uniqueness condition in the hardcore model for bipartite graphs with degree bounds only on one side, and provide a nearly linear time sampling algorithm that works up to the uniqueness threshold. We show that the…
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks…
Counting the independent sets of a graph is a classical #P-complete problem, even in the bipartite case. We give an exponential-time approximation scheme for this problem which is faster than the best known algorithm for the exact problem.…
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…
We introduce an algorithm for estimating the entropy of pairwise, probabilistic graph models by leveraging bridges between social communities and an accurate entropy estimator on sparse samples. We propose using a measure of investment from…
We describe various aspects of statistical mechanics defined in the complex temperature or coupling-constant plane. Using exactly solvable models, we analyse such aspects as renormalization group flows in the complex plane, the distribution…
Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches…
We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$…
In this paper the exact solution and correlation functions for a double-chain Ising model with multi-spin interactions and symmetric Hamiltonian density are obtained. The study employs the transfer matrix method to derive fundamental…
The partition function of the 2D Ising model coupled to an external magnetic field is studied. We show that the sum over the spin variables can be reduced to an integration over a finite number of variables. This integration must be…
We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…
We develop a statistical field theory that describes the large-N limit of a system of Brownian particles with quenched random pairwise interactions on a compact two-dimensional Riemannian manifold. The resulting Frustrated Fields (F2) model…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
The model of p Ising spins coupled to 2d gravity, in the form of a sum over planar phi-cubed graphs, is studied and in particular the two-point and spin-spin correlation functions are considered. We first solve a toy model in which only a…
We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a…
Strongly non-Gaussian ensembles of large random matrices possessing unitary symmetry and logarithmic level repulsion are studied both in presence and absence of hard edge in their energy spectra. Employing a theory of polynomials orthogonal…
We consider a model of p independent Ising spins on a dynamical planar phi-cubed graph. Truncating the free energy to two terms yields an exactly solvable model that has a third order phase transition from a pure gravity region (gamma=-1/2)…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…