Optical Memory and Neural Networks

, Volume 24, Issue 3, pp 165–185 | Cite as

Generalized approach to description of energy distribution of spin system

  • B. Kryzhanovsky
  • L. Litinskii


We examined energy spectrums of some particular systems of N binary spins. It is shown that the configuration space can be divided into N classes, and in the limit N → ∞ the energy distributions in these classes can be approximated by the normal distributions. For each class we obtained the expressions for the first three moments of the energy distribution, including the case of presence of a nonzero inhomogeneous magnetic field. We also derived the expression for the variance of the quasienergy distribution in the local minimum. We present the results of computer simulations for the standard Ising model and the Sherrington–Kirkpatrick and Edwards–Anderson models of spin glass. Basing on these results, we justified the new method of the partition function calculation.


partition function energy distribution normal distribution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kryzhanovsky, B. and Litinskii, L., Generalized Bragg-Williams equation for system with an arbitrary longrange interaction, Dokl. Math., 2014, vol. 90, no. 3, pp. 784–787.CrossRefGoogle Scholar
  2. 2.
    Kryzhanovsky, B. and Litinskii, L., Approximate method of free energy calculation for spin system with arbitrary connection matrix, J. Phys., Conf. Ser., 2015, vol. 574, p. 012017, Scholar
  3. 3.
    Amit, D., Gutfreund, H., and Sompolinsky, H., Spin-glass models of neural networks, Phys. Rev., Ser. A, 1985, vol. 32, no. 2, p. 1007.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Martin, O.C., Monasson, R., and Zecchina, R., Statistical mechanics methods and phase transitions in optimization problems, Theor. Comput. Sci., 2001, vol. 265, nos. 1–2, pp. 3–67, Scholar
  5. 5.
    Hinton, G.E., Osindero, S., and The, Y., A fast learning algorithm for deep belief nets, Neural Computation, 2006, vol. 18, pp. 1527–1554.MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Kryzhanovsky, B.V., Shape of a local minimum and probability of its detection in the binary optimization problem, Differential Eqs., 2008, vol. 44, pp. 1188–1190.Google Scholar
  7. 7.
    Kryzhanovsky, B.V. and Kryzhanovsky, V.M., The shape of a local minimum and the probability of its detection in random search, Lect. Notes El. Eng., 2009, vol. 24, pp. 51–61.CrossRefGoogle Scholar
  8. 8.
    Karandashev, Ya.M. and Kryzhanovsky, B.V., Efficient increasing of global minimum basin of attraction, Opt. Mem. Neural Networks, 2010, vol. 19, no. 2, pp. 110–125.CrossRefGoogle Scholar
  9. 9.
    Karandashev, I.M. and Kryzhanovsky, B.V., Attraction area of minima in quadratic binary optimization, Opt. Mem. Neural Networks (Inform. Opt.), 2014, vol. 23, no. 2, pp. 84–88.CrossRefGoogle Scholar
  10. 10.
    Karandashev, I.M. and Kryzhanovsky, B.V., Increasing the attraction area of the global minimum in the binary optimization problem, J. Global Minimization, 2013, vol. 56, no. 3, pp. 1167–1185.MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Karandashev, Y.M. and Kryzhanovsky, B.V., Transformation of energy landscape in the problem of binary minimization, Dokl. Math., 2009, vol. 80, no. 3, pp. 927–931.MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Karandashev, Y. and Kryzhanovsky, B., Mix-matrix transformation method for max-cut problem, ICANN, Lect. Notes Comput. Sci., 2014, vol. 8681, p. 323.CrossRefGoogle Scholar
  13. 13.
    Karandashev, Y. and Kryzhanovsky, B., Binary minimization: Increasing the attraction area of the global minimum in the binary optimization problem, Lect. Notes Comput. Sci., 2010, vol. 6353, pp. 525–530.CrossRefGoogle Scholar
  14. 14.
    Karandashev, I.M. and Kryzhanovsky. B.V., Transformation of edge weights in graph bipartition problem, Lect. Notes Comput. Sci., 2011, vol. 6792, pp. 25–31.CrossRefGoogle Scholar
  15. 15.
    Karandashev, I. and Kryzhanovsky, B., The mix-matrix method in the problem of binary quadratic optimization, ICANN-2012, Lect. Notes Comput. Sci., 2012, vol. 7552, part I, pp. 9CrossRefGoogle Scholar
  16. 16.
    Karandashev, Ya.M., Kryzhanovsky, B.V., and Litinskii, L.B., Strong instability of the minima spectrum of a quadratic binary functional, Dokl. Math., 2011, vol. 83, no. 1, pp. 116–120.MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Kryzhanovsky, B.V., Mikaelian, A.L., and Fonarev, A.B., Vector neural net identifying many strongly distorted and correlated patterns, Photonics Asia-2004, Proc. of SPIE, Bellingham, WA: SPIE, 2005, vol. 5642, pp. 124–133.CrossRefGoogle Scholar
  18. 18.
    Karandashev, Y., Kryzhanovsky, B., and Litinskii, L., Local minima of a quadratic binary functional with a quasi-Hebbian connection matrix, ICANN 2010, Lect. Notes Comput. Sci., 2010, vol. 6354, pp. 41–51.CrossRefGoogle Scholar
  19. 19.
    Karandashev, Ia., Kryzhanovsky, B., and Litinskii, L., Weighted patterns as a tool to improve the Hopfield model, Phys. Rev., Ser. E, 2012, vol. 85, p. 041925.CrossRefGoogle Scholar
  20. 20.
    Kryzhanovsky, B.V., Expansion of a matrix in terms of external products of configuration vectors, Opt. Mem. Neural Networks, 2008, vol. 17, no. 1, pp. 62–68.Google Scholar
  21. 21.
    Blote, W.J., Shchur, L.N., and Talapov, A.L., The cluster processor: new results, Int. J. Mod. Phys., Ser. C, 1999, vol. 10, p. 1137, Scholar
  22. 22.
    Lundow, H. and Markstrom, K., Critical behavior of the Ising model on the 4-dimensional lattice, Phys. Rev., Ser. E, 2009, vol. 80, p. 031104, Scholar
  23. 23.
    Baxter, R.J., Exactly Solved Models in Statistics Mechanics, London: Academic Press, 1982.Google Scholar

Copyright information

© Allerton Press, Inc. 2015

Authors and Affiliations

  1. 1.Center of Optical Neural Technologies, Scientific Research Institute for System AnalysisRussian Academy of SciencesMoscowRussia

Personalised recommendations