Orateur
Khaydar Nurligareev
(Université Paris 13)
Description
There are a number of combinatorial structures that admit a notion of connectivity, including graphs
as the most commonly used example. We are interested in the probability that a random labeled object
is connected, as its size tends to in?nity. We will show that the asymptotics for these probabilities can
be obtained in a common manner and that asymptotic coe?cients have a combinatorial meaning in terms
of virtual species. Moreover, we will show how to get the asymptotic probability that a random labeled
object has a given number of connected components, and we will indicate the combinatorial meaning of the
coe?cients involved in the asymptotic expansions.
This is ongoing work joint with Thierry Monteil.
