pith. sign in

arxiv: 2511.12330 · v2 · pith:L3V2S33Xnew · submitted 2025-11-15 · ❄️ cond-mat.stat-mech · quant-ph

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

Nikita Titov , Andrea Trombettoni This is my paper

Pith reviewed 2026-05-21 19:20 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech quant-ph
keywords O(n) modelgraph Laplacianadjacency matrixfree energysaddle-point approximationthermodynamic limitspin models on graphstrees
0
0 comments X

The pith

The free energy of the O(n) model on graphs is determined by the Laplacian spectrum at low temperature and the adjacency spectrum at high temperature.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies the large-n limit of the O(n) model on arbitrary graphs. Despite the loss of translational invariance creating an infinite number of saddle-point constraints, the free energy in the thermodynamic limit reduces to quantities determined by the eigenvalues of the graph Laplacian at low T and the adjacency matrix at high T. This holds across regular lattices, trees, decorated lattices, and bipartite graphs. A reader would care because it connects spin thermodynamics directly to standard graph matrices, enabling exact or simplified calculations on structures where lattice methods do not apply.

Core claim

In the large-n limit of the O(n) model on graphs the free energy at low T is determined by the spectrum of the Laplacian matrix and at high T by the spectrum of the Adjacency matrix. For regular lattices the two objects coincide. On trees the Lagrange multipliers depend only on the number of nearest neighbors. For decorated lattices the singular part of the free energy is governed by the Laplacian spectrum, while the full free energy follows this only at zero temperature. Results on a bipartite fully connected graph underline the role of finite coordination number.

What carries the argument

The saddle-point equations of the large-n O(n) model, whose solutions tie the free energy to the eigenvalue spectra of the Laplacian matrix at low T and the adjacency matrix at high T.

If this is right

  • On regular lattices the low-T and high-T descriptions connect because the Laplacian and adjacency spectra are linearly related.
  • Trees admit an exact solution in which the Lagrange multipliers are fixed solely by the coordination number.
  • Decorated lattices have their singular free-energy part controlled by the Laplacian spectrum at all temperatures but the regular part only at zero temperature.
  • Bipartite fully connected graphs require finite coordination number for the spectral results to hold without additional corrections.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same spectral reduction may apply to other classical or quantum spin models whose large-n or mean-field limits produce similar quadratic actions on graphs.
  • Numerical diagonalization of the Laplacian or adjacency matrix for a given network could give quick estimates of low- or high-temperature thermodynamics without solving the full spin model.
  • The distinction between singular and regular parts of the free energy on decorated graphs suggests that critical exponents might be readable from Laplacian eigenvalues alone.

Load-bearing premise

The saddle-point approximation remains valid and yields the free energy even though the loss of translational invariance produces an infinite set of saddle-point constraints in the thermodynamic limit on general graphs.

What would settle it

A direct numerical evaluation of the free energy for a small irregular graph at low temperature compared against the prediction obtained from the lowest eigenvalues of its Laplacian matrix.

Figures

Figures reproduced from arXiv: 2511.12330 by Andrea Trombettoni, Nikita Titov.

Figure 1
Figure 1. Figure 1: FIG. 1. Appearance of the Laplacian (denoted in the figure as ” [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Saddle point values of the Lagrange multipliers [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Saddle point values of the Lagrange multipliers on a decorated lattice in three dimensions. Lagrange multipliers [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
read the original abstract

The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more challenging than on regular lattices, as 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 fundamental graph-theoretic objects: the Laplacian matrix at low $T$ and the Adjacency matrix at high $T$. Their interplay is studied across 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. We further contrast these classical results with those for a quantum spin model on an exemplary tree. 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript studies the large-n limit of the O(n) model on general graphs. It claims that, despite the loss of translational invariance producing an infinite set of saddle-point constraints, the free energy at low T is determined by the spectrum of the Laplacian matrix and at high T by the spectrum of the Adjacency matrix. An exact solution is obtained on trees where the Lagrange multipliers depend only on the coordination number. The results are contrasted with a quantum spin model on a tree, extended to decorated lattices (where only the singular part of the free energy follows the Laplacian spectrum except at T=0), and illustrated on a bipartite fully connected graph to emphasize the role of finite coordination number.

Significance. If the central mapping holds, the work establishes a direct link between the thermodynamics of continuous spins on irregular graphs and standard graph spectra, which would be valuable for network models and combinatorial problems. The exact tree solution, with its parameter-free character in the Lagrange multipliers, is a clear strength that provides a concrete benchmark.

major comments (2)
  1. [Abstract and saddle-point section] Abstract and the saddle-point derivation: The central claim that the free energy reduces exactly to a functional of the Laplacian (low T) or Adjacency (high T) spectrum requires an explicit reduction showing how the infinite set of coupled saddle-point equations collapses without additional regularity assumptions on the graph or uniformity of the multipliers. The current presentation leaves this step as an assertion rather than a demonstrated cancellation.
  2. [Tree solution] Tree solution paragraph: While the exact solution on trees is highlighted, the manuscript should show the explicit algebraic steps by which the infinite constraints reduce to multipliers that depend solely on the number of nearest neighbors, confirming that no graph-specific fitting parameters enter the final spectral expression.
minor comments (1)
  1. [Decorated lattices discussion] The distinction between the full free energy and its singular part on decorated lattices would benefit from an explicit equation separating the two contributions.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on our manuscript. Their comments have prompted us to strengthen the presentation of the central derivations. We respond to each major comment below and have revised the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract and saddle-point section] Abstract and the saddle-point derivation: The central claim that the free energy reduces exactly to a functional of the Laplacian (low T) or Adjacency (high T) spectrum requires an explicit reduction showing how the infinite set of coupled saddle-point equations collapses without additional regularity assumptions on the graph or uniformity of the multipliers. The current presentation leaves this step as an assertion rather than a demonstrated cancellation.

    Authors: We appreciate the referee's emphasis on making the reduction explicit. In the revised manuscript we have inserted a dedicated paragraph in the saddle-point section that starts from the full set of local equations, sums them after multiplication by the appropriate eigenvector components, and uses the matrix identity L = D - A (or its high-T counterpart) to show that all site-dependent terms cancel, leaving only the trace over the spectrum. This cancellation holds for arbitrary graphs and does not invoke uniformity of the multipliers or any regularity assumption beyond the definitions of the Laplacian and adjacency matrices. revision: yes

  2. Referee: [Tree solution] Tree solution paragraph: While the exact solution on trees is highlighted, the manuscript should show the explicit algebraic steps by which the infinite constraints reduce to multipliers that depend solely on the number of nearest neighbors, confirming that no graph-specific fitting parameters enter the final spectral expression.

    Authors: We agree that the algebraic reduction should be written out in full. The revised manuscript now contains an expanded subsection that solves the saddle-point equations recursively on a tree: beginning at the leaves and propagating inward, each local constraint is shown to fix the multiplier at a vertex solely in terms of its coordination number z_v, yielding the closed-form relation lambda_v = (z_v - 2)/2 (low-T regime) with no residual dependence on the global tree structure or additional parameters. This confirms that the free-energy expression remains purely spectral. revision: yes

Circularity Check

0 steps flagged

No circularity: free-energy spectra derived from saddle-point on Hamiltonian

full rationale

The paper starts from the O(n) model Hamiltonian on a general graph and applies the saddle-point approximation in the large-n limit. The resulting free-energy expressions are obtained by solving the saddle-point equations, which on specific graphs (trees, decorated lattices) yield explicit dependence on the Laplacian eigenvalues at low T and adjacency eigenvalues at high T. This is a direct consequence of the quadratic form of the interaction term and the Lagrange-multiplier constraints; it is not obtained by defining the target quantity in terms of itself, by fitting parameters to the spectra, or by invoking a self-citation as a uniqueness theorem. The infinite set of constraints is handled by explicit solution on the chosen graph classes rather than by assumption that collapses them tautologically. No load-bearing step reduces the claimed spectral determination to a prior result by the same authors or to a renamed empirical pattern. The derivation is therefore self-contained against the model definition and the saddle-point procedure.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the validity of the saddle-point method for the large-n O(n) model and on the spectral properties of the Laplacian and adjacency matrices.

axioms (1)
  • domain assumption Saddle-point approximation remains valid despite an infinite set of constraints arising from broken translational invariance on general graphs.
    Invoked to obtain the free energy from the model in the thermodynamic limit.

pith-pipeline@v0.9.0 · 5734 in / 1286 out tokens · 67861 ms · 2026-05-21T19:20:34.840362+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages · 1 internal anchor

  1. [1]

    to complex systems [8], random walks [9] and statistical mechanics [10–13]. As a further motivation, recent progress in the control of trapping potentials in ultracold atomic systems using digital micromirror devices [14, 15] and holographic methods [16, 17] has enabled the realisation of finely tunable lattice geometries and energy potentials, which can ...

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  2. [2]

    Cardy,Scaling and Renormalization in Statistical Physics, Cambridge Lecture Notes in Physics (Cambridge University Press, Cambridge, UK, 1996)

    J. Cardy,Scaling and Renormalization in Statistical Physics, Cambridge Lecture Notes in Physics (Cambridge University Press, Cambridge, UK, 1996)

    work page 1996

  3. [3]

    Zee,Quantum Field Theory in a Nutshell, 2nd ed

    A. Zee,Quantum Field Theory in a Nutshell, 2nd ed. (Princeton University Press, Princeton, NJ, 2010)

    work page 2010

  4. [4]

    S. H. Simon,The Oxford Solid State Basics(Oxford University Press, Oxford, UK, 2013)

    work page 2013

  5. [5]

    P. M. Chaikin and T. C. Lubensky,Principles of Condensed Matter Physics(Cambridge University Press, Cambridge, UK, 1995)

    work page 1995

  6. [6]

    ben Avraham and S

    D. ben Avraham and S. Havlin,Diffusion and Reactions in Fractals and Disordered Systems(Cambridge University Press, Cambridge, UK, 2000)

    work page 2000

  7. [7]

    M´ ezard and A

    M. M´ ezard and A. Montanari,Information, Physics, and Computation(Oxford University Press, 2009)

    work page 2009

  8. [8]

    M. Barthelemy,Spatial Networks: A Complete Introduction: From Graph Theory and Statistical Physics to Real-World Applications(Springer International Publishing, Cham, Switzerland, 2022)

    work page 2022

  9. [9]

    Albert and A.-L

    R. Albert and A.-L. Barab´ asi, Statistical mechanics of complex networks, Reviews of Modern Physics74, 47 (2002)

    work page 2002

  10. [10]

    Burioni, D

    R. Burioni, D. Cassi, and A. Vezzani, Random walks and physical models on infinite graphs: an introduction, inRandom Walks and Geometry, edited by V. A. Kaimanovich, K. Schmidt, and W. Woess (de Gruyter, Berlin, 2001) pp. 35–71. 10

    work page 2001

  11. [11]

    Gefen, B

    Y. Gefen, B. B. Mandelbrot, and A. Aharony, Critical phenomena on fractal lattices, Phys. Rev. Lett.45, 855 (1980)

    work page 1980

  12. [12]

    Rammal and G

    R. Rammal and G. Toulouse, Random walks on fractal structures and percolation clusters, J. Physique Lett.44, 13 (1983)

    work page 1983

  13. [13]

    Monceau, Critical behavior of the ising model on random fractals, Physical Review E84, 051132 (2011)

    P. Monceau, Critical behavior of the ising model on random fractals, Physical Review E84, 051132 (2011)

    work page 2011

  14. [14]

    K¨ ulske, The ising model: highlights and perspectives, Mathematical Physics, Analysis and Geometry28, 20 (2025)

    C. K¨ ulske, The ising model: highlights and perspectives, Mathematical Physics, Analysis and Geometry28, 20 (2025)

    work page 2025

  15. [15]

    Gauthier, I

    G. Gauthier, I. Lenton, N. M. Parry, M. Baker, M. J. Davis, H. Rubinsztein-Dunlop, and T. W. Neely, Direct imaging of a digital micro-mirror device for configurable microscopic optical potentials, Optica3, 1136 (2016)

    work page 2016

  16. [16]

    Smith, T

    A. Smith, T. Easton, V. Guarrera, and G. Barontini, Generation of optical potentials for ultracold atoms using a superlu- minescent diode, Physical Review Research3, 033241 (2021)

    work page 2021

  17. [17]

    A. L. Gaunt and Z. Hadzibabic, Robust digital holography for ultracold atom trapping, Scientific Reports2, 721 (2012)

    work page 2012

  18. [18]

    Harte, G

    T. Harte, G. D. Bruce, J. Keeling, and D. Cassettari, A conjugate gradient minimisation approach to generating holographic traps for ultracold atoms, Optics Express22, 26548 (2014)

    work page 2014

  19. [19]

    M. A. Norcia, A. W. Young, and A. M. Kaufman, Microscopic control and detection of ultracold strontium in optical-tweezer arrays, Physical Review X8, 041054 (2018)

    work page 2018

  20. [20]

    F. S. Cataliotti, S. Burger, C. Fort, P. Maddaloni, F. Minardi, A. Trombettoni, A. Smerzi, and M. Inguscio, Josephson junction arrays with bose-einstein condensates, Science293, 843 (2001), https://www.science.org/doi/pdf/10.1126/science.1062612

    work page doi:10.1126/science.1062612 2001

  21. [21]

    Morsch and M

    O. Morsch and M. Oberthaler, Dynamics of bose-einstein condensates in optical lattices, Rev. Mod. Phys.78, 179 (2006)

    work page 2006

  22. [22]

    Buccheri, G

    F. Buccheri, G. Bruce, A. Trombettoni, D. Cassettari, H. Babujian, V. Korepin, and P. Sodano, Holographic optical traps for atom-based topological Kondo devices, New Journal of Physics18, 075012 (2016)

    work page 2016

  23. [23]

    Sodano, A

    P. Sodano, A. Trombettoni, P. Silvestrini, R. Russo, and B. Ruggiero, Inhomogeneous superconductivity in comb-shaped Josephson junction networks, New Journal of Physics8, 327 (2006)

    work page 2006

  24. [24]

    Silvestrini, R

    P. Silvestrini, R. Russo, C. V, B. Ruggiero, C. Granata, S. Rombetto, M. Russo, M. Cirillo, A. Trombettoni, and P. Sodano, Topology-induced critical current enhancement in Josephson networks, Physics Letters A370, 499 (2007)

    work page 2007

  25. [25]

    Lucci, V

    M. Lucci, V. Campanari, D. Cassi, V. Merlo, F. Romeo, G. Salina, and M. Cirillo, Quantum coherence in loopless superconductive networks, Entropy24, 10.3390/e24111690 (2022)

    work page doi:10.3390/e24111690 2022

  26. [26]

    Lucas, Ising formulations of many NP problems, Frontiers in Physics2, 5 (2014)

    A. Lucas, Ising formulations of many NP problems, Frontiers in Physics2, 5 (2014)

    work page 2014

  27. [27]

    M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM42, 1115–1145 (1995)

    work page 1995

  28. [28]

    Burioni, D

    R. Burioni, D. Cassi, and C. Destri,n→ ∞Limit ofO(n) Ferromagnetic Models on Graphs, Phys. Rev. Lett.85, 1496 (2000)

    work page 2000

  29. [29]

    T. Haug, R. Dumke, L.-C. Kwek, and L. Amico, Andreev-reflection and Aharonov–Bohm dynamics in atomtronic circuits, Quantum Science and Technology4, 045001 (2019)

    work page 2019

  30. [30]

    Tokuno, M

    A. Tokuno, M. Oshikawa, and E. Demler, Dynamics of One-Dimensional Bose Liquids: Andreev-Like Reflection atY Junctions and the Absence of the Aharonov-Bohm Effect, Phys. Rev. Lett.100, 140402 (2008)

    work page 2008

  31. [31]

    Cramp´ e and A

    N. Cramp´ e and A. Trombettoni, Quantum spins on star graphs and the Kondo model, Nuclear Physics B871, 526 (2013)

    work page 2013

  32. [32]

    Giuliano, P

    D. Giuliano, P. Sodano, A. Tagliacozzo, and A. Trombettoni, From four- to two-channel Kondo effect in junctions of XY spin chains, Nuclear Physics B909, 135 (2016)

    work page 2016

  33. [33]

    Moshe and J

    M. Moshe and J. Zinn-Justin, Quantum field theory in the large N limit: a review, Physics Reports385, 69 (2003)

    work page 2003

  34. [34]

    T. H. Berlin and M. Kac, The Spherical Model of a Ferromagnet, Phys. Rev.86, 821 (1952)

    work page 1952

  35. [35]

    H. W. Lewis and G. H. Wannier, Spherical Model of a Ferromagnet, Phys. Rev.88, 682 (1952)

    work page 1952

  36. [36]

    H. E. Stanley, Spherical Model as the Limit of Infinite Spin Dimensionality, Phys. Rev.176, 718 (1968)

    work page 1968

  37. [37]

    B. A. Khoruzhenko, L. A. Pastur, and M. V. Shcherbina, Large-n limit of the Heisenberg model: The decorated lattice and the disordered chain, Journal of Statistical Physics57, 41–52 (1989). 11

    work page 1989

  38. [38]

    Dantchev, J

    D. Dantchev, J. Bergknoff, and J. Rudnick, Casimir force in the O(n→ ∞) model with free boundary conditions, Phys. Rev. E89, 042116 (2014)

    work page 2014

  39. [39]

    H. J. F. Knops, Infinite spin dimensionality limit for nontranslationally invariant interactions, Journal of Mathematical Physics14, 1918 (1973)

    work page 1918

  40. [40]

    Cassi and L

    D. Cassi and L. Fabbian, The spherical model on graphs, Journal of Physics A: Mathematical and General32, L93 (1999)

    work page 1999

  41. [41]

    Harary,Graph Theory(Addison-Wesley Publishing Company, Boston, 1969)

    F. Harary,Graph Theory(Addison-Wesley Publishing Company, Boston, 1969)

    work page 1969

  42. [42]

    J. A. Bondy and U. S. R. Murty,Graph Theory with Applications(Macmillan Press Ltd, London and New York, 1976)

    work page 1976

  43. [43]

    Merris, Laplacian matrices of graphs: a survey, Linear Algebra and its Applications197-198, 143 (1994)

    R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra and its Applications197-198, 143 (1994)

    work page 1994

  44. [44]

    Burioni, D

    R. Burioni, D. Cassi, M. Rasetti, P. Sodano, and A. Vezzani, Bose-einstein condensation on inhomogeneous complex networks, Journal of Physics B: Atomic, Molecular and Optical Physics34, 4697 (2001)

    work page 2001

  45. [45]

    Brunelli, G

    I. Brunelli, G. Giusiano, F. P. Mancini, P. Sodano, and A. Trombettoni, Topology-induced spatial bose–einstein conden- sation for bosons on star-shaped optical networks, Journal of Physics B: Atomic, Molecular and Optical Physics37, S275 (2004)

    work page 2004

  46. [46]

    Burioni and D

    R. Burioni and D. Cassi, Random walks on graphs: ideas, techniques and results, Journal of Physics A: Mathematical and General38, R45 (2005)

    work page 2005

  47. [47]

    A. P. Mill´ an, G. Gori, F. Battiston, T. Enss, and N. Defenu, Complex networks with tuneable spectral dimension as a universality playground, Phys. Rev. Res.3, 023015 (2021)

    work page 2021

  48. [48]

    H. E. Stanley, Exact Solution for a Linear Chain of Isotropically Interacting Classical Spins of Arbitrary Dimensionality, Phys. Rev.179, 570 (1969)

    work page 1969

  49. [49]

    Vojta, Quantum version of a spherical model: Crossover from quantum to classical critical behavior, Phys

    T. Vojta, Quantum version of a spherical model: Crossover from quantum to classical critical behavior, Phys. Rev. B53, 710 (1996). Appendix A: LargenLimit on General Graphs TheO(N) model defined on a graph with Adjacency matrixAhas the Hamiltonian: −βH=K NX i,j=1 AijSi ·S j =K NX i,j=1 nX a=1 Si,aSj,a.(A1) We normalize the spins according to: nX a=1 S2 i,...

    work page 1996