1 / 39

Haijun Zhou 海军 周 Institute of Theoretical Physics, the Chinese Academy of Sciences,

Long-Range Frustration among Unfrozen Vertices in the Ground-State Configurations of a Spin-Glass System. Haijun Zhou 海军 周 Institute of Theoretical Physics, the Chinese Academy of Sciences, Beijing, China.

gigi
Télécharger la présentation

Haijun Zhou 海军 周 Institute of Theoretical Physics, the Chinese Academy of Sciences,

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Long-Range Frustration among Unfrozen Vertices in theGround-State Configurations of a Spin-Glass System Haijun Zhou 海军 周 Institute of Theoretical Physics, the Chinese Academy of Sciences, Beijing, China March 06, KITPC Program “Collective Dynamics in Information Systems” (March 01-April 15, 2008)

  2. The vertex cover problem • A simple analytical solution and stability analysis • Mean-field calculation on long-range frustration within the RS cavity method • Stability analysis of 1RSB cavity solution in terms of long-range frustration • Conclusion

  3. Collaborators: 1. H.Z., Phys. Rev. Lett. 94: 217203 (2005) 2. H.Z., New J. Phys. 7: 123 (2005) 3. Martin Weigt and H.Z., Phys. Rev. E 74: 046110 (2006) 4. Jie Zhou, Hui Ma, H.Z., J. Stat. Mech. L06001 (2007) Kang Li Hui Ma Martin Weigt Jie Zhou http://www.itp.ac.cn/~zhouhj/

  4. Vertex Cover Problem

  5. Minimal vertex covers • A vertex cover of the global minimal size. • Is a NP-hard optimization problem. • Efficient algorithms for constructing near-optimal solutions for a given graph.

  6. There may be many minimal vertex covers for a given graph.

  7. There are three types of vertices: • vertices that are always covered • (frozen vertices) • vertices that are always uncovered • (frozen vertices) • vertices that are covered in some • solutions and uncovered in the • remaining solutions • (unfrozen vertices)

  8. Mean-field analysis of the minimal vertex cover problem on a random graph

  9. The cavity method. Add a new vertex (0) to a system of N old vertices. Mezard, Parisi (2001) Mezard, Parisi (2003)

  10. mean field parameters • q* --- fraction of vertices that are unfrozen • q^0 --- fraction of vertices that are always uncovered • q^1 --- fraction of vertices that are always covered

  11. Weigt, Hartmann, PRL (2000), PRE (2001) always uncovered always covered = unfrozen

  12. Mean-field theory result is lower than experimental values for c > e=2.7183 Leaf-removal algorithms works in this region 2.7183

  13. What’s wrong with this simple mean-field theory? There exist strong correlations among vertices when c>e!

  14. Long-range frustration among unfrozen vertices The spin value of an unfrozen vertex will fluctuate among different best solutions of the old graph. Spin value fluctuations of different unfrozen vertices may be correlated in the sense that certain combination of spin values may never appear in any best solutions. For example, it might be the case that the unfrozen vertices are not simultaneously covered in any single best solution.

  15. Instability analysis of the RS solution in terms of long-range frustration

  16. Improving the RS solution with long-range-frustration We introduce a long-range frustration order parameter Rto characterize the probability of any two unfrozen vertices being strongly correlated. R could be calculated by calculating the probability that, if one performs a perturbation to the state of an unfrozen vertices, this perturbation will propagate to influence the states of a finite fraction of other unfrozen vertices.

  17. j i tree • Vertex i and j can be occupied simultaneously tree

  18. j i tree • Vertex i and j can still be occupied simultaneously giant component, contain loops

  19. j i with probability ½, vertices i and j can be simultaneously occupied

  20. calculate R f(s): the probability that a randomly chosen unfrozen vertex i, when flipped to the –1 state, will eventually fix the spin values of s unfrozen vertices, s begin finite.

  21. self-consistent equations

  22. ¤ 2 7 1 8 3 c e = = : : : : Long range frustration order parameter R

  23. Proliferation of many macroscopic states and the Survey propagation algorithm

  24. Within a macroscopic state, a vertex is: either always covered or always uncovered or being unfrozen

  25. always uncovered always covered = unfrozen

  26. Further organization of the solution space

  27. Instability of the 1RSB solution in terms of long-range-frustration within a macrostate • Some unfrozen vertices in a macrostate are supposed to be type-I initially • Evolution of the fraction of type-I unfrozen vertices in a macrostate • Persistence of type-I vertices  1RSB instability

  28. J. Zhou, H. Ma, H. Zhou, JSTAT, L06001 (2007)

  29. Improving 1RSB solution in terms of long-range frustration?(do not go to 2RSB) This might be an interesting question.

  30. Conclusion • Long-range frustrations among unfrozen vertices can be used to study the possibility clustering of the zero-temperature configuration space of a spin-glass system (stability analysis) • Combining LRF and the cavity method to give corrections to mean-field predictions.

More Related