Statistical mechanics of the hitting set problem

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 76, Issue 4, 2007, Pages

  Mézard, Marc ^a   Tarzia, Marco ^a  

^a UNIVERSITÉ PARIS SUD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DEFECTS; DENSITY (SPECIFIC GRAVITY); PHASE SPACE METHODS; PROBLEM SOLVING; SET THEORY;

HITTING SET PROBLEM; HYPERGRAPHS; STANDARD VERTEX COVER;

STATISTICAL MECHANICS;

EID: 35348984476     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.76.041124     Document Type: Article

References (37)

1. S. Cook, Proceedings of the Third Annual ACM Symposium on Theory of Computing (AMC, New York, 1971), pp. 151-158;
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
3. M. Weigt and A. K. Hartmann, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.63.056127 63, 056127 (2001);
4. M. Weigt and A. K. Hartmann, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.84.6118 84, 6118 (2000).
5. M. Weigt and H. Zhou, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.74. 046110 74, 046110 (2006).
6. M. Bauer and O. Golinelli, Eur. Phys. J. B EPJBFY 1434-6028 10.1007/s10051-001-8683-4 24, 339 (2001);
7. H. Zhou, Eur. Phys. J. B EPJBFY 1434-6028 10.1140/epjb/e2003-00096-4 32, 265 (2003);
8. H. Zhou, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.94.217203 94, 217203 (2005).
9. A. Frieze, Discrete Math. DSMHA4 0012-365X 10.1016/0012-365X(90)90149-C 81, 171 (1990);
10. P. Gazmuri, Networks ZZZZZZ 8756-8543 14, 367 (1984).
11. M. Mézard and G. Parisi, Eur. Phys. J. B EPJBFY 1434-6028 10.1007/PL00011099 20, 217 (2001);
12. M. Mézard and G. Parisi, J. Stat. Phys. JSTPBS 0022-4715 10.1023/A:1022221005097 111, 1 (2003).
13. M. Mézard, G. Parisi, and R. Zecchina, Science SCIEAS 0036-8075 10.1126/science.1073287 297, 812 (2002).
14. R. Monasson and R. Zecchina, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.76.3881 76, 3881 (1996).
15. G. Biroli, R. Monasson, and M. Weigt, Eur. Phys. J. B EPJBFY 1434-6028 10.1007/s100510051065 14, 551 (2000).
16. M. Mézard and R. Zecchina, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.66.056126 66, 056126 (2002).
17. F. Krzakala, A. Pagnani, and M. Weigt, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.70.046705 70, 046705 (2004);
18. R. Mulet, A. Pagnani, M. Weigt, and R. Zecchina, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.89.268701 89, 268701 (2002);
19. L. Zdeborová and F. Krzakala, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.76.031131 76, 031131 (2007).
20. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina, J. Stat. Phys. JSTPBS 0022-4715 10.1023/A:1022886412117 111, 505 (2003).
21. J. Raymond, A. Sportiello, and L. Zdeborová, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.76.011101 76, 011101 (2007).
22. G. Biroli and M. Mézard, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.88.025501 88, 025501 (2001);
23. A. Hartmann and M. Weigt, Europhys. Lett. EULEEJ 0295-5075 10.1209/epl/i2003-00383-8 62, 533 (2003);
24. M. P. Ciamarra, M. Tarzia, A. de Candia, and A. Coniglio, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.67.057105 67, 057105 (2003).
25. O. Rivoire, G. Biroli, O. Martin, and M. Mézard, Eur. Phys. J. B EPJBFY 1434-6028 10.1140/epjb/e2004-00030-4 37, 55 (2004).
26. T. Berger, IEEE Trans. Inf. Theory IETTAW 0018-9448 10.1109/TIT.2002. 1013122 48, 1741 (2002);
27. H. Q. Ngo and D.-Z. Du, Discrete Mathematical Problems with Medical Applications 55 (2000).
28. M. Mézard and C. Toninelli, e-print arXiv:0706.3104.
29. D. Dorfman, Ann. Math. Stat. AASTAD 0003-4851 14, 436 (1943).
30. M. Sobel and P. A. Groll, Bell Syst. Tech. J. BSTJAN 0005-8580 38, 1179 (1959).
31. W. H. Kautz and R. R. Singleton, IEEE Trans. Inf. Theory IETTAW 0018-9448 10.1109/TIT.1964.1053689 10, 363 (1964).
32. C. H. Li, J. Am. Stat. Assoc. JSTNAL 0003-1291 10.2307/2281652 57, 455 (1962).
33. M. Mézard, G. Parisi, and M. A. Virasoro, Spin-glass Theory and Beyond, Lecture notes in Physics Vol. 9 (World Scientific, Singapore, 1987).
34. A. Montanari and F. Ricci-Tersenghi, Eur. Phys. J. B EPJBFY 1434-6028 10.1140/epjb/e2003-00174-7 33, 339 (2003).
35. In order to generate random regular hypergraphs, we employ the fast fully polynomial randomized approximation scheme introduced in
36. M. Bayati, J. Han, and A. Saberi, Proceedings of the International Workshop on Randomization and Computation (RANDOM), 2007, e-print arXiv:cs/0702124v2.
37. Basically, the algorithm is as follows: one starts with an empty graph and sequentially adds edges between variables i and function nodes a with probability proportional to d i d a, where d i and d a denote, respectively, the remaining degrees of the variable i and the function node a.