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

Slides:



Advertisements
Similar presentations
APRIL 2010 AARHUS UNIVERSITY Simulation of probed quantum many body systems.
Advertisements

Optimization in mean field random models Johan Wästlund Linköping University Sweden.
#2] Spin Glasses Experimentally driven 1972; theoretical explained beginning in 1975 onwards… Still questions today! Last of the classical (not quantum,
Dynamical mean-field theory and the NRG as the impurity solver Rok Žitko Institute Jožef Stefan Ljubljana, Slovenia.
Modern Monte Carlo Methods: (2) Histogram Reweighting (3) Transition Matrix Monte Carlo Jian-Sheng Wang National University of Singapore.
Boris Altshuler Columbia University Anderson Localization against Adiabatic Quantum Computation Hari Krovi, Jérémie Roland NEC Laboratories America.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
Combinatorial optimization and the mean field model Johan Wästlund Chalmers University of Technology Sweden.
Computational problems, algorithms, runtime, hardness
Spin correlated dynamics on Bethe lattice Alexander Burin.
Convergent and Correct Message Passing Algorithms Nicholas Ruozzi and Sekhar Tatikonda Yale University TexPoint fonts used in EMF. Read the TexPoint manual.
A Concept of Environmental Forecasting and Variational Organization of Modeling Technology Vladimir Penenko Institute of Computational Mathematics and.
Quasiparticle anomalies near ferromagnetic instability A. A. Katanin A. P. Kampf V. Yu. Irkhin Stuttgart-Augsburg-Ekaterinburg 2004.
Elasticity and structural phase transitions in single biopolymer systems Haijun Zhou ( 周海军 ) Institute of Theoretical Physics, the Chinese Academy of Sciences,
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
The spinning computer era Spintronics Hsiu-Hau Lin National Tsing-Hua Univ.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
How is this going to make us 100K Applications of Graph Theory.
1 Introduction to Approximation Algorithms Lecture 15: Mar 5.
Approximation Algorithms: Bristol Summer School 2008 Seffi Naor Computer Science Dept. Technion Haifa, Israel TexPoint fonts used in EMF. Read the TexPoint.
Spin Glasses and Complexity: Lecture 3 Work done in collaboration with Charles Newman, Courant Institute, New York University Partially supported by US.
Some Surprises in the Theory of Generalized Belief Propagation Jonathan Yedidia Mitsubishi Electric Research Labs (MERL) Collaborators: Bill Freeman (MIT)
ABSTRACT This work concerns with the analysis and modelling of possible magnetohydrodynamic response of plasma of the solar low atmosphere (upper chromosphere,
Random matching and traveling salesman problems Johan Wästlund Chalmers University of Technology Sweden.
Outline Review of extended ensemble methods (multi-canonical, Wang-Landau, flat-histogram, simulated tempering) Replica MC Connection to parallel tempering.
ACKNOWLEDGMENTS This research was supported by the National Science Foundation of China (NSFC) under grants , , , the Specialized.
Dynamical Replica Theory for Dilute Spin Systems Jon Hatchett RIKEN BSI In collaboration with I. Pérez Castillo, A. C. C. Coolen & N. S. Skantzos.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Yaomin Jin Design of Experiments Morris Method.
International Workshop on Complex Networks, Seoul (23-24 June 2005) Vertex Correlations, Self-Avoiding Walks and Critical Phenomena on the Static Model.
Physics Fluctuomatics / Applied Stochastic Process (Tohoku University) 1 Physical Fluctuomatics Applied Stochastic Process 9th Belief propagation Kazuyuki.
自旋玻璃与消息传递算法 Spin Glass and Message-Passing Algorithms 周海军 中国科学院理论物理研究所.
Jan., 2010Aspen Winter Physics Conference XXVI M. Block 1 Analytic LO Gluon Distributions from the proton structure function F 2 (x,Q 2 ) > New PDF's.
Survey Propagation. Outline Survey Propagation: an algorithm for satisfiability 1 – Warning Propagation – Belief Propagation – Survey Propagation Survey.
Spin Glasses: Lectures 2 and 3 Parisi solution of SK model: Replica symmetry breaking (RSB) Parisi solution of SK model: Replica symmetry breaking (RSB)
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Section 7-1 Review and Preview.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Pavel Stránský Complexity and multidiscipline: new approaches to health 18 April 2012 I NTERPLAY BETWEEN REGULARITY AND CHAOS IN SIMPLE PHYSICAL SYSTEMS.
Bayesian Reasoning: Tempering & Sampling A/Prof Geraint F. Lewis Rm 560:
IVW2005, TIFR, India Jan.11(2005)1 Dingping Li School of Physics, Peking University, China Baruch Rosenstein, NCTS&NCTU, Hsinchu, Taiwan, Weizmann Institute&Bar.
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
The Helical Luttinger Liquid and the Edge of Quantum Spin Hall Systems
Local Predictability of the Performance of an Ensemble Forecast System Liz Satterfield and Istvan Szunyogh Texas A&M University, College Station, TX Third.
13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.
Optimization Problems
CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.
Mean Field Theories in Neuroscience B. Cessac, Neuromathcomp, INRIA.
@ 15/7/2003 Tokyo Institute of Technology 1 Propagating beliefs in spin- glass models Yoshiyuki Kabashima Dept. of Compt. Intel. & Syst.
Phase Transitions of Complex Networks and related Xiaosong Chen Institute of Theoretical Physics Chinese Academy of Sciences CPOD-2011, Wuhan.
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
August, 2005 Department of Computer Science, University of Ioannina Ioannina - GREECE 1 To STOP or not to STOP By I. E. Lagaris A question in Global Optimization.
Arthur Straube PATTERNS IN CHAOTICALLY MIXING FLUID FLOWS Department of Physics, University of Potsdam, Germany COLLABORATION: A. Pikovsky, M. Abel URL:
What does HTL lose? Hui Liu Jinan University, China.
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2013 Figures are taken.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
ICTP School and Workshop on Structure and Function of complex Networks (16-28 May 2005) Structural correlations and critical phenomena of random scale-free.
A New Potential Energy Surface for N 2 O-He, and PIMC Simulations Probing Infrared Spectra and Superfluidity How precise need the PES and simulations be?
Theory of Computational Complexity Yusuke FURUKAWA Iwama Ito lab M1.
NTNU 2011 Dimer-superfluid phase in the attractive Extended Bose-Hubbard model with three-body constraint Kwai-Kong Ng Department of Physics Tunghai University,
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Biointelligence Laboratory, Seoul National University
New Results of the Color Diversity Problem Jack Raymond (英偉文) and K. Y
Computational Physics (Lecture 10)
Spin Glass Cavity Method in Random K-Satisfiability Problem
Dynamic Graph Partitioning Algorithm
                                                                                                                                                                                                  
Cosmological Scaling Solutions
Presentation transcript:

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 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 1. H.Z., Phys. Rev. Lett. 94: (2005) 2. H.Z., New J. Phys. 7: 123 (2005) 3. Martin Weigt and H.Z., Phys. Rev. E 74: (2006) 4. Jie Zhou, Hui Ma, H.Z., J. Stat. Mech. L06001 (2007) Collaborators: Kang LiHui MaMartin WeigtJie Zhou

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: (1) vertices that are always covered (frozen vertices) (2) vertices that are always uncovered (frozen vertices) (3) 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 Mezard, Parisi (2001) Mezard, Parisi (2003) The cavity method. Add a new vertex (0) to a system of N old vertices.

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 = always uncovered always covered unfrozen Weigt, Hartmann, PRL (2000), PRE (2001)

12

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

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

15 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.

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

17

18 We introduce a long-range frustration order parameter R to 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. Improving the RS solution with long-range-frustration

19 i j  Vertex i and j can be occupied simultaneously tree

20 i j  Vertex i and j can still be occupied simultaneously giant component, contain loops tree

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

22 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.

23 self-consistent equations

24 Long range frustration order parameter R c ¤ = e = 2 : 7183 :::

25

26 Proliferation of many macroscopic states and the Survey propagation algorithm

27

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

29 = always uncovered always covered unfrozen

30 neighborsvertex iprobabilityVC size increase re-weighted probability all unfrozen or always covered always uncovered 0 at least one always uncovered unfrozen or always covered +1

31

32

33 Further organization of the solution space

34

35 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

36

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

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

39 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.