The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
How many random edges make a dense hypergraph non-2-colorable?
Random Structures & Algorithms
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Smoothed Analysis of Balancing Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The smoothed analysis of algorithms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
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