Contact Information

Laboratoire de Probabilités, Statistique et Modélisation
Sorbonne Université – Campus Pierre et Marie Curie
Boite courrier 158
4, Place Jussieu, 75252 Paris Cedex 05 – France

Office 16-26.214
4 place Jussieu, 75005 Paris – France
+33 1 39 63 56 88
nicolas.broutin@upmc.fr
https://perso.lpsm.paris/˜broutinn/

scholarGoogle Scholar profiledblpDBLParxiv arXiv.org

Vita

I graduated in Computer Science from École Polytechnique (Paris) in 2001. I then attended ENST Bretagne where I got a MSc in Mathematics and Cognitive Sciences (Cognitive Sciences Lab). I got a PhD in 2007 from McGill where I had the chance to work under the supervision of Luc Devroye. Between september 2007 and 2012, I have been a member of the Algorithms group and then the RAP team at Inria in Paris.

After ten years at Inria, I moved in September 2017 to Université Pierre et Marie Curie - Paris 6, which merged with La Sorbonne to become Sorbonne Université in January 2018. I am now affiliated with the LPSM.

Research Interests

I started by some applications to networks and gene multiplications and I now make my way towards more theoretical problems. Now looking towards probability applied to discrete structures and combinatorial geometry. Some precise current topics of research include mostly tree like structures:

  • analysis of algorithms and data structures
  • computational geometry
  • probability and branching processes
  • fragmentation and coagulation processes
  • random graphs
  • geometric networks
  • statistical physics

More about what I have done.

Selected Publications

The scaling limit of the minimum spanning tree of a complete graph. L. Addario-Berry, N. Broutin, C. Goldschmidt, and G. Miermont.
The Annals of Probability, vol. 45, 3075--3144, 2017.
The dual tree of a recursive triangulation of the disk. N. Broutin and H. Sulzbach.
The Annals of Probability, vol. 43, pp. 738--781, 2015.
Connectivity threshold for Bluetooth graphs. N. Broutin, L. Devroye, N. Fraiman, and G. Lugosi.
Random Structures and Algorithms, vol. 44, pp. 45--66, 2014.
A limit process for partial match queries in random quadtrees and 2-d trees. N. Broutin, R. Neininger, and H. Sulzbach.
The Annals of Applied Probability, vol. 23, pp. 2560--2603, 2013.
The continuum limit of critical random graphs. L. Addario-Berry, N. Broutin and C. Goldschmidt.
Probability Theory and Related Fields, vol. 152, pp.367--406, 2012.

Seminars in or around Paris

Les probas du vendredi, Fridays at 11:00, Sorbonne Université, Jussieu.

Séminaire de Probabilités, Tuesdays at 14:00, LPSM, Sorbonne Université, Jussieu.

Séminaire Parisien de Statistique, Mondays, IHP.

Groupe de travail Modélisation Stochastique, Thursdays at 11:30, LPSM, Sophie Germain.

Séminaire Philippe Flajolet, Thursday, every other month, IHP.

Séminaire Francilien de Géométrie algorithmique, Thursday 14:00--16:30, once a month, IHP.

Séminaire Info/Maths Thursdays 16:00--17:00, LJLL, Sorbonne Université.

Students and Postdocs

Past: Cecilia Holmgren (Postdoc 2010–-2011), Juan Pablo Vigneaux (M1 2013), Henning Sulzbach (Postdoc 2013–-2014), Minmin Wang (PhD 2014), Awa Samaké (MSc 2018), Lucas Iziquel (MSc 2018), Robin Khanfir (MSc 2019), Arthur Blanc-Renaudie (MSc 2019, PhD 2022), Othmane Safsafi (PhD 2021), Hervé Gras (MSc 2021), Victor Dubach (MSc 2021), Francisco Calvillo (MSc 2022).

Current: Francisco Calvillo (PhD), Lucas Iziquel (PhD), Roman Gambelin (PhD).