Linear phase transition in random linear constraint satisfaction problems

Probability Theory and Related Fields

Volumn 129, Issue 3, 2004, Pages 410-440

  Gamarnik, David ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Linear Programming; Random Graphs; Random K SAT; Satisfiability Threshold

Indexed keywords

EID: 3042736224     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-004-0345-z     Document Type: Article

References (42)

1. [AKS81] Ajtai, M., Komlos, J., Szemeredi, E.: The longest path in a random graph. Combinatorica 1 (1), 1-12 (1981)
2. [Ald] Aldous, D.: Some open problems, http://stat-www.berkeley.edu/users/ aldous/Research/problems.ps
3. [Ald92] Aldous, D.: Asymptotics in the random assignment problem. Probab. Th. Rel. Fields (93), 507-534 (1992)
4. [Ald01] Aldous, D.: The ζ (2) limit in the random assignment problem. Random Struct. Algorithms (18), 381-418 (2001)
5. [AM02a] Achlioptas, D., Moore, C.: Almost all graphs with average degree 4 are 3-colorable. Proc. 44th Ann. Symposium on the Theory of Computing, 2002
6. [AM02b] Achlioptas, D., Moore, C.: The asymptotic order of the random k-SAT threshold. Proc. 43d IEEE Symposium on Foundations of Computer Science, 2002
7. [AN] Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Preprint
8. [ANP] Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Preprint
9. [AP] Aldous, D., Percus, A.: Scaling and universality in continuous length combinatorial optimization. Preprint
10. k ln 2 - O(k). Proc. 45th Ann. Symposium on the Theory of Computing, 2003
11. [APF98] Aronson, J., Pittel, B., Frieze, A.: Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12, 11-178 (1998)
12. [AS92] Alon, N., Spencer, J.: Probabilistic method. Wiley, 1992
13. [AS00] Achlioptas, D., Sorkin, G.: Optimal myopic algorithms for random 3-SAT. Proc. 41 st IEEE Symposium on Foundations of Computer Science, 2000
14. [AS03] Aldous, D., Steele, J.M.: The objective method: Probabilistic combinatorial optimization and local weak convergence. Discrete Combinatorial Probability, H. Kesten, (ed.), Springer-Verlag, 2003
15. [Ban02] Bandyopadhyay, A.: Bivariate uniqueness in the logistic fixed point equation. Technical Report 629, Department of Statistics, UC, Berkeley, 2002
16. [Bo185] Bollobas, B.: Random graphs. Academic Press, Inc., 1985
17. [CGHS03] Coppersmith, D., Gamarnik, D., Hajiaghayi, M., Sorkin, G.: Random MAXSAT., random MAXCUT., and their phase transitions. To appear in Random Structures and Algorithms
18. [COMS03] Coja-Oghlan, A., Moore, C., Sanwalani, V.: MAX k-CUT and approximating the chromatic number of random graphs. Proceedings of ICALP, 2003
19. [CR92] Chvatal, V., Reed, B.: Mick gets some (the odds are on his side). Proc. 33d Symposium on Foundations of Computer Science, 1992
20. [DBM00] Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000
21. [dlV79] Fernandez de la Vega, W.: Long paths in random graphs. Studia Math. Hungar 14, 335-340 (1979)
22. [dlV92] Fernandez de la Vega, W.: On random 2-SAT. Unpublished manuscript, 1992
23. [Dur96] Durrett, R.: Probability: theory and examples. Duxbury Press, second edition, 1996
24. [Fri85] Frieze, A.: On the value of a random minimum spanning tree problem. Disc. Appl. Math. 10, 47-56 (1985)
25. [Fri86] Frieze, A.: On large matchings and cycles in sparse random graphs. Disc. Math. 59, 243-256 (1986)
26. [Fri99] Friedgut, E.: Sharp thresholds of graph proprties, and the k-SAT problem. J. Am. Math. Soc. 4, 1017-1054 (1999)
27. [FW02] Frieze, A., Wormald, N.: Random k-S AT: A tight threshold for moderately growing k. Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, pp. 1-6
28. [Goe92] Goerdt, A.: A threshold for unsatisfiability. Mathematical Foundations of Computer Science, 17th International Symposium. I.M. Havel and V. Koubek, (eds.), Lecture Notes on Computer Science, No. 629, Springer Verlag 1992, 264-274.
29. [Goe96] Goerdt, A.: A threshold for unsatisfiability. J. Comput. Syst. Sci. 53, 469-486 (1996)
30. [Gri99] Grimmett, G.: Percolation. Springer, 1999
31. [JLR00] Janson, S., Luczak, T., Rucinski, A.: Random graphs. John Wiley and Sons, Inc., 2000
32. [KKL02] Kaporis, A.C. Kirousis, L.M., Lalas, E.: The probabilistic analysis of a greedy satisfiability algorithm. 5-th International Symposium on the Theory and Applications of Satisfiability Testing, 2002, pp. 362-376
33. [KS81] Karp, R., Sipser, M.: Maximum matchings in sparse random graphs. 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 364-375
34. [LPSA94] Langlands, R., Pouliot, P., Saint-Aubin, Y.: Conformal invariance for two-dimensional percolation. Bull. Am. Math Soc. (N.S.) 30 (1), 1-61 (1994)
35. [Mol01] Molloy, M.: Thresholds for colourability and satisfiability for random graphs and boolean formulae. Surveys in Combinatorics, J. Hirschfield, (ed.), Cambridge University Press, 2001
36. [MP87] Mezard, M., Parisi, G.: On the solution of the random link matching problem. J. Physique 48, 1451-1459 (1987)
37. [PS98] Papadimitriou, C., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Dover, 1998
38. [Sch01] Schramm, O.: A percolation formula. Elect. Commun. Prob. 6, 115-120 (2001)
39. [Sch03] Schrijver, A.: Combinatorial optimization. Volume A, Springer, 2003
40. [Ste02] Steele, J.M.; Minimal spanning trees for graphs with random edge lenghts. Mathematics and Computer Science II. Algorithms, Trees, Combinatorics and Probabilities, 2002, 223-246
41. [SW01] Smirnov, S., Werner, W.: Critical exponents for two-dimensional percolation. Math. Res. Lett. 8 (5-6), 729-744 (2001)
42. [Tal01] Talagrand, M.: The high temperature case of the K-sat problem. Prob. Theor. Related Fields 119, 187-212 (2001)