Related papers: Symmetric Vertex Models on Planar Random Graphs
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
We study a three-dimensional (3D) classical Ising model that is exactly solvable when some coupling constants take certain imaginary values. The solution combines and generalizes the Onsager-Kaufman solution of the 2D Ising model and the…
We elucidate connections between four models in statistical physics and probability theory: (1) the toric code model of Kitaev, (2) the uniform eight-vertex model, (3) random walk on a hypercube, and (4) a classical Ising model with…
We review some aspects of the fermionic interpretation of the two-dimensional Ising model. The use is made of the notion of the integral over the anticommuting Grassmann variables. For simple and more complicated 2D Ising lattices, the…
We continue our study of matrix models of dually weighted graphs. Among the attractive features of these models is the possibility to interpolate between ensembles of regular and random two-dimensional lattices, relevant for the study of…
We compute the genus 0 free energy for the 2-matrix model with quartic interactions, which acts as a generating function for the Ising model's partition function on a random, 4-regular, planar graph. This is consistent with the predictions…
We report the conjectures on the three-dimensional (3D) Ising model on simple orthorhombic lattices, together with the details of calculations for a putative exact solution. Two conjectures, an additional rotation in the fourth curled-up…
Consider a random graph model with $n$ vertices where each vertex has a vertex-type drawn from some discrete distribution. Suppose that the number of arcs to be placed between each pair of vertex-types is known, and that each arc is placed…
The partition function of the 2d Ising model with random nearest neighbor coupling is expressed in the dual lattice made of square plaquettes. The dual model is solved in the the mean field and in different types of Bethe-Peierls…
Sparse models for high-dimensional linear regression and machine learning have received substantial attention over the past two decades. Model selection, or determining which features or covariates are the best explanatory variables, is…
Motivated by the landmark resolution of the 1-2-3 Conjecture, we initiate the study of the parameterized complexity of the Vertex-Coloring {0,1}-Edge-Weighting problem and its generalization, Vertex-Coloring Pre-edge-Weighting, under…
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery…
An inhomogeneous random recursive lattice was constructed from the multi-branched Husimi square lattice. The number of repeating units connected on one vertex was randomly set to be 2 or 3 with a quenched ratio $P_2$ or $P_3$ with…
We study two-dimensional ferromagnetic Ising model on a series of regular lattices, which are represented as the tessellation of polygons with p>=5 sides, such as pentagons (p=5), hexagons (p=6), etc. Such lattices are on hyperbolic planes,…
This manuscript is the first in a series of instalments that investigate spherically symmetric solutions within the effective dynamics program of Loop Quantum Gravity. The choice of lattice is adapted such that it remains invariant under a…
On locally tree-like random graphs, we relate the random cluster model with external magnetic fields and $q\geq 2$ to Ising models with vertex-dependent external fields. The fact that one can formulate general random cluster models in terms…
We study the $\pm J$ three-dimensional Ising model with a spatially uniaxially anisotropic bond randomness on the simple cubic lattice. The $\pm J$ random exchange is applied in the $xy$ planes, whereas in the z direction only a…
The notion of quantum symmetry has recently been extended to include reduced-dimensional transformations and algebraic structures beyond groups. Such generalized symmetries lead to exotic phases of matter and excitations that defy Landau's…
We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched vertices, and we are required to…
Weighted dependency graphs have been recently introduced by the second author, as a toolbox to prove central limit theorems. In this paper, we prove that spins in the $d$-dimensional Ising model display such a weighted dependency structure.…