In the last 30 years it was found that many combinatorial systems undergo phase transitions. One of the most important examples of these can be found among the random k-satisfiability problems (often referred to as k-SAT), asking whether there exists an assignment of Boolean values satisfying a...

Complex systems can be described in terms of networks capturing the intricate web of connections among the units they are made of. Here we review two aspects of the possible organization of such networks. First, we provide a phenomenological theory for topological transitions in restructuring...