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. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 29, 180–193, 2006

[1]  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.

[2]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

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

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

[7]  Yoshiharu Kohayakawa,et al.  Threshold functions for asymmetric Ramsey properties involving cycles , 1997, Random Struct. Algorithms.

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

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

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

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

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

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

[15]  Dimitris Achlioptas,et al.  THE THRESHOLD FOR RANDOM k-SAT IS 2k log 2 O(k) , 2004, FOCS 2004.

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