Related papers: Inapproximability for Antiferromagnetic Spin Syste…
We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda$ on the unit circle in the complex plane. Complex-valued parameters for the Ising…
We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…
We show that two-dimensional fermions with dispersion $k^2$ or $k^4$ undergo a first-order Stoner transition to a fully spin-polarized state despite that the spin susceptibility diverges at the critical point. We extend our analysis to…
Progress towards the energy breakthroughs needed to combat climate change can be significantly accelerated through the efficient simulation of atomic systems. Simulation techniques based on first principles, such as Density Functional…
The d=1 Ising ferromagnet and spin glass with long-range power-law interactions J r^-a is studied for all interaction range exponents a by a renormalization-group transformation that simultaneously projects local ferromagnetism and…
We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…
The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…
We present a multiloop pseudofermion functional renormalization group (pffRG) approach to quantum spin systems. As a test case, we study the spin-$\tfrac{1}{2}$ Heisenberg model on the kagome lattice, a prime example of a geometrically…
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…
Using transfer-matrix method a correspondence between $2D$ classical spin systems ($2D$ Ising model and six-vertex model) and $1D$ quantum spin systems is considered. We find the transfer matrix in two limits - in a well-known…
The dynamical spin susceptibility is studied in the magnetically-disordered phase of heavy-Fermion systems near the antiferromagnetic quantum phase transition. In the framework of the $S=1/2$ Kondo lattice model, we introduce a perturbative…
The spin-1/2 quantum Heisenberg model is studied in all spatial dimensions d by renormalization-group theory. Strongly asymmetric phase diagrams in temperature and antiferromagnetic bond probability p are obtained in dimensions d \geq 3.…
Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…
We consider $h$-stable local optima of Ising spin glass models, defined as spin configurations such that for nearly all of the spins, flipping their values results in increasing energy by at least a given amount $h$. Spins satisfying this…
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…
The dynamical spin susceptibility is studied in the magnetically-disordered phase of heavy-Fermion systems near the antiferromagnetic quantum phase transition. In the framework of the $S=1/2$ Kondo lattice model, we introduce a perturbative…
The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in…
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained.…
We study the computational complexity of estimating local observables for Gibbs distributions. A simple combinatorial example is the average size of an independent set in a graph. In a recent work, we established NP-hardness of…