On smoothed analysis in dense graphs and formulas

We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by Bohman and colleagues (Random Struct Algor 22 (2003), 33-42; Random Struct Algor 24 (2004), 105-117). Here we obtain a sharp threshold for the appearance of a fixed subgraph and for certain Ramsey properties. We also consider a related model of random k-SAT formulas, where an instance is obtained by adding random k-clauses to a fixed formula with a given number of clauses, and derive tight bounds for the non-satisfiability of the thus-obtained random formula. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006

[1]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[2]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[3]  B. Bollobás.  The evolution of random graphs , 1984 .

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

[5]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6]  Andreas Goerdt,et al.  A Threshold for Unsatisfiability , 1992, MFCS.

[7]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Vojtech Rödl,et al.  Random Graphs with Monochromatic Triangles in Every Edge Coloring , 1994, Random Struct. Algorithms.

[9]  V. Rödl,et al.  Threshold functions for Ramsey properties , 1995 .

[10]  Andreas Goerdt.  A Threshold for Unsatisfiability , 1996, J. Comput. Syst. Sci..

[11]  Yoshiharu Kohayakawa,et al.  Threshold functions for asymmetric Ramsey properties involving cycles , 1997 .

[12]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[13]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

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

[15]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[16]  Tom Bohman,et al.  How many random edges make a dense graph hamiltonian? , 2003, Random Struct. Algorithms.

[17]  Yuval Peres,et al.  The threshold for random k-SAT is 2k (ln 2 - O(k)) , 2003, STOC '03.

[18]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[19]  Alan M. Frieze,et al.  Adding random edges to dense graphs , 2004, Random Struct. Algorithms.

[20]  Benny Sudakov,et al.  How many random edges make a dense hypergraph non-2-colorable? , 2008 .