Near critical-random graphs and multiplicative coalescent relatives
vendredi 21 janvier 2022, 11h00 - 12h00
In this talk I will first recall various facts from the mid 1990s about the link between near critical random graphs and entrance laws of multiplicative coalescents. The adjective « multiplicative » comes from the fact that any two blocks merge at rate proportional to the product of their masses. I will then describe a recent result, obtained in collaboration with Vitalii Konarovskyi, which extends the above mentioned link. In the new context, the initial family of near-critical graphs has a higher degree of inhomogeneity than the Erdos-Renyi-like graphs, and in the limit arise more complicated relatives of eternal multiplicative coalescents.