Related papers: The Ising Partition Function: Zeros and Determinis…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…
Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #SAT to approximate. We study #BIS…
We investigate analytically and numerically an Ising spin model with ferromagnetic coupling defined on random graphs corresponding to Feynman diagrams of a $\phi^q$ field theory, which exhibits a mean field phase transition. We explicitly…
We consider the Partition problem and propose a deterministic FPTAS (Fully Polynomial-Time Approximation Scheme) that runs in $\widetilde{O}(n + 1/\varepsilon)$-time. This is the best possible (up to a polylogarithmic factor) assuming the…
We discuss analytical approximation schemes for the dynamics of diluted spin models. The original dynamics of the complete set of degrees of freedom is replaced by a hierarchy of equations including an increasing number of global…
The theoretical models providing mathematical abstractions for several significant optimization problems in machine learning, combinatorial optimization, computer vision and statistical physics have intrinsic similarities. We propose a…
Partitioning is a well studied research problem in the area of VLSI physical design automation. In this problem, input is an integrated circuit and output is a set of almost equal disjoint blocks. The main objective of partitioning is to…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
This is the second in a series of three 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 study the fusion…
Lee-Yang zeros are points in the complex plane of an external control parameter at which the partition function vanishes for a many-body system of finite size. In the thermodynamic limit, the Lee-Yang zeros approach the critical value on…
We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
We give a deterministic polynomial-time approximation scheme (FPTAS) for the volume of the truncated fractional matching polytope for graphs of maximum degree $\Delta$, where the truncation is by restricting each variable to the interval…
The Ising model is important in statistical modeling and inference in many applications, however its normalizing constant, mean number of active vertices and mean spin interaction -- quantities needed in inference -- are computationally…
A general numerical method is presented to locate the partition function zeros in the complex beta plane for large lattice sizes. We apply this method to the 2D Ising model and results are reported for square lattice sizes up tp L=64. We…
We study the stochastic parallel dynamics of Ising spin systems defined on finitely connected directed random graphs with arbitrary degree distributions, using generating functional analysis. For fully asymmetric graphs the dynamics of the…
The Ising model on ``thin'' graphs (standard Feynman diagrams) displays several interesting properties. For ferromagnetic couplings there is a mean field phase transition at the corresponding Bethe lattice transition point. For…
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…
Understanding generalization in deep learning has been one of the major challenges in statistical learning theory over the last decade. While recent work has illustrated that the dataset and the training algorithm must be taken into account…