Abstract.
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints
on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from
also uniformly at random. This procedure is repeated m times independently. We are interested in whether the resulting linear programming problem is feasible. We prove that the feasibility property experiences a linear phase transition, when n→∞ and m = cn for a constant c. Namely, there exists a critical value c
* such that, when c < c
*, the problem is feasible or is asymptotically almost feasible, as n→∞, but, when c>c
*, the ‘‘distance’’ to feasibility is at least a positive constant independent of n. Our result is obtained using the combination of a powerful local weak convergence method developed in Aldous [Ald92], [Ald01], Aldous and Steele [AS03], Steele [Ste02] and martingale techniques. By exploiting a linear programming duality, our theorem implies the following result in the context of sparse random graphs G(n, cn) on n nodes with cn edges, where edges are equipped with randomly generated weights. Let ℳ(n, c) denote maximum weight matching in G(n, cn). We prove that when c is a constant and n → ∞, the limit lim
n→∞
ℳ(n, c)/n, exists, with high probability. We further extend this result to maximum weight b-matchings also in G(n, cn).
References
Ajtai, M., Komlos, J., Szemeredi, E.: The longest path in a random graph. Combinatorica 1 (1), 1–12 (1981)
Aldous, D.: Some open problems. http://stat-www.berkeley.edu/users/aldous/ Research/problems.ps
Aldous, D.: Asymptotics in the random assignment problem. Probab. Th. Rel. Fields (93), 507–534 (1992)
Aldous, D.: The ζ(2) limit in the random assignment problem. Random Struct. Algorithms (18), 381–418 (2001)
Achlioptas, D., Moore, C.: Almost all graphs with average degree 4 are 3-colorable. Proc. 44th Ann. Symposium on the Theory of Computing, 2002
Achlioptas, D., Moore, C.: The asymptotic order of the random k-SAT threshold. Proc. 43d IEEE Symposium on Foundations of Computer Science, 2002
Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Preprint
Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Preprint
Aldous, D., Percus, A.: Scaling and universality in continuous length combinatorial optimization. Preprint
Achlioptas, D., Peres, Y.: The threshold for random k-SAT is 2k ln 2 – O(k). Proc. 45th Ann. Symposium on the Theory of Computing, 2003
Aronson, J., Pittel, B., Frieze, A.: Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Struct. Algorithms 12, 11–178 (1998)
Alon, N., Spencer, J.: Probabilistic method. Wiley, 1992
Achlioptas, D., Sorkin, G.: Optimal myopic algorithms for random 3-SAT. Proc. 41st IEEE Symposium on Foundations of Computer Science, 2000
Aldous, D., Steele, J.M.: The objective method: Probabilistic combinatorial optimization and local weak convergence. Discrete Combinatorial Probability, H. Kesten, (ed.), Springer-Verlag, 2003
Bandyopadhyay, A.: Bivariate uniqueness in the logistic fixed point equation. Technical Report 629, Department of Statistics, UC, Berkeley, 2002
Bollobas, B.: Random graphs. Academic Press, Inc., 1985
Coppersmith, D., Gamarnik, D., Hajiaghayi, M., Sorkin, G.: Random MAXSAT., random MAXCUT., and their phase transitions. To appear in Random Structures and Algorithms
Coja-Oghlan, A., Moore, C., Sanwalani, V.: MAX k-CUT and approximating the chromatic number of random graphs. Proceedings of ICALP, 2003
Chvatal, V., Reed, B.: Mick gets some (the odds are on his side). Proc. 33d Symposium on Foundations of Computer Science, 1992
Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000
Fernandez de la Vega, W.: Long paths in random graphs. Studia Math. Hungar 14, 335–340 (1979)
Fernandez de la Vega, W.: On random 2-SAT. Unpublished manuscript, 1992
Durrett, R.: Probability: theory and examples. Duxbury Press, second edition, 1996
Frieze, A.: On the value of a random minimum spanning tree problem. Disc. Appl. Math. 10, 47–56 (1985)
Frieze, A.: On large matchings and cycles in sparse random graphs. Disc. Math. 59, 243–256 (1986)
Friedgut, E.: Sharp thresholds of graph properties, and the k-SAT problem. J. Am. Math. Soc. 4, 1017–1054 (1999)
Frieze, A., Wormald, N.: Random k-SAT: A tight threshold for moderately growing k. Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, pp. 1–6
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.
Goerdt, A.: A threshold for unsatisfiability. J. Comput. Syst. Sci. 53, 469–486 (1996)
Grimmett, G.: Percolation. Springer, 1999
Janson, S., Luczak, T., Rucinski, A.: Random graphs. John Wiley and Sons, Inc., 2000
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
Karp, R., Sipser, M.: Maximum matchings in sparse random graphs. 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 364–375
Langlands, R., Pouliot, P., Saint-Aubin, Y.: Conformal invariance for two-dimensional percolation. Bull. Am. Math Soc. (N.S.) 30 (1), 1–61 (1994)
Molloy, M.: Thresholds for colourability and satisfiability for random graphs and boolean formulae. Surveys in Combinatorics, J. Hirschfield, (ed.), Cambridge University Press, 2001
Mezard, M., Parisi, G.: On the solution of the random link matching problem. J. Physique 48, 1451–1459 (1987)
Papadimitriou, C., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Dover, 1998
Schramm, O.: A percolation formula. Elect. Commun. Prob. 6, 115–120 (2001)
Schrijver, A.: Combinatorial optimization. Volume A, Springer, 2003
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
Smirnov, S., Werner, W.: Critical exponents for two-dimensional percolation. Math. Res. Lett. 8 (5–6), 729–744 (2001)
Talagrand, M.: The high temperature case of the K-sat problem. Prob. Theor. Related Fields 119, 187–212 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gamarnik, D. Linear phase transition in random linear constraint satisfaction problems. Probab. Theory Relat. Fields 129, 410–440 (2004). https://doi.org/10.1007/s00440-004-0345-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-004-0345-z
Key words or phrases:
- Random K-SAT
- Satisfiability Threshold
- Linear Programming
- Random Graphs