Stability analysis on the finite-temperature replica-symmetric and first-step replica-symmetry-broken cavity solutions of the random vertex cover problem.

The vertex cover problem is a prototypical hard combinatorial optimization problem. It was studied in recent years by physicists using the cavity method of statistical mechanics. In this paper, the stability of the finite-temperature replica-symmetric (RS) and the first-step replica-symmetry-broken (1RSB) cavity solutions of the vertex cover problem on random regular graphs of finite vertex degree K are analyzed by population dynamics simulations. We found that (1) the lowest temperature for the RS solution to be stable, T(RS)(K), is not a monotonic function of K; (2) at relatively large connectivity K and temperature T slightly below the dynamic transition temperature T(d)(K), the 1RSB solutions with small but non-negative complexity values are stable, and (3) the dynamical transition temperature T(d) and Kauzmann temperature T(K) is equal to each other. Similar results are obtained on random Poissonian graphs.

[1]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[2]  Florent Krzakala,et al.  Phase Transitions in the Coloring of Random Graphs , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  F. Krzakala,et al.  Potts glass on random graphs , 2007, 0710.3336.

[4]  Kihong Park,et al.  On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets , 2001, SIGCOMM '01.

[5]  M. Bauer,et al.  Core percolation in random graphs: a critical phenomena analysis , 2001, cond-mat/0102011.

[6]  A. Montanari,et al.  On the nature of the low-temperature phase in discontinuous mean-field spin glasses , 2003, cond-mat/0301591.

[7]  Haijun Zhou.  Long Range Frustrations in a Spin Glass Model of the Vertex Cover Problem , 2005, Physical review letters.

[8]  M. Mézard,et al.  Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Florent Krzakala,et al.  Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Lenka Zdeborová,et al.  Constraint satisfaction problems with isolated solutions are hard , 2008, ArXiv.

[11]  Béla Bollobás,et al.  Random Graphs , 1985 .

[12]  J. Gómez-Gardeñes,et al.  Immunization of real complex communication networks , 2006 .

[13]  Heejo Lee,et al.  On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets , 2001, SIGCOMM 2001.

[14]  Lenka Zdeborová,et al.  Locked constraint satisfaction problems. , 2008, Physical review letters.

[15]  Andrea Montanari,et al.  Clusters of solutions and replica symmetry breaking in random k-satisfiability , 2008, ArXiv.

[16]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[17]  Andrea Montanari,et al.  Gibbs states and the set of solutions of random constraint satisfaction problems , 2006, Proceedings of the National Academy of Sciences.

[18]  M. Mézard,et al.  Reconstruction on Trees and Spin Glass Transition , 2005, cond-mat/0512295.

[19]  Haijun Zhou.  T-->0 mean-field population dynamics approach for the random 3-satisfiability problem. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[21]  A. Montanari,et al.  On the Dynamics of the Glass Transition on Bethe Lattices , 2005, cond-mat/0509366.

[22]  Lenka Zdeborová,et al.  Statistical Physics of Hard Optimization Problems , 2008, ArXiv.

[23]  Michael Chertkov,et al.  Loop series for discrete statistical models on graphs , 2006, ArXiv.

[24]  M. Mézard,et al.  The Bethe lattice spin glass revisited , 2000, cond-mat/0009418.

[25]  Haijun Zhou,et al.  Message passing for vertex covers , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  M. Mézard,et al.  Glass models on Bethe lattices , 2003, cond-mat/0307569.

[27]  Rajeev Rastogi,et al.  Efficiently monitoring bandwidth and latency in IP networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[28]  M. Mézard,et al.  The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  Haijun Zhou,et al.  Vertex cover problem studied by cavity method: Analytics and population dynamics , 2003 .

[31]  Haijun Zhou,et al.  Ground-state entropy of the random vertex-cover problem. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Andrea Montanari,et al.  Instability of one-step replica-symmetry-broken phase in satisfiability problems , 2003, ArXiv.

[33]  A. Pagnani,et al.  Near-optimal configurations in mean-field disordered systems. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  M. Weigt,et al.  Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Haijun Zhou,et al.  Long-range frustration in T = 0 first-step replica-symmetry-broken solutions of finite-connectivity spin glasses , 2007, 0706.0259.

[36]  Lenka Zdeborová,et al.  The number of matchings in random graphs , 2006, ArXiv.