Related papers: Inapproximability After Uniqueness Phase Transitio…
A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…
Phase diagrams chart material properties with respect to one or more external or internal parameters such as pressure or magnetisation; as such, they play a fundamental role in many theoretical and applied fields of science. In this work,…
We explore supersymmetry breaking in the light of a rich fixed-point structure of two-dimensional supersymmetric Wess-Zumino models with one supercharge using the functional renormalization group (RG). We relate the dynamical breaking of…
This is the first of a series of papers considering symmetry properties of quantum systems over 2D graphs or manifolds, with continuous spins, in the spirit of the Mermin--Wagner theorem. In the model considered here (quantum rotators) the…
The pure spinor formulation of superstring theory includes an interacting sector of central charge $c_{\lambda}=22$, which can be realized as a curved $\beta\gamma$ system on the cone over the orthogonal Grassmannian $\text{OG}^{+}(5,10)$.…
We study 2d U(1) gauge Higgs systems with a $\theta$-term. For properly discretizing the topological charge as an integer we introduce a mixed group- and algebra-valued discretization (MGA scheme) for the gauge fields, such that the charge…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
We study a two-parameter family of quantum spin systems on the complete graph, which is the most general model invariant under the complex orthogonal group. In spin $S=\frac{1}{2}$ it is equivalent to the XXZ model, and in spin $S=1$ to the…
We aim at understanding for which (complex) values of the potential the pinning partition function vanishes. The pinning model is a Gibbs measure based on discrete renewal processes with power law inter-arrival distributions. We obtain some…
A shift-invariant system is a collection of functions $\{g_{m,n}\}$ of the form $g_{m,n}(k) = g_m(k-an)$. Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual…
The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite.…
In the traditional quantum theory, one-dimensional quantum spin models possess a factorization surface where the ground states are fully separable having vanishing bipartite as well as multipartite entanglement. We report that in the…
We assign an arbitrary density matrix to a weighted graph and associate to it a graph zeta function that is both a generalization of the Ihara zeta function and a special case of the edge zeta function. We show that a recently developed…
We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as strong correlation decay), under the assumption that, for…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
Hamilton Jacobi (HJ) Reachability is a formal verification tool widely used in robotic safety analysis. Given a target set as unsafe states, a dynamical system is guaranteed not to enter the target under the worst-case disturbance if it…
Based on the spectral statistics obtained in numerical simulations on three dimensional disordered systems within the tight--binding approximation, a new superuniversal scaling relation is presented that allows us to collapse data for the…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
Let $W_N(\beta) = \mathrm{E}_0\left[e^{ \sum_{n=1}^N \beta \omega(n,S_n) - N\beta^2/2}\right]$ be the partition function of a two-dimensional directed polymer in a random environment, where $\omega(i,x), i\in \mathbb{N}, x\in \mathbb{Z}^2$…
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…