Barak-Erdös graphs and the infinite-bin model

Date/heure
9 janvier 2020
09:15 - 10:15

Oratrice ou orateur
Sanjay Ramassamy

Catégorie d'évènement
Groupe de travail Probabilités et Statistique


Résumé

Barak-Erdös graphs are the directed acyclic version of Erdös-Rényi
random graphs : the vertex set is {1,…,n} and for each i<j with
probability p we add an edge directed from i to j, independently for
each pair i0 and is differentiable once but not twice at p=0. We also show
that the coefficients of the Taylor expansion at p=1 of C(p) are
integers, suggesting that C(p) is the generating function of some class
of combinatorial objects.