scholarly journals Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm

2022 ◽  
Vol 65 (3) ◽  
Author(s):  
Hai-Jun Zhou
1997 ◽  
Vol 30 (20) ◽  
pp. 7021-7038 ◽  
Author(s):  
Andrea Cavagna ◽  
Irene Giardina ◽  
Giorgio Parisi

1988 ◽  
Vol 116 (3) ◽  
pp. 527-527 ◽  
Author(s):  
M. Aizenman ◽  
J. L. Lebowitz ◽  
D. Ruelle

Author(s):  
Sigismund Kobe ◽  
Jarek Krawczyk

The previous three chapters have focused on the analysis of computational problems using methods from statistical physics. This chapter largely takes the reverse approach. We turn to a problem from the physics literature, the spin glass, and use the branch-and-bound method from combinatorial optimization to analyze its energy landscape. The spin glass model is a prototype that combines questions of computational complexity from the mathematical point of view and of glassy behavior from the physical one. In general, the problem of finding the ground state, or minimal energy configuration, of such model systems belongs to the class of NP-hard tasks. The spin glass is defined using the language of the Ising model, the fundamental description of magnetism at the level of statistical mechanics. The Ising model contains a set of n spins, or binary variables si, each of which can take on the value up (si = 1) or down (si= 1).


Sign in / Sign up

Export Citation Format

Share Document