We discuss the statistical mechanics of vertex models on both generic ("thin") and planar ("fat") random graphs. Such models can be formulated as the N ?» 1 and N ? 8 limits of N x N complex matrix models, respectively. From the graph theoretic perspective one is using matrix model and field theory inspired methods to count various classes of directed graphs. For the thin random graphs we use saddle point methods to solve the models in the thermodynamic, large number of vertices limit and note that, as in the case of the eight-vertex model on the square lattice, various other models such as the Ising model appear as particular limits. The generic solution of the fat graph model is rather more elusive, but we show that for several choices of the couplings the models can be reduced to eigenvalue integrals and their critical behaviour deduced. © 1998 Elsevier Science B.V.
|Number of pages||12|
|Journal||Physics Letters A|
|Publication status||Published - 2 Nov 1998|