# Graphon convergence of random cographs

## TL;DR

This paper investigates the asymptotic behavior of random cographs, both labelled and unlabelled, as their size grows, establishing a new probabilistic limit within the space of graphons.

## Contribution

It introduces a novel probabilistic limit for random cographs in the graphon space, advancing understanding of their large-scale structure.

## Key findings

- Established a new limit in the space of graphons for random cographs.
- Analyzed both labelled and unlabelled cographs as the number of vertices grows.
- Provided insights into the asymptotic structure of large cographs.

## Abstract

We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.