- Physical Review Journals
All JournalsPhysics Magazine
Access Provided by Xinjiang University

Physical Review E

Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Graphon spin systems as exactly solvable models

Artem Alexandrov*

Georgi S. Medvedev†

  • Department of Mathematics, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA

  • *Contact author: alexandrov.aa@mi-ras.ru
  • †Contact author: medvedev@drexel.edu
PDF

Phys. Rev. E 114, 044102 – Published 1 October, 2026

DOI: https://doi.org/10.1103/fqfg-ml34

Abstract

Graphons are measurable functions used to describe the asymptotic behavior of convergent graph families. Originally motivated by problems in combinatorics and graph theory, graphons have found numerous applications in the modeling and analysis of dynamical processes on networks. In this work, we use graphons to formulate the Ising model on convergent graph sequences, which include many network topologies common in applications. We derive the mean-field limit for the resulting model and obtain exact results for phase transitions in such systems. Specifically, we show that the critical temperatures of the Ising model on graphons are determined by the eigenvalues of the Hilbert–Schmidt operator associated with the graph limit. For many important network topologies, these eigenvalues can be computed explicitly. We illustrate our results with three representative random network models: Erdős–Rényi, small-world, and power-law. In the small-world case, we demonstrate phase transitions to both ferromagnetic and antiferromagnetic phases, as well as coexistence of local minima of the free energy. The latter gives rise to multistability, as confirmed by Monte-Carlo simulations. The results of this work demonstrate that the Ising model on graphons combines the analytical tractability of exactly solvable mean-field models with the ability to accommodate a broad range of network topologies. We expect that the use of graphons in spin models will lead to new insights into the statistical physics of interacting systems on complex networks.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (67)

  1. S. Friedli and Y. Velenik, Statistical Mechanics of Lattice Systems. A Concrete Mathematical Introduction (Cambridge University Press, Cambridge, 2018).
  2. T. M. Liggett, Interacting Particle Systems. With a New Postface., reprint of the 1985 edition ed., Class. Math. (Springer, New York, NY, 2005).
  3. D. Sherrington, Spin glasses, Phys. Bull. 30, 477 (1979).
  4. D. Panchenko, The Sherrington-Kirkpatrick model: An overview, J. Stat. Phys. 149, 362 (2012).
  5. G. Parisi, Nobel Lecture: Multiple equilibria, Rev. Mod. Phys. 95, 030501 (2023).
  6. A. Nahum, P. Serna, A. M. Somoza, and M. Ortuño, Loop models with crossings, Phys. Rev. B 87, 184204 (2013).
  7. Z. Pei, Statistical physics for artificial neural networks, arXiv:2512.06518.
  8. R. Barney, M. Winer, and V. Galitski, Neural networks as spin models: From glass to hidden order through training, arXiv:2408.06421.
  9. E. Kropff and A. Treves, The storage capacity of Potts models for semantic memory retrieval, J. Stat. Mech. (2005) P08010.
  10. C. Lynn and D. D. Lee, Maximizing influence in an Ising network: A mean-field optimal solution, in Advances in Neural Information Processing Systems, edited by D. Lee, M. Sugiyama, U. Luxburg, I. Guyon, and R. Garnett, Vol. 29 (Curran Associates, Inc., 2016).
  11. S. Galam, Rational group decision making: A random field Ising model at T=0, Physica A 238, 66 (1997).
  12. W. A. Brock and S. N. Durlauf, Discrete choice with social interactions, Rev. Econ. Stud. 68, 235 (2001).
  13. E. Ising, Beitrag zur Theorie des Ferromagnetismus, Z. Phys. 31, 253 (1925).
  14. D. Mattis, Solvable spin systems with random interactions, Phys. Lett. A 56, 421 (1976).
  15. A. Coja-Oghlan and W. Perkins, Spin systems on Bethe lattices, Commun. Math. Phys. 372, 441 (2019).
  16. A. Coja-Oghlan, P. Loick, B. F. Mezei, and G. B. Sorkin, The Ising antiferromagnet and max cut on random regular graphs, SIAM J. Discrete Math. 36, 1306 (2022).
  17. L. F. Cugliandolo, L. Foini, and M. Tarzia, Mean-field phase diagram and spin-glass phase of the dipolar kagome Ising antiferromagnet, Phys. Rev. B 101, 144413 (2020).
  18. M. Ostilli, Exact results for the Ising model on a small-world network, Physica A 641, 129727 (2024).
  19. A. Dembo and A. Montanari, Ising models on locally tree-like graphs, Ann. Appl. Probab. 20, 565 (2010).
  20. R. Dumer and M. Godoy, Ising model on a restricted scale-free network, Physica A 621, 128795 (2023).
  21. M. Bartolozzi, T. Surungan, D. B. Leinweber, and A. G. Williams, Spin-glass behavior of the antiferromagnetic Ising model on a scale-free network, Phys. Rev. B 73, 224419 (2006).
  22. M. Mézard and A. Montanari, Reconstruction on trees and spin glass transition, J. Stat. Phys. 124, 1317 (2006).
  23. A. Dembo and A. Montanari, Gibbs measures and phase transitions on sparse random graphs, Braz. J. Probab. Stat. 24, 137 (2010).
  24. M. W. Macy, B. K. Szymanski, and J. A. Hołyst, The Ising model celebrates a century of interdisciplinary contributions, npj Complexity 1, 10 (2024).
  25. M. Talagrand, Mean Field Models for Spin Glasses. Volume I: Basic examples, Ergebnisse der Mathematik und ihrer Grenzgebiete (Springer, Berlin, 2011), Vol. 54.
  26. M. Talagrand, Mean Field Models for Spin Glasses. Volume II: Advanced Replica-Symmetry and Low Temperature, Ergebnisse der Mathematik und ihrer Grenzgebiete (Springer, Berlin, 2011), Vol. 55.
  27. S. Chatterjee, Estimation in spin glasses: A first step, Ann. Stat. 35, 1931 (2007).
  28. M. Mézard and A. Montanari, Information, Physics and Computation, Oxford Graduate Texts (Oxford University Press, Oxford, 2009).
  29. A. Montanari, Spin glass concepts in computer science, statistics, and learning, arXiv:2602.23326.
  30. A. Bovier and I. Kurkova, in Spin Glasses: Statics and Dynamics, Summer School, Paris, France, June 25 to July 6, 2007 (Birkhäuser, Basel, 2009), pp. 3–44.
  31. K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58, 801 (1986).
  32. S. N. Dorogovtsev and J. F. F. Mendes, The Nature of Complex Networks (Oxford University Press, Oxford, 2022).
  33. R. S. Ellis and C. M. Newman, The statistics of Curie-Weiss models, J. Stat. Phys. 19, 149 (1978).
  34. A. Bovier and V. Gayrard, The thermodynamics of the Curie-Weiss model with random couplings, J. Stat. Phys. 72, 643 (1993).
  35. M. Leone, A. Vázquez, A. Vespignani, and R. Zecchina, Ferromagnetic ordering in graphs with arbitrary degree distribution, Eur. Phys. J. B 28, 191 (2002).
  36. S. Dommers, C. Giardinà, and R. van der Hofstad, Ising models on power-law random graphs, J. Stat. Phys. 141, 638 (2010).
  37. L. Lovász, Large Networks and Graph Limits, Volume 60 of Colloquium Publications - American Mathematical Society (American Mathematical Society, Providence, RI, 2012), Vol. 60.
  38. G. S. Medvedev, The nonlinear heat equation on dense graphs and graph limits, SIAM J. Math. Anal. 46, 2743 (2014).
  39. D. Kaliuzhnyi-Verbovetskyi and G. S. Medvedev, The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit, SIAM J. Math. Anal. 50, 2441 (2018).
  40. H. Chiba, G. S. Medvedev, and M. S. Mizuhara, Bifurcations in the Kuramoto model on graphs, Chaos 28, 073109 (2018).
  41. H. Chiba and G. S. Medvedev, The mean field analysis of the Kuramoto model on graphs I. The mean field equation and transition point formulas, DCDS 39, 131 (2019).
  42. G. S. Medvedev and M. S. Mizuhara, Chimeras unfolded, J. Stat. Phys. 186, Paper No. 46, 19 (2022).
  43. H. Chiba and G. S. Medvedev, Stability and bifurcation of mixing in the Kuramoto model with inertia, SIAM J. Math. Anal. 54, 1797 (2022).
  44. H. Chiba, G. S. Medvedev, and M. S. Mizuhara, Bifurcations and patterns in the Kuramoto model with inertia, J. Nonlinear Sci. 33, 78 (2023).
  45. A. Searle and J. Tindall, Thermodynamic limit of spin systems on random graphs, Phys. Rev. Res. 6, 013011 (2024).
  46. D. J. Watts and S. H. Strogatz, Collective dynamics of ‘small-world’ networks, Nature (London) 393, 440 (1998).
  47. D. S. Bassett and E. Bullmore, Small-world brain networks, Neuroscientist 12, 512 (2006).
  48. G. S. Medvedev, The nonlinear heat equation on W-random graphs, Arch. Ration. Mech. Anal. 212, 781 (2014).
  49. G. S. Medvedev, The continuum limit of the Kuramoto model on sparse random graphs, Commun. Math. Sci. 17, 883 (2019).
  50. C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Adv. Math. 219, 1801 (2008).
  51. P. Dupuis and G. S. Medvedev, The large deviation principle for interacting dynamical systems on random graphs, Commun. Math. Phys. 390, 545 (2022).
  52. S. Chatterjee, Large Deviations for Random Graphs. École d'Été de Probabilités de Saint-Flour XLV – 2015, Lecture Notes in Mathematics (Springer, Cham, 2017), Vol. 2197.
  53. B. Bollobás, Random Graphs, 2nd ed., Cambridge Studies in Advanced Mathematics (Cambridge University Press, Cambridge, 2001), Vol. 73.
  54. M. Ghandehari and G. S. Medvedev, The large deviation principle for W-random spectral measures, Appl. Comput. Harmon. Anal. 77, 101756 (2025).
  55. B. Szegedy, Limits of kernel operators and the spectral regularity lemma, Eur. J. Comb. 32, 1156 (2011).
  56. G. S. Medvedev, Small-world networks of Kuramoto oscillators, Physica D 266, 13 (2014).
  57. C. Borgs, J. Chayes, H. Cohn, and Y. Zhao, An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Trans. Am. Math. Soc. 372, 3019 (2019).
  58. G. S. Medvedev and X. Tang, The Kuramoto model on power law graphs: Synchronization and contrast states, J. Nonlinear Sci. 30, 2405 (2020).
  59. G. S. Medvedev and D. E. Pelinovsky, Turing bifurcation in the Swift-Hohenberg equation on deterministic and random graphs, J. Nonlinear Sci. 34, 88 (2024).
  60. J. Dieudonné, Foundations of Modern Analysis, Pure and Applied Mathematics (Academic Press, New York, 1969), enlarged and corrected printing.
  61. H. Kielhöfer, Bifurcation Theory. An Introduction with Applications to Partial Differential Equations, 2nd ed., Applied Mathematical Sciences, Vol. 156 (Springer, Berlin, 2012).
  62. G. B. Folland, Fourier Analysis and Its Applications, reprint of the 1992 original published by Wadsworth & Brooks/Cole ed., Pure Appl. Undergrad. Texts, Vol. 4 (American Mathematical Society, Providence, RI, 2009).
  63. D. Landau and K. Binder, A Guide to Monte Carlo Simulations in Statistical Physics (Cambridge University Press, 2021).
  64. R. S. Ellis, Entropy, Large Deviations, and Statistical Mechanics., reprint of the 1985 edition ed., Class. Math. (Springer, Berlin, 2006).
  65. T. Paul and E. Trélat, Universal approximations of quasilinear PDEs by finite distinguishable particle systems, arXiv:2501.11387.
  66. G. S. Medvedev, Interacting dynamical systems on networks and fractals: Discrete and continuous models, mean-field limit, and convergence rates, arXiv:2601.23175.
  67. A. Alexandrov, Codes for Monte-Carlo simulations and bifurcation diagrams of the Ising model on graphons, GitHub repository, https://github.com/acubed3/Ising-Graphons.

Outline

Information

Phys. Rev. E 114, 044102– Published 1 October, 2026
  • Received 13 November 2025
  • Accepted 17 September 2026
Article part of CHORUS
Crossmark - Check for updates button

©2026 American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation