Nicolas Broutin

Visiting Associate Professor of Mathematics at NYU Shanghai
Research Scientist at Inria Paris-Rocquencourt

Nicolas Broutin is a Visiting Associate Professor of Mathematics at NYU Shanghai.  He is also a research scientist at Inria Paris-Rocquencourt. He holds a MEng from Ecole Polytechnique (Paris), a PhD from McGill University and an Habilitation from UPMC Paris 6.

Professor Broutin’s research interests are probability, random structures and algorithms. His work has appeared for instance in Probability Theory and Related Fields, The Annals of Probability and the Annals of Applied Probability.

Recent Publications

  • L. Addario-Berry, N. Broutin and C. Goldschmidt.  "The continuum limit of critical random graphs". Probability Theory and Related Fields, vol. 152, p. 367--406, 2012.
  • N. Broutin,R. Neininger, and H. Sulzbach. "A limit process for partial match queries in random quadtrees and 2-d trees".  The Annals of Applied Probability, vol. 23, pp. 2560--2603, 2013.
  • N. Broutin and H. Sulzbach. "The dual tree of a recursive triangulation of the disk". The Annals of Probability, vol. 43, pp. 738--781, 2015.
  • N. Broutin and J.-F. Marckert. "A new encoding of combinatorial coalescent processes. Applications to the additive and multiplicative cases". Probability Theory and Related Fields, vol. 166, pp 515–552, 2016.
  • L. Addario-Berry, N. Broutin, C. Goldschmidt, and G. Miermont. "The scaling limit of the minimum spanning tree of a complete graph". The Annals of Probability, to appear (78 p.), 2016.


  • Habilitation à Diriger des Recherches, Mathematics
    UPMC Paris 6, 2013
  • Ph.D., Computer Science
    McGill University, 2007
  • MS.c., Mathematics and Cognitive Sciences
    Université Bretagne Sud, 2003
  • M.Eng., Computer Science
    Ecole Polytechnique, 2001


  • French, English