Abstract

Random graphs are the area of mathematics that draws recently more and attention. It is mostly due to their applicability in theory of information, network modelling, statistical physics and biology, to name the few. The aim of the talk is to present how combining standard methods of probablilty and random graphs theory with dynamical-sytems based approach lead to some surprising and interesting results. In particular, it lead to a proof of so-called e-cutoff conjecture, which was one of the important open problems in the theory of networking and communication.