Related papers: Graph theory and Pfaffian representations of Ising…
We show that it is possible to determine the locus of Fisher zeroes in the thermodynamic limit for the Ising model on planar (``fat'') phi4 random graphs and their dual quadrangulations by matching up the real part of the high- and…
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
Graph convolutional neural networks (GCNNs) have been attracting increasing research attention due to its great potential in inference over graph structures. However, insufficient effort has been devoted to the aggregation methods between…
We generalize the switching lemma of Griffiths, Hurst and Sherman to the random current representation of the Ashkin-Teller model. We then use it together with properties of two-dimensional topology to derive linear relations for…
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…
Given two smooth manifolds with tangent subbundle distributions, an embedding is Pfaffian if its differential sends the distribution on the source into the distribution on the target. In this paper, we consider the question of existence of…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
We use the cavity method to study parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single site probabilities of paths propagating along the edges of the graph. These equations…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
We introduce and study a class of partition functions of an elliptic free-fermionic face model. We study the partition functions with a triangular boundary using the off-diagonal $K$-matrix at the boundary (OS boundary), which was…
The partition function of the Ising model of a graph $G=(V,E)$ is defined as $Z_{\text{Ising}}(G;b)=\sum_{\sigma:V\to \{0,1\}} b^{m(\sigma)}$, where $m(\sigma)$ denotes the number of edges $e=\{u,v\}$ such that $\sigma(u)=\sigma(v)$. We…
Stabilizer codes allow for non-local encoding and processing of quantum information. Deformations of stabilizer surface codes introduce new and non-trivial geometry, in particular leading to emergence of long sought after objects known as…
We obtain the topological expansion of the hermitian matrix model using its representation as a CFT on a hyperelliptic Riemann surface. To each branch point of the Riemann surface we associate an operator which represents a twist field…
A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…
We propose a novel fermionic model on the graphs. The Dirac operator of the model consists of deformed incidence matrices on the graph and the partition function is given by the inverse of the graph zeta function. We find that the…
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…
Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…
Given a skew-symmetric matrix $X$, the Pfaffian of $X$ is defined as the square root of the determinant of $X$. In this article, we give the explicit defining equations of the Rees algebra of a Pfaffian ideal $I$ generated by the maximal…