From Laplacian-to-Adjacency Matrix for Continuous Spins on Graphs

The study of spins and particles on graphs has many applications across different fields, from time dynamics on networks to the solution of combinatorial problems. Here, we study the large n limit of the O(n) model on general graphs, which is considerably more difficult than on regular lattices. Indeed, the loss of translational invariance gives rise to an infinite set of saddle point constraints in the thermodynamic limit. We show that the free energy at low and high temperature T is determined by the spectrum of two crucial objects from graph theory: the Laplacian matrix at low T and the Adjacency matrix at high T. Their interplay is studied in several classes of graphs. For regular lattices the two coincide. We obtain an exact solution on trees, where the Lagrange multipliers interestingly depend solely on the number of nearest neighbors. For decorated lattices, the singular part of the free energy is governed by the Laplacian spectrum, whereas this is true for the full free energy only in the zero temperature limit. Finally, we discuss a bipartite fully connected graph to highlight the importance of a finite coordination number in these results. Results for quantum spin models on a loopless graph are also presented.