Paul Erdõs and the Erdõs-Rényi Random Graph Process
Expositor: Bela Bollobas
Instituição: University of Cambridge and University Memphis
Data e Horário: 08/03/2018 | 15:30 hs
Resumo: Paul Erdos was one of the giants of 20th century mathematics: one of his great achievements was the foundation of probabilistic combinatorics which, by now, has become one of the most active areas of mathematics. The main pillar of probabilistic combinatorics is the theory of random graphs that Erdos founded with Alfred Renyi around 1960. In my talk, intended for a general audience, I shall give a gentle introduction to this theory, with emphasis on the sharp phase transition in the component structure of the Erdos-Renyi random graph process at a certain point of itâ€™s development.