Related papers: Symmetric Vertex Models on Planar Random Graphs
We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin'' random graphs in contrast to the fat graphs of the…
We simulate the Ising model on a set of fixed random $\phi^3$ graphs, which corresponds to a {\it quenched} coupling to 2D gravity rather than the annealed coupling that is usually considered. We investigate the critical exponents in such a…
We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independent vertex weights are approximate mixtures of graphs whose…
In this paper we investigate a correspondence among spin and vertex models with the same number of local states on the square lattice with toroidal boundary conditions. We argue that the partition functions of an arbitrary $n$-state spin…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
In this paper we present a new solution of the star-triangle relation having positive Boltzmann weights. The solution defines an exactly solvable two-dimensional Ising-type (edge interaction) model of statistical mechanics where the local…
We survey and enlarge the known mappings of the 16-vertex model, with emphasis on mappings between the even and odd 8-vertex subcases of the general model, also giving new mappings between these models, valid on finite toroidal lattices. In…
The general eight-vertex model on a square lattice is studied numerically by using the Corner Transfer Matrix Renormalization Group method. The method is tested on the symmetric (zero-field) version of the model, the obtained dependence of…
We consider the symmetric two-state 16-vertex model on the square lattice whose vertex weights are invariant under any permutation of adjacent edge states. The vertex-weight parameters are restricted to a critical manifold which is…
It is shown that the square-triangle random tiling model is equivalent to an asymmetric limit of the three colouring model on the honeycomb lattice. The latter model is known to be the O(n) model at T=0 and corresponds to the integrable…
Using the representation of the quantum group $SL_q$(2) by the Weyl ope\-ra\-tors of the canonical commutation relations in quantum mechanics, we construct and solve a new vertex model on a square lattice. Random variables on horizontal…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
We report on single-cluster Monte Carlo simulations of the Ising, 4-state Potts and 10-state Potts models on quenched ensembles of planar, tri-valent random graphs. We confirm that the first-order phase transition of the 10-state Potts…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
We study the two-dimensional Ising model on a network with a novel type of quenched topological (connectivity) disorder. We construct random lattices of constant coordination number and perform large scale Monte Carlo simulations in order…
We implement a two-stage approach of the Wang-Landau algorithm to investigate the critical properties of the 3D Ising model with quenched bond randomness. In particular, we consider the case where disorder couples to the nearest-neighbor…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
The branching ratio is calculated for three different models of 2d gravity, using dynamical planar phi-cubed graphs. These models are pure gravity, the D=-2 Gaussian model coupled to gravity and the single spin Ising model coupled to…
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…