3 papers
stat.ME2026
A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs
Alexander G. Reisach, Antoine Chambaz, Gilles Blanchard +1
Random directed acyclic graphs (DAGs) based on imposing an order on ErdÅs-Rényi and scale free random graphs are widely used for evaluating causal discovery algorithms. We show t…
math.PR2026
A phase transition in ErdÅs-Barak random graphs
Gilles Blanchard, Nicolas Curien, Klara Krause +1
We study monotone paths in ErdÅs-Rényi random graphs on numbered vertices. Benjamini & Tzalik established a phase transition at for this model. We refine t…
stat.ME2024
Supervised Contamination Detection, with Flow Cytometry Application
Solenne Gaucher, Gilles Blanchard, Frédéric Chazal
The contamination detection problem aims to determine whether a set of observations has been contaminated, i.e. whether it contains points drawn from a distribution different from…