Related papers: Symmetric Vertex Models on Planar Random Graphs
We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…
We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a…
With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…
In the usual matrix-model approach to random discretized two-dimensional manifolds, one introduces n Ising spins on each cell, i.e. a discrete version of 2D quantum gravity coupled to matter with a central charge n/2. The matrix-model…
The non-equilibrium random-field Ising model is well studied, yet there are outstanding questions. In two dimensions, power law scaling approaches fail and the critical disorder is difficult to pin down. Additionally, the presence of…
In this paper we consider a 2d random Ising system on a square lattice with nearest neighbour interactions. The disorder is short range correlated and asymmetry between the vertical and the horizontal direction is admitted. More precisely,…
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…
A lattice quantum gravity model in 4 dimensional Riemannian spacetime is constructed based on the SU(2) Ashtekar formulation of general relativity. This model can be understood as one of the family of models sometimes called ``spin foam…
We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…
A systematic study of both classical and quantum geometric frustrated Ising models with a competing ordering mechanism is reported in this paper. The ordering comes in the classical case from a coupling of 2D layers and in the quantum model…
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex…
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {\em Online Windowed Non-Bipartite Matching}…
Motivated by recent interest in 2+1 dimensional quantum dimer models, we revisit Fisher's mapping of two dimensional Ising models to hardcore dimer models. First, we note that the symmetry breaking transition of the ferromagetic Ising model…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We propose a rate equation approach to compute two vertex correlations in scale-free growing network models based in the preferential attachment mechanism. The formalism, based on previous work of Szab\'o \textit{et al.} [Phys. Rev. E…
An outstanding challenge for models of non-perturbative quantum gravity is the consistent formulation and quantitative evaluation of physical phenomena in a regime where geometry and matter are strongly coupled. After developing appropriate…
Given a graph $G = (V,E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots,V_k$. Metrics for compactness, contiguity, and balance…
We construct a weight matrix for the 3D Ising model satisfying the so-called twisted tetrahedron equation. The result is based on the theory of the n-simplicial complex and the invented recursion procedure on the space of n-simplex…