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

• URL: http://arxiv.org/abs/2511.12330v1
• Date: Sat, 15 Nov 2025 19:14:35 GMT
• Title: From Laplacian-to-Adjacency Matrix for Continuous Spins on Graphs
• Authors: Nikita Titov, Andrea Trombettoni,
• Abstract summary: We show that the free energy at low and high temperature $T$ is determined by the spectrum of two crucial objects from graph theory.<n>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.<n>Results for quantum spin models on a loopless graph are also presented.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• The $O(n\ o\infty)$ Rotor Model and the Quantum Spherical Model on Graphs [0.0]
  We show that the large $n$ limit of the $O(n)$ quantum rotor model defined on a general graph has the same critical behavior as the corresponding quantum spherical model.<n>We employ a classical to quantum mapping and use known results for the large $n$ limit of the classical $O(n)$ model on graphs.
  arXiv  Detail & Related papers  (2026-01-20T16:14:01Z)
• A Graph-Theoretic Approach to Quantum Measurement Incompatibility [0.0]
  We develop a graph-theoretic framework for quantifying measurement incompatibility.<n>We show that the Lovsz number yields the correct scaling for $k$-body Majorana observables.<n>We identify structural conditions under which the robustness is determined.
  arXiv  Detail & Related papers  (2025-11-20T01:06:46Z)
• Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs [13.60873698530933]
  A graph that encodes its commutatitivity structure, i.e., by its frustration graph, provides a natural interface between graph theory and quantum information.<n>We call this class $hbar$-perfect, as it extends the class of perfect and $h$-perfect graphs.<n>We find efficient schemes for entanglement detection, a connection to the complexity of shadow tomography, tight uncertainty relations and a construction for computing good lower on ground state energies.
  arXiv  Detail & Related papers  (2025-11-17T16:05:28Z)
• Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry [2.6140509675507384]
  We consider the problem of embedding the vertices of an $n$-vertex graph $G$ into the leaves of an $n$-leaf rooted binary tree $mathcalB$.<n>We numerically compare our congestion bounds on different families of graphs with regular structure (hypercubes and lattices), random graphs, and tensor network representations of quantum circuits.
  arXiv  Detail & Related papers  (2025-10-03T04:58:40Z)
• Strongly regular and strongly walk-regular graphs that admit perfect state transfer [0.0]
  We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs.<n>We first give a complete classification of strongly regular graphs that admit perfect state transfer. The only such graphs are the complete bipartite graph $K_2,2 and the complete graph $K_2,2,2.
  arXiv  Detail & Related papers  (2025-06-03T07:10:06Z)
• Generating Graphs via Spectral Diffusion [48.70458395826864]
  We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Limits, approximation and size transferability for GNNs on sparse graphs via graphops [44.02161831977037]
  We take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. Our results hold for dense and sparse graphs, and various notions of graph limits.
  arXiv  Detail & Related papers  (2023-06-07T15:04:58Z)
• Tensor Rank and Other Multipartite Entanglement Measures of Graph States [5.8087716340417765]
  Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. We show that several multipartite extensions of bipartite entanglement measures are dichotomous for graph states based on the connectivity of the corresponding graph.
  arXiv  Detail & Related papers  (2022-09-13T21:59:31Z)
• Graph Neural Network Bandits [89.31889875864599]
  We consider the bandit optimization problem with the reward function defined over graph-structured data. Key challenges in this setting are scaling to large domains, and to graphs with many nodes. We show that graph neural networks (GNNs) can be used to estimate the reward function.
  arXiv  Detail & Related papers  (2022-07-13T18:12:36Z)
• Effects of Graph Convolutions in Deep Networks [8.937905773981702]
  We present a rigorous theoretical understanding of the effects of graph convolutions in multi-layer networks. We show that a single graph convolution expands the regime of the distance between the means where multi-layer networks can classify the data. We provide both theoretical and empirical insights into the performance of graph convolutions placed in different combinations among the layers of a network.
  arXiv  Detail & Related papers  (2022-04-20T08:24:43Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Critical Phenomena in Complex Networks: from Scale-free to Random Networks [77.34726150561087]
  We study critical phenomena in a class of configuration network models with hidden variables controlling links between pairs of nodes. We find analytical expressions for the average node degree, the expected number of edges, and the Landau and Helmholtz free energies, as a function of the temperature and number of nodes.
  arXiv  Detail & Related papers  (2020-08-05T18:57:38Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)
• Asymptotic entropy of the Gibbs state of complex networks [68.8204255655161]
  The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random ErdHos-R'enyi graphs.
  arXiv  Detail & Related papers  (2020-03-18T18:01:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.