The Erdős–Rényi random graph: standard vs frozen
1 : LAGA
Université Sorbonne Paris nord
We will start by reviewing classical results on connected components in the standard Erdős–Rényi graph, in particular the emergence of a giant component and the time for connectivity. We will then introduce a modified version of this standard model that prevents creation of the giant component by freezing the evolution of components with a unique cycle and forbidding multicyclic components. Our aim is to understand how this freezing mechanism affects the evolution of component sizes. We will also study the first time at which the entire graph becomes frozen -- that is when all connected components are unicyclic -- and its vicinity.
Based on a joint work with Vincent Viau.
| Subject : | : | Talk |
| Topics | : | Probability Theory |
| PDF version | : |  PDF version |
