6 citations · 10 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
The birth of the strong components
Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona +2
Random directed graphs undergo a phase transition around the point , and the width of the transition window has been known since the works of Luczak and Seierstad…
math.CO2020
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Combinatorial samplers are algorithmic schemes devised for the approximate- and exact-size generation of large random combinatorial structures, such as context-free words, various…
math.CO2020★ 3 cited
Counting directed acyclic and elementary digraphs
Élie de Panafieu, Sergey Dovgal
Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, w…