English
Related papers

Related papers: The complexity of approximating the complex-valued…

200 papers

We explore connections between the phenomenon of correlation decay and the location of Lee-Yang and Fisher zeros for various spin systems. In particular we show that, in many instances, proofs showing that weak spatial mixing on the Bethe…

Computational Complexity · Computer Science 2022-08-05 Jingcheng Liu , Alistair Sinclair , Piyush Srivastava

We obtain an explicit expression for the multipoint energy correlations of a non solvable two-dimensional Ising models with nearest neighbor ferromagnetic interactions plus a weak finite range interaction of strength $\lambda$, in a scaling…

Mathematical Physics · Physics 2012-09-19 Alessandro Giuliani , Rafael L. Greenblatt , Vieri Mastropietro

Many iterative and non-iterative methods have been developed for inverse problems associated with Ising models. Aiming to derive an accurate non-iterative method for the inverse problems, we employ the tree-reweighted approximation. Using…

Machine Learning · Statistics 2018-05-30 Takashi Sano

The partition function of a system of galaxies in gravitational interaction can be cast in an Ising Model form, and this reformulated via a Hubbard--Stratonovich transformation into a three dimensional stochastic and classical scalar field…

Astrophysics · Physics 2007-05-23 J. Perez--Mercader , T. Goldman , D. Hochberg , R. Laflamme

We give a Pfaffian formula to compute the partition function of the Ising model on any graph $G$ embedded in a closed, possibly non-orientable surface. This formula, which is suitable for computational purposes, is based on the relation…

Mathematical Physics · Physics 2020-08-26 Anh Minh Pham

We study the multi-component Ising model, which is also known as the block Ising model. In this model, the particles are partitioned into a fixed number of groups with a fixed proportion, and the interaction strength is determined by the…

Probability · Mathematics 2023-11-03 Seoyeon Yang

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…

Machine Learning · Statistics 2015-02-04 Jason K. Johnson , Diane Oyen , Michael Chertkov , Praneeth Netrapalli

The qualitative aspects of the phase diagram of the Ising model on the cubic lattice, with ferromagnetic nearest-neighbor interactions ($J_{1}$) and antiferromagnetic next-nearest-neighbor couplings ($J_{2}$) are analyzed in the plane…

We study the maximum and minimum occupancy fraction of the antiferromagnetic Ising model in regular graphs. The minimizing problem is known to determine a computational threshold in the complexity of approximately sampling from the Ising…

Combinatorics · Mathematics 2024-12-25 Ewan Davies , Olivia LeBlanc

In this thesis, we present results on phase transition for two models: the semi-infinite Ising model with a decaying field, and the long-range Ising model with a random field. We study the semi-infinite Ising model with an external field…

Mathematical Physics · Physics 2024-03-11 João Maia

We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…

Probability · Mathematics 2018-01-23 Hugo Duminil-Copin , Vincent Tassion

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

Probability · Mathematics 2021-07-01 Alexander Barvinok , Nicholas Barvinok

We analyze the partition function of the Ising model on graphs of two different types: complete graphs, wherein all nodes are mutually linked and annealed scale-free networks for which the degree distribution decays as $P(k)\sim…

Statistical Mechanics · Physics 2016-03-23 M. Krasnytska , B. Berche , Yu. Holovatch , R. Kenna

A periodic Ising model is one endowed with interactions that are invariant under translations of members of a full-rank sublattice $\mathfrak{L}$ of $\mathbb{Z}^2$. We give an exact, quantitative description of the critical temperature,…

Mathematical Physics · Physics 2012-04-10 Zhongyang Li

We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others,…

Data Structures and Algorithms · Computer Science 2019-06-06 Sarah Cannon , Will Perkins

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…

Statistical Mechanics · Physics 2022-05-24 Anshu Priya , M V Sangaranarayanan

It has been suggested that an information geometric view of statistical mechanics in which a metric is introduced onto the space of parameters provides an interesting alternative characterisation of the phase structure, particularly in the…

Statistical Mechanics · Physics 2009-11-07 W. Janke , D. A. Johnston , Ranasinghe P. K. C. Malmini

We study the zeros of the partition function in the complex temperature plane (Fisher zeros) and in the complex external field plane (Lee-Yang zeros) of a frustrated Ising model with competing nearest-neighbor ($J_1 > 0$) and…

Statistical Mechanics · Physics 2024-10-16 Denis Gessert , Martin Weigel , Wolfhard Janke

The partition functions of ferromagnetic Ising models of square lattices in a finite magnetic field is deduced using topological considerations within a heuristic graph-theoretical approach. These equations are derived separately for low…

Statistical Mechanics · Physics 2026-01-15 M V Vismaya , M V Sangaranarayanan

We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$. The counting…

Data Structures and Algorithms · Computer Science 2017-01-09 Renjie Song , Yitong Yin , Jinman Zhao