Abstract
In the years 2000, a theory of boundaries from dense graphs to " continuous " graphs (also called " graphons ") emerged, initiated in particular by Lovasz. This theory has been extended to random dense graphs (under the impetus of Diaconis and Janson), but there are very few examples where the limit is itself random.
The aim of this talk is to present a " Brownian graph " which is the limit of a family of natural uniform random graphs : the cographs.
(Based on work with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Mickaël Maazoun, Adeline Pierrot).
