Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Two classic "phase transitions" in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a random 2-SAT formula from satisfiable to unsatisfiable as the density of clauses increases. The random-graph result has been extended to the case of prescribed degree sequences, where the almost-sure nonexistence or existence of a giant component is related to a simple property of the degree sequence. We similarly extend the satisfiability result, by relating the almost-sure satisfiability or unsatisfiability of a random 2-SAT formula to an analogous property of its prescribed literal-degree sequence. The extension has proved useful in analyzing literal-degree-based algorithms for (uniform) random 3-SAT. © Springer 2007.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Nimrod Megiddo
Journal of Symbolic Computation
Charles A Micchelli
Journal of Approximation Theory
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence