Skip to main content
SpringerLink
Log in

Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation

  • Chapter
Scalable Optimization via Probabilistic Modeling

Part of the book series: Studies in Computational Intelligence ((SCI,volume 33))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barahona, F. (1982). On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical, Nuclear and General, 15 (10):3241-3253

    Article  MathSciNet  Google Scholar 

  2. Barahona, F., Maynard, R., Rammal, R., and Uhry, J. (1982). Morphology of ground states of a two dimensional frustration model. Journal of Physics A, 15:673

    Article  MathSciNet  Google Scholar 

  3. Berg, B. A. and Neuhaus, T. (1992). Multicanonical ensemble - a new approach to simulate first order phasetransition. Physical Review Letters, 68(9)

    Google Scholar 

  4. Bieche, I., Maynard, R., Rammal, R., and Uhry, J. (1980). On the ground states of the frustration model of a spin glass by a matching method of graph theory. Journal of Physics A, 13:2553

    Article  MathSciNet  Google Scholar 

  5. Binder, K. and Young, A. (1986). Spin-glasses: Experimental facts, theoretical concepts and open questions. Review of Modern Physics, 58:801

    Article  Google Scholar 

  6. Chickering, D. M., Heckerman, D., and Meek, C. (1997). A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA

    Google Scholar 

  7. Claiborne, J. (1990). Mathematical Preliminaries for Computer Net-working. Wiley, New York

    Google Scholar 

  8. Dayal, P., Trebst, S., Wessel, S., ürtz, D., Troyer, M., Sabhapandit, S., and Coppersmith, S. (2004). Performance limitations of flat histogram methods and optimality of Wang-Langdau sampling. Physical Review Letters, 92(9):097201

    Article  Google Scholar 

  9. Fischer, K. and Hertz, J. (1991). Spin Glasses. Cambridge University Press, Cambridge

    Google Scholar 

  10. Fischer, S. and Wegener, I. (2004). The Ising model on the ring: Mutation versus recombination. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), pages 1113-1124

    Google Scholar 

  11. Friedman, N. and Goldszmidt, M. (1999). Learning Bayesian networks with local structure. In Jordan, M. I., editor, Graphical models, pages 421-459. MIT Press, Cambridge, MA

    Google Scholar 

  12. Galluccio, A. and Loebl, M. (1999a). A theory of Pfaffian orientations. I. Perfect matchings and permanents. Electronic Journal of Combinatorics, 6(1). Research Paper 6

    MathSciNet  Google Scholar 

  13. Galluccio, A. and Loebl, M. (1999b). A theory of Pfaffian orientations. II. T-joins, k-cuts, and duality of enumeration. Electronic Journal of Combinatorics, 6(1). Research Paper 7

    MathSciNet  Google Scholar 

  14. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  15. Harik, G. R. (1995). Finding multimodal solutions using restricted tournament selection. Proceedings of the International Conference on Genetic Algorithms (ICGA-95), pages 24-31

    Google Scholar 

  16. Hartmann, A. K. (1996). Cluster-exact approximation of spin glass ground states. Physica A, 224:480

    Article  Google Scholar 

  17. Hartmann, A. K. (2001). Ground-state clusters of two, three and fourdimensional +/-J Ising spin glasses. Physical Review E, 63:016106

    Article  Google Scholar 

  18. Hartmann, A. K. and Rieger, H. (2001). Optimization Algorithms in Physics. Wiley-VCH, Weinheim

    Book  Google Scholar 

  19. Hartmann, A. K. and Rieger, H., editors (2004). New Optimization Algorithms in Physics. Wiley-VCH, Weinheim

    MATH  Google Scholar 

  20. Hartmann, A. K. and Weigt, M. (2005). Phase Transitions in Combinatorial Optimization Problems. Wiley-VCH, Weinheim

    Book  MATH  Google Scholar 

  21. Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI

    Google Scholar 

  22. Mezard, M., Parisi, G., and Virasoro, M. (1987). Spin glass theory and beyond. World Scientific, Singapore

    MATH  Google Scholar 

  23. Middleton, A. and Fisher, D. S. (2002). The three-dimensional random field Ising magnet: Interfaces, scaling, and the nature of states. Physical Review B, 65:134411

    Article  Google Scholar 

  24. Mühlenbein, H. and Mahnig, T. (1999). Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology, 7(1):19-32

    Google Scholar 

  25. Mühlenbein, H. and Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187

    Google Scholar 

  26. Mühlenbein, H. and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Computation, 1(1):25-49

    Article  Google Scholar 

  27. Naudts, B. and Naudts, J. (1998). The effect of spin-flip symmetry on the performance of the simple GA. Parallel Problem Solving from Nature, pages 67-76

    Google Scholar 

  28. Newman, C. and Stein, D. (2003). Finite-dimensional spin glasses: states, excitations and interfaces. preprint cond-mat/0301022

    Google Scholar 

  29. Pelikan, M.(2005).Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  30. Pelikan, M. and Goldberg, D. E. (2001). Escaping hierarchical traps with competent genetic algorithms. Proceedings of the Genetic and Evolution-ary Computation Conference (GECCO-2001), pages 511-518

    Google Scholar 

  31. Pelikan, M. and Goldberg, D. E. (2003). Hierarchical BOA solves Ising spin glasses and MAXSAT. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), II:1275-1286

    Google Scholar 

  32. Pelikan, M., Ocenasek, J., Trebst, S., Troyer, M., and Alet, F. (2004). Computational complexity and simulation of rare events of Ising spin glasses. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), 2:36-47

    Google Scholar 

  33. Picard, J.-C. and Ratliff, H. (1975). Minimum cuts and related problems.Networks, 5:357

    Article  MATH  MathSciNet  Google Scholar 

  34. Sastry, K. and Goldberg, D. E. (2002). Analysis of mixing in genetic algorithms: A survey. IlliGAL Report No. 2002012, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL 15 Searching for Ground States of Ising Spin Glasses349

    Google Scholar 

  35. Spin Glass Ground State Server (2004). http://www.informatik.uni-koeln.de/ls juenger/research/sgs/sgs.html University of Köln, Germany

  36. Swamy, M. and Thulasiraman, K. (1991). Graphs, Networks and Algorithms. Wiley, New York

    Google Scholar 

  37. Tarjan, R. (1983). Data Structures and Network Algorithms. Society for industrial and applied mathematics, Philadelphia

    Google Scholar 

  38. Thierens, D., Goldberg, D. E., and Pereira, A. G. (1998). Domino con-vergence, drift, and the temporal-salience structure of problems. Pro-ceedings of the International Conference on Evolutionary Computation (ICEC-98), pages 535-540

    Google Scholar 

  39. Träff, J. (1996). A heuristic for blocking flow algorithms. European Journal of Operations Research, 89:564

    Article  MATH  Google Scholar 

  40. Van Hoyweghen, C. (2001). Detecting spin-flip symmetry in optimization problems. In Kallel, L. et al., editors, Theoretical Aspects of Evolutionary Computing, pages 423-437. Springer, Berlin Heidelberg New York

    Google Scholar 

  41. Wang, F. and Landau, D. P. (2001). Efficient, multiple-range random walk algorithm to calculate the density of states. Physical Review Letters, 86 (10):2050-2053

    Article  Google Scholar 

  42. Young, A., editor (1998). Spin glasses and random fields. World Scientific, Singapore

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Missouri at St. Louis, One University Blvd. St. Louis, MO 63121, USA

    Dr. Martin Pelikan

  2. Universität Göttingen Friedrich-Hund-Platz 1, 37077, Göttingen, Germany

    Alexander K. Hartmann

Authors
  1. Dr. Martin Pelikan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander K. Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Math. And Computer Science, University of Missouri at St. Louis, One University Blvd., 320 CCB, MO 63121, St. Louis, USA

    Martin Pelikan

  2. Department of Industrial and Enterprise Systems Engineering, Illinois Genetic Algorithms Laboratory, 414 TB, 104 S. Mathews Ave., IL 61801, Urbana, USA

    Kumara Sastry

  3. Yahoo! Inc., 701 First Avenue, CA 94809, Sunnyvale, USA

    Erick CantúPaz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pelikan, M., Hartmann, A.K. (2006). Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation. In: Pelikan, M., Sastry, K., CantúPaz, E. (eds) Scalable Optimization via Probabilistic Modeling. Studies in Computational Intelligence, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34954-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-34954-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34953-2

  • Online ISBN: 978-3-540-34954-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation