Résumé : I will explain how the exploration of graphs using Prim's algorithm, or invasion percolation, yields intuitive approaches to some scaling limits the classical multiplicative coalescent processes related to random graphs. This work is based on joint work with J.-F. Marckert.
Dernière modification : Thursday 21 November 2024 | Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr |