Ander Lamaison (FU Berlin)

2020/01/17, 13:00

Before the BMS Friday Colloquium by Prof. Bhargav Narayanan

Before the BMS Friday Colloquium by Prof. Bhargav Narayanan

Urania Berlin, on the second floor

We construct a graph randomly by taking $n$ vertices and, for every pair of them, we draw an edge between them with probability $p$. As it turns out, if we slowly increase $p$, the properties of the graph that we obtain change drastically at certain values of $p$. In this talk we introduce the concept of threshold probability, and discuss what properties we expect to see in the random graph for different ranges of $p$.