The study of phase transitions in combinatorial structures such as graphs, matrices and codes goes back to the middle of the last century. But recently this theory has been transformed by ideas from statistical physics. In this talk I will given an overview of some recent results whose proofs are influenced by physics ideas. Among other things I will cover the group testing problem, a statistical inference task, and the problem of computing the threshold for a sparse random matrix to be of full rank.