Related papers: The Ising Partition Function: Zeros and Determinis…
Using a combinatorial method, the partition functions for two-dimensional nearest neighbour Ising models have been derived for a square lattice of 16 sites in the presence of the magnetic field. A novel hierarchical method of enumeration of…
We present a novel quantum algorithm for estimating Gibbs partition functions in sublinear time with respect to the logarithm of the size of the state space. This is the first speed-up of this type to be obtained over the seminal…
An emerging trend in approximate counting is to show that certain `low-temperature' problems are easy on typical instances, despite worst-case hardness results. For the class of regular graphs one usually shows that expansion can be…
The exact partition function of the two-dimensional nearest neighbour Ising model pertaining to square lattices is derived for N sites in the case of a non-vanishing magnetic field.When the magnetic field is zero,the partition functions…
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of moments and the interpolation method, we pinpoint the replica…
We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…
We study the convergence rate of stochastic optimization of exact (NP-hard) objectives, for which only biased estimates of the gradient are available. We motivate this problem in the context of learning the structure and parameters of Ising…
The partition function for two-dimensional nearest neighbour Ising models in the presence of a magnetic field is derived . A comparison with the partition functions predicted by Onsager is carried out. The critical temperature estimated by…
We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\subseteq\mathbb{R}^d$, we compute a $(1+\varepsilon)$-factor approximation to $\mathop…
The main results of this paper provide an Efficient Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus (and non-orientable genus) of dense graphs. By dense we mean that $|E(G)|\ge \alpha |V(G)|^2$ for some fixed…
Spin glasses are fundamental probability distributions at the core of statistical physics, the theory of average-case computational complexity, and modern high-dimensional statistical inference. In the mean-field setting, we design…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
This is the first in a series of articles about recovering the full algebraic structure of a boundary conformal field theory (CFT) from the scaling limit of the critical Ising model in slit-strip geometry. Here, we introduce spaces of…
We investigate zero-field Ising models on periodic approximants of planar quasiperiodic tilings by means of partition function zeros and high-temperature expansions. These are obtained by employing a determinant expression for the partition…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
To simulate indistinguishable particles, recent studies of path-integral molecular dynamics formulated their partition function $Z$ as a recurrence relation involving a variable $\xi$, with $\xi=1$(-1) for bosons (fermions). Inspired by…
One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is…